DocumentCode
2727622
Title
Maintenance of DBV-Trees for Transaction Insertion
Author
Bac Le ; Thien-Phuong Le ; Vo, Ba-Ngu ; Tzung-Pei Hong
Author_Institution
Dept. of Comput. Sci., Univ. of Sci., Ho Chi Minh City, Vietnam
fYear
2012
fDate
16-18 Nov. 2012
Firstpage
165
Lastpage
170
Abstract
In this paper, we present an incremental mining algorithm for handling the mining problem from inserted transactions. The algorithm is based on the Dynamic Bit-Vector (DBV) structure and pre-large item sets. The DBV structure facilitates the processes for maintaining large and pre-large item sets. The pre-large concept is used to reduce the number of database scans. The experimental results show that the proposed algorithm is faster than some other algorithms.
Keywords
data mining; database management systems; DBV-Trees maintenance; database scans; dynamic bit vector; incremental mining algorithm; inserted transactions; transaction insertion; Algorithm design and analysis; Heuristic algorithms; Itemsets; Maintenance engineering; Safety; Vectors; Data mining; Dynamic bit vector; frequent itemset; incremental mining; pre-large itemset;
fLanguage
English
Publisher
ieee
Conference_Titel
Technologies and Applications of Artificial Intelligence (TAAI), 2012 Conference on
Conference_Location
Tainan
Print_ISBN
978-1-4673-4976-5
Type
conf
DOI
10.1109/TAAI.2012.31
Filename
6395024
Link To Document