Efficiently mining unordered trees

  • Chehreghani M
  • 10

    Readers

    Mendeley users who have this article in their library.
  • 8

    Citations

    Citations of this article.

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 outper- forms the most efficient existing works on mining unordered trees.

Author-supplied keywords

  • Candidate generation
  • Frequency counting
  • Frequent tree patterns
  • Rooted unordered trees
  • Tree encoding

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Mostafa Haghir Chehreghani

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free