ExMiner: An efficient algorithm for mining Top-K frequent patterns

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4093 LNAI, Issue , 2006, Pages 436-447

  Quang, Tran Minh ^a   Oyanagi, Shigeru ^a   Yamazaki, Katsuhiro ^a  

^a RITSUMEIKAN UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA REDUCTION; DATA STRUCTURES; INFORMATION ANALYSIS; PROBLEM SOLVING; DATA MINING;

DATASETS; EXMINER; EXPLORATIVE MINING ALGORITHMS; FREQUENT PATTERN MINING ALGORITHMS; FREQUENCY PATTERNS; FREQUENT PATTERN MINING; INTERESTING INFORMATION; LARGE-SCALE DATASETS; MINIMUM SUPPORT THRESHOLDS; MINING ALGORITHMS; SYNTHETIC AND REAL DATA; USER FRIENDLY;

DATA MINING; ALGORITHMS;

EID: 33749401329     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11811305_48     Document Type: Conference Paper

References (12)

1. Agrawal, R, and Srikant, R.: Fast algorithm for mining association rules. In proc. of VLDB '94, Santiago, Chille (1994) 487-499
2. Han, J., Pei, J., and Yin, Y.: Mining frequent patterns without candidate generation. In proc. of ACM SIGMOD Conference on Management of Data (2000) 1-12
3. Bayard, R.J.: Efficiently mining long patterns from databases. In proc. of ACM SIGMOD Conference on Management of Data (1998) pp. 85-93
4. Grahne, G., and Zhu, J.: High performance mining of maxima frequent itemsets. In proc. of SIAM'03 workshop on High Performance Data Mining (2003)
5. Grahne, G., and Zhu, J.: Efficiently using prefix-tree in mining frequent itemsets. In proc. of IEEE ICDM workshop on Frequent Itemsets Mining Implementations (2003)
6. Pei, J., Han, J., and Mao, R.: CLOSET: An efficient algorithm from mining frequent closed itemsets. In proc. of DMKD'00 (2000)
7. Fu, A.W., Kwong, R.W., Tang, J.: Mining N most interesting itemsets. In proc. of ISMIS'00 (2000)
8. Han, J., Wang, J., Lu, Y. and Tzvetkov, P.: Mining top-k frequent closed patterns without minimum support. In proc. of IEEE ICDM Conference on Data Mining (2002)
9. Ly, S., Hong, S., Paul, P., and Rodney, T.: Finding the N largest itemsets. In Proc. Int. Conf. on Data Mining, Rio de Janeiro, Brazil (1998) 211-222
10. Wang, J., Han, J., Lu, Y. and Tzvetkov, P.: TFP: An efficient algorithm for mining top-k frequent closed itemsets. In proc. of IEEE Knowledge and Data Engineering, vol 17, no.5 (2005) 652-663
11. Hirate, Y., Iwahashi, E., and Yamana, H.: TF2P-growth: An efficient algorithm for mining frequent patterns without any thresholds. In proc. of ICDM (2004)
12. IBM Quest Data Mining Project. Quest synthetic data generation http://almaden.ibm.com/software/quest/Resources/index.shtnu