Mining global frequent subtrees
Chuanshen Zhao, Baoxian Jia, Yuhua Liu, Lixia Chen · 2010 Seventh International Conference on Fuzzy Systems and Knowledge Discovery · 2010
Discovering global frequent subtrees from ordered labeled trees in distribute environment is an attractive research problem in data mining. In this paper, a new algorithm FAMDFS (Fast Algorithm for Mining Global Frequent Subtree) was proposed. This algorithm transfer local projected branch frequent nodes, can decrease network traffic, improve the efficiency of the algorithm. Theoretical analysis and experimental results show that FAMDFS algorithm is efficient and effective.