Sciweavers

94 search results - page 12 / 19
» Efficient Frequent Itemsets Mining by Sampling
Sort
View
DAWAK
2009
Springer
15 years 1 months ago
TidFP: Mining Frequent Patterns in Different Databases with Transaction ID
Since transaction identifiers (ids) are unique and would not usually be frequent, mining frequent patterns with transaction ids, showing records they occurred in, provides an effic...
C. I. Ezeife, Dan Zhang
CIKM
2009
Springer
15 years 1 months ago
Efficient itemset generator discovery over a stream sliding window
Mining generator patterns has raised great research interest in recent years. The main purpose of mining itemset generators is that they can form equivalence classes together with...
Chuancong Gao, Jianyong Wang
AICCSA
2008
IEEE
216views Hardware» more  AICCSA 2008»
14 years 9 months ago
Mining fault tolerant frequent patterns using pattern growth approach
Mining fault tolerant (FT) frequent patterns from transactional datasets are very complex than mining all frequent patterns (itemsets), in terms of both search space exploration a...
Shariq Bashir, Zahid Halim, Abdul Rauf Baig
83
Voted
SDM
2009
SIAM
157views Data Mining» more  SDM 2009»
15 years 6 months ago
MUSK: Uniform Sampling of k Maximal Patterns.
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
Mohammad Al Hasan, Mohammed Javeed Zaki
88
Voted
DMIN
2006
138views Data Mining» more  DMIN 2006»
14 years 10 months ago
Mining Complete Hybrid Sequential Patterns
We discovered that the set of frequent hybrid sequential patterns obtained by previous researches is incomplete, due to the inapplicability of the Apriori principle. We design and ...
Chichang Jou