Advertisement
Published in:
2006 | OriginalPaper | Chapter
PrefixTreeESpan: A Pattern Growth Algorithm for Mining Embedded Subtrees
Authors : Lei Zou, Yansheng Lu, Huaming Zhang, Rong Hu
Published in: Web Information Systems – WISE 2006
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Frequent embedded subtree pattern mining is an important data mining problem with broad applications. In this paper, we propose a novel embedded subtree mining algorithm, called
PrefixTreeESpan
(i.e.
Prefix-Tree
-projected
E
mbedded-
S
ubtree
pa
tter
n
), which finds a subtree pattern by growing a frequent
prefix-tree
. Thus, using divide and conquer, mining local length-1 frequent subtree patterns in
Prefix-Tree-Projected database
recursively will lead to the complete set of frequent patterns. Different from
Chopper
and
XSpanner
[4],
PrefixTreeESpan
does not need a checking process. Our performance study shows that
PrefixTreeESpan
outperforms
Apriori-like
algorithm:
TreeMiner
[6], and
pattern-growth
algorithms :
Chopper
,
XSpanner
.