Frequent Subtrees Minging Based on Projected Node

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.