Name
Abstract | ||
|---|---|---|
Methods for mining frequent trees are widely used in domains like bioinformatics, web-mining, chemical compound structure mining, and so on. In this paper, we present TG, an efficient pattern growth algorithm for mining frequent embedded suttees in a forest of rooted, labeled, and ordered trees. It uses rightmost path expansion scheme to construct complete pattern growth space, and creates a projected database for every grow point of the pattern ready to grow. Then, the problem is transformed from mining frequent trees to finding frequent nodes in the projected database. We conduct detailed experiments to test its performance and scalability and find that TG outperforms TreeMiner, one of the fastest methods proposed before, by a factor of 4 to 15. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/978-3-540-31849-1_39 | APWeb |
Keywords | Field | DocType |
web mining | Data mining,Structure mining,Computer science,Theoretical computer science,Scalability | Conference |
Volume | Issue | ISSN |
3399 | null | 0302-9743 |
ISBN | Citations | PageRank |
3-540-25207-X | 0 | 0.34 |
References | Authors | |
14 | 5 | |