Frequent subtrees minging based on projected node

Authors:
Chuansehn Zhao;Lingyan Xue;Shungang He;Lixia Chen
Affiliations:
School of Computer Science, Liaocheng University, Liaocheng, China;School of Computer Science, Liaocheng University, Liaocheng, China;Informatization Office of Liaocheng, Liaocheng, China;Science and Technology Department of Dongchang, Liaocheng, China
Venue:
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 7
Year:
2009

Citing 5
Cited 0

PrefixSpan: Mining Sequential Patterns by Prefix-Projected Growth

Proceedings of the 17th International Conference on Data Engineering
H-Mine: Hyper-Structure Mining of Frequent Patterns in Large Databases

ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Efficiently mining frequent trees in a forest

Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Chopper: efficient algorithm for tree mining

Journal of Computer Science and Technology
Mining compressed frequent-pattern sets

VLDB '05 Proceedings of the 31st international conference on Very large data bases

Quantified Score

Hi-index	0.00

Visualization

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.