39 search results - page 1 / 8 » Efficiently mining frequent trees in a forest |
KDD
2002
ACM
15 years 9 months ago
2002
ACM
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 ...
ACMSE
2008
ACM
14 years 11 months ago
2008
ACM
In this paper, a new pattern-growth algorithm is presented to mine frequent sequential patterns using First-Occurrence Forests (FOF). This algorithm uses a simple list of pointers...
91
Voted
AUSDM
2008
Springer
14 years 11 months ago
2008
Springer
Share-frequent pattern mining discovers more useful and realistic knowledge from database compared to the traditional frequent pattern mining by considering the non-binary frequen...
ICDM
2002
IEEE
15 years 2 months ago
2002
IEEE
Mining of frequent itemsets is a fundamental data mining task. Past research has proposed many efficient algorithms for the purpose. Recent work also highlighted the importance of...
CIKM
2008
Springer
14 years 11 months ago
2008
Springer
This paper proposes a prefix-tree structure, called CPS-tree (Compact Pattern Stream tree) that efficiently discovers the exact set of recent frequent patterns from high-speed dat...