Frequent tree patterns have many applications in different domains such as XML document mining, user web log analysis, network routing and bioinformatics. In this paper, we first introduce three new tree encodings and accordingly present an efficient algorithm for finding frequent patterns from rooted unordered trees with the assumption that children of every node in database trees are identically labeled. Then, we generalize the method and propose the UITree algorithm to find frequent patterns from rooted unordered trees without any restriction. Compared to other algorithms in the literature, UItree manages occurrences of a candidate tree in database trees more efficiently. Our extensive experiments on both real and synthetic datasets show that UITree significantly outperforms the most efficient existing works on mining unordered trees. © 2011 IEEE.
CITATION STYLE
Chehreghani, M. H. (2011). Efficiently mining unordered trees. In Proceedings - IEEE International Conference on Data Mining, ICDM (pp. 111–120). https://doi.org/10.1109/ICDM.2011.62
Mendeley helps you to discover research relevant for your work.