DocumentCode
2507018
Title
Mining top-k closed itemsets using best-first search
Author
Songram, Panida ; Boonjing, Veera
Author_Institution
Dept. of Math. & Comput. Sci., King Mongkut´´s Inst. of Technol. Ladkrabang, Bangkok
fYear
2008
fDate
8-11 July 2008
Firstpage
77
Lastpage
82
Abstract
In this paper, we proposed an efficient algorithm, TOPK_CLOSED, for mining top-k closed itemsets. This algorithm mines top-k closed itemsets using best-first search. The closed itemsets with the highest supports are firstly found from this algorithm. Consequently, the method quickly finds top-k closed itemsets, which leads to an efficient pruning unnecessary itemsets and stop mining rapidly. In addition, this algorithm can generate closed itemsets without keeping candidates in main memory.
Keywords
data mining; tree searching; best-first search; itemset pruning; top-k closed itemset mining; Computer science; Data mining; Intrusion detection; Itemsets; Laboratories; Mathematics; Software systems; Systems engineering and theory; Testing; Transaction databases;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer and Information Technology, 2008. CIT 2008. 8th IEEE International Conference on
Conference_Location
Sydney, NSW
Print_ISBN
978-1-4244-2357-6
Electronic_ISBN
978-1-4244-2358-3
Type
conf
DOI
10.1109/CIT.2008.4594653
Filename
4594653
Link To Document