Sciweavers

39 search results - page 1 / 8
» Efficiently mining frequent trees in a forest
Sort
View
81
Voted
KDD
2002
ACM
144views Data Mining» more  KDD 2002»
15 years 11 months ago
Efficiently mining frequent trees in a forest
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 ...
Mohammed Javeed Zaki
ACMSE
2008
ACM
15 years 26 days ago
Mining frequent sequential patterns with first-occurrence forests
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...
Erich Allen Peterson, Peiyi Tang
AUSDM
2008
Springer
235views Data Mining» more  AUSDM 2008»
15 years 25 days ago
ShrFP-Tree: An Efficient Tree Structure for Mining Share-Frequent Patterns
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...
Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer,...
91
Voted
ICDM
2002
IEEE
132views Data Mining» more  ICDM 2002»
15 years 3 months ago
Speed-up Iterative Frequent Itemset Mining with Constraint Changes
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...
Gao Cong, Bing Liu
CIKM
2008
Springer
15 years 25 days ago
Efficient frequent pattern mining over data streams
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...
Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed,...