Sciweavers

389 search results - page 2 / 78
» From Path Tree To Frequent Patterns: A Framework for Mining ...
Sort
View
ICDM
2006
IEEE
118views Data Mining» more  ICDM 2006»
13 years 11 months ago
Reducing the Frequent Pattern Set
One of the major problems in frequent pattern mining is the explosion of the number of results, making it difficult to identify the interesting frequent patterns. In a recent pap...
Ronnie Bathoorn, Arne Koopman, Arno Siebes
CIKM
2008
Springer
13 years 7 months 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,...
TKDE
2008
153views more  TKDE 2008»
13 years 5 months ago
Discovering Frequent Agreement Subtrees from Phylogenetic Data
We study a new data mining problem concerning the discovery of frequent agreement subtrees (FASTs) from a set of phylogenetic trees. A phylogenetic tree, or phylogeny, is an unorde...
Sen Zhang, Jason Tsong-Li Wang
DATAMINE
2010
166views more  DATAMINE 2010»
13 years 5 months ago
Optimal constraint-based decision tree induction from itemset lattices
In this article we show that there is a strong connection between decision tree learning and local pattern mining. This connection allows us to solve the computationally hard probl...
Siegfried Nijssen, Élisa Fromont
AUSDM
2007
Springer
193views Data Mining» more  AUSDM 2007»
13 years 11 months ago
Are Zero-suppressed Binary Decision Diagrams Good for Mining Frequent Patterns in High Dimensional Datasets?
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
Elsa Loekito, James Bailey