Title :
Frequent Subtrees Minging Based on Projected Node
Author :
Zhao, Chuansehn ; Xue, Lingyan ; He, Shungang ; Chen, Lixia
Author_Institution :
Sch. of Comput. Sci., Liaocheng Univ., Liaocheng, China
Abstract :
Discovering frequent subtrees from ordered labeled trees is an important research problem in data mining with broad applications in bioinformatics, web log, XML documents and so on. In this paper, A new concept projected node was introduced, and a new algorithm FITPN( Frequent Induced subtrees mining based on Projected Node) was proposed. This algorithm does the work of distinguishing isomorphism as the same time of computing projected node, which decrease the complexity of algorithm, improve the efficiency of the algorithm. Theoretical analysis and experimental results show that FITPN algorithm is efficient and effective.
Keywords :
computational complexity; data mining; tree data structures; FITPN algorithm; algorithm complexity reduction; algorithm efficiency improvement; data mining; frequent induced subtrees mining; frequent subtrees mining; ordered labeled tree; projected node; Bioinformatics; Computer science; Data mining; Databases; Fuzzy systems; Helium; Pattern matching; Tree graphs; Vegetation mapping; XML; frequent subtree; induced subtree; projected node; tree mining;
Conference_Titel :
Fuzzy Systems and Knowledge Discovery, 2009. FSKD '09. Sixth International Conference on
Conference_Location :
Tianjin
Print_ISBN :
978-0-7695-3735-1
DOI :
10.1109/FSKD.2009.839