A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf
.
Efficiently mining frequent trees in a forest
2002
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '02
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in a forest of rooted, labeled, and ordered trees. We present TreeMiner, a novel algorithm to discover all frequent subtrees in a forest, using a new data structure called scope-list. We contrast TreeMiner with a pattern matching tree mining algorithm (PatternMatcher). We conduct detailed experiments to test the
doi:10.1145/775056.775058
fatcat:nq37ceqepjdrha7bpwceuvs4ma