Efficient Data Mining for Maximal Frequent Subtrees

@inproceedings{Xiao2003EfficientDM,
  title={Efficient Data Mining for Maximal Frequent Subtrees},
  author={Yongqiao Xiao and Jenq-Foung Yao and Zhigang Li and Margaret H. Dunham},
  booktitle={ICDM},
  year={2003}
}
A new type of tree mining is defined in this paper, which uncovers maximal frequent induced subtrees from a database of unordered labeled trees. A novel algorithm, PathJoin, is proposed. The algorithm uses a compact data structure, FST-Forest, which compresses the trees and still keeps the original tree structure. PathJoin generates candidate subtrees by joining the frequent paths in FST-Forest. Such candidate subtree generation is localized and thus substantially reduces the number of… CONTINUE READING
Highly Influential
This paper has highly influenced a number of papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 137 citations. REVIEW CITATIONS

9 Figures & Tables

Topics

Statistics

01020'03'05'07'09'11'13'15'17
Citations per Year

137 Citations

Semantic Scholar estimates that this publication has 137 citations based on the available data.

See our FAQ for additional information.