Title :
Efficient Mining of Closed Induced Ordered Subtrees in Tree-structured Databases
Author :
Ozaki, Tomonobu ; Ohkawa, Takenao
Author_Institution :
Graduate Sch. of Sci. & Technol., Kobe Univ.
Abstract :
In this paper, two new closed ordered subtree miners are given which are based on the breadth-first and depth-first/breadth-first enumeration strategy, respectively. Through the experiments with synthesized and real world data, we discuss the effects of the difference of the search strategies in mining closed induced ordered subtrees
Keywords :
data mining; database management systems; tree data structures; breadth-first enumeration strategy; closed ordered subtree miner; depth-first enumeration strategy; tree-structured database; Databases; Labeling; Pattern recognition;
Conference_Titel :
Data Mining Workshops, 2006. ICDM Workshops 2006. Sixth IEEE International Conference on
Conference_Location :
Hong Kong
Print_ISBN :
0-7695-2702-7
DOI :
10.1109/ICDMW.2006.67
