DocumentCode :
424075
Title :
I-tree: a data structure for targeted queries of closed itemsets
Author :
Xu, Li-Jun ; Xie, Kang-Lin
Author_Institution :
Dept. of Comput. Sci. & Eng., Shanghai Jiao Tong Univ., China
Volume :
3
fYear :
2004
fDate :
26-29 Aug. 2004
Firstpage :
1377
Abstract :
We design a novel data structure, I-tree to provide a quick response of specified queries of itemsets. I-tree can be built through one scan of source database, and contains all necessary information used in subsequent processing. Moreover, it contains interim results about support calculation and intersection operation, which significantly facilitate the determination of support values and closures of given itemsets.
Keywords :
data mining; query processing; tree data structures; tree searching; I-tree; closed itemsets; data structure; source database; support calculation; support values; targeted queries; Computer science; Data engineering; Data mining; Data structures; Itemsets; Tellurium; Terminology; Transaction databases; Tree data structures;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Machine Learning and Cybernetics, 2004. Proceedings of 2004 International Conference on
Print_ISBN :
0-7803-8403-2
Type :
conf
DOI :
10.1109/ICMLC.2004.1381988
Filename :
1381988
Link To Document :
بازگشت