Sciweavers

1217 search results - page 9 / 244
» On compressing frequent patterns
Sort
View
KDD
2008
ACM
246views Data Mining» more  KDD 2008»
16 years 3 months ago
Direct mining of discriminative and essential frequent patterns via model-based search tree
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
Wei Fan, Kun Zhang, Hong Cheng, Jing Gao, Xifeng Y...
KDD
2009
ACM
347views Data Mining» more  KDD 2009»
15 years 10 months ago
FpViz: a visualizer for frequent pattern mining
Over the past 15 years, numerous algorithms have been proposed for frequent pattern mining as it plays an essential role in many knowledge discovery and data mining (KDD) tasks. M...
Carson Kai-Sang Leung, Christopher L. Carmichael
ICDM
2002
IEEE
148views Data Mining» more  ICDM 2002»
15 years 8 months ago
SLPMiner: An Algorithm for Finding Frequent Sequential Patterns Using Length-Decreasing Support Constraint
Over the years, a variety of algorithms for finding frequent sequential patterns in very large sequential databases have been developed. The key feature in most of these algorith...
Masakazu Seno, George Karypis
IDEAL
2003
Springer
15 years 8 months ago
Improving the Efficiency of Frequent Pattern Mining by Compact Data Structure Design
Mining frequent patterns has been a topic of active research because it is computationally the most expensive step in association rule discovery. In this paper, we discuss the use ...
Raj P. Gopalan, Yudho Giri Sucahyo
CIKM
2006
Springer
15 years 7 months ago
Efficient mining of max frequent patterns in a generalized environment
This poster paper summarizes our solution for mining max frequent generalized itemsets (g-itemsets), a compact representation for frequent patterns in the generalized environment....
Daniel Kunkle, Donghui Zhang, Gene Cooperman