VTK: Vertical Mining of Top-Rank-K Frequent Patterns

Mining top-rank-k frequent patterns is a new topic in frequent pattern mining. In this paper, we propose a new mining algorithm called VTK, vertical mining of Top-Rank-k frequent patterns, to mining Top-Rank-k frequent patterns using some vertical skills. Our performance study shows that the VTK method is more efficient and scalable for mining both synthetic datasets and real datasets than the algorithms proposed before.

[1]  Zhi-Hong Deng,et al.  Mining Top-Rank-K Frequent Patterns , 2007, 2007 International Conference on Machine Learning and Cybernetics.

[2]  Jian Pei,et al.  Mining frequent patterns without candidate generation , 2000, SIGMOD '00.

[3]  Jiawei Han,et al.  TSP: mining top-K closed sequential patterns , 2003, Third IEEE International Conference on Data Mining.

[4]  AgrawalRakesh,et al.  Mining association rules between sets of items in large databases , 1993 .

[5]  Ferenc Bodon,et al.  Surprising Results of Trie-based FIM Algorithms , 2004, FIMI.

[6]  Jiawei Han,et al.  Mining top-k frequent closed patterns without minimum support , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[7]  Jiawei Han,et al.  TFP: an efficient algorithm for mining top-k frequent closed itemsets , 2005, IEEE Transactions on Knowledge and Data Engineering.

[8]  Mohammed J. Zaki,et al.  Fast vertical mining using diffsets , 2003, KDD '03.