DocumentCode
575001
Title
A new share frequent itemsets mining using incremental BitTable knowledge
Author
Nawapornanan, Chayanan ; Boonjing, Veera
Author_Institution
Dept. of Math. & Comput. Sci., King Mongkut´´s Inst. of Technol. Ladkrabang, Bangkok, Thailand
fYear
2011
fDate
Nov. 29 2011-Dec. 1 2011
Firstpage
358
Lastpage
362
Abstract
The share measure has been proposed as an important measure for mining association rules. The value of share itemsets provides useful information such as total profits and total customer purchased quantities associated with itemsets in database. The share-frequent itemsets mining problems become a very important research issue in data mining. Existing share-frequent itemsets mining algorithms are based on static database so knowledge must be rebuilded when the minimum share threshold is changed or database is modified either appended or updated. This paper proposes a novel BitTable knowledge for incremental and interactive share-frequent itemsets mining in multiple minimum share thresholds without rebuilding BitTable knowledge. It is effective for incremental and interactive mining to take advantage of the previous BitTable knowledge and the previous mining results.
Keywords
data mining; database management systems; association rule mining; incremental BitTable knowledge; incremental share-frequent itemsets mining; interactive mining; interactive share-frequent itemsets mining; multiple minimum share thresholds; share frequent itemsets mining; share itemsets; share measure; share-frequent itemsets mining algorithms; share-frequent itemsets mining problems; static database; total customer purchased quantities; total profits purchased quantities; Algorithm design and analysis; Association rules; Computer science; Itemsets;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Sciences and Convergence Information Technology (ICCIT), 2011 6th International Conference on
Conference_Location
Seogwipo
Print_ISBN
978-1-4577-0472-7
Type
conf
Filename
6316637
Link To Document