Title: Efficiently mining unordered trees
Authors: Haghir Chehreghani, Mostafa # ×
Issue Date: Dec-2011
Publisher: IEEE
Host Document: IEEE International Conference on Data Mining (ICDM) pages:111-120
Conference: ICDM edition:11 location:Vancouver, Canada date:11-14 December 2011
Abstract: 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.
Publication status: published
KU Leuven publication type: IC
Appears in Collections:Informatics Section
× corresponding author
# (joint) last author

Files in This Item:
File Description Status SizeFormat
uitree.pdf Published 496KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.