literature survey on constrained frequent pattern mining
P.Subhashini,Gunasekaran
Published in International Journal of Advanced Research in Computer Science Engineering and Information Technology
ISSN: 2321-3337 Impact Factor:1.521 Volume:3 Issue:1 Year: 26 June,2014 Pages:308-315
Abstract
Frequent pattern mining is a heavily researched area in the field of data mining with wide range of applications. Mining frequent patterns from large scale databases has emerged as an important problem in data mining and knowledge discovery community. Frequent Pattern Mining often generates a very large number of patterns and rules, which reduces not only the efficiency but also the effectiveness of mining. Recent work has highlighted the importance of constraint based mining paradigm in the context of mining frequent itemsets, associations, correlations, sequential patterns, and many other interesting patterns in large databases. Constraint based frequent pattern mining has been proved to be effective in reducing the search space in the frequent pattern mining task and thus in improving efficiency. We survey frequent pattern mining under various constraints which will give some ideas for the future researchers.
Kewords
patterns, knowledge discovery, associations, correlations
Reference
[1] Jian Pei, Jiawei Han ―Constrined Frequent Pattern Mining-A pattern growth view‖, SIGKDD Explorations, June 2002 Carson Kai-Sang Leung∗ [2] Carson Kai-Sang Leung, Dale A. Brajczuk, ―Efficient Algorithms for the Mining of Constrained Frequent Patterns from Uncertain Data‖, SIGKDD Explorations Volume 11, Issue 2. [3] Francesco Bonchi, ―FP-growth Mining of Frequent Itemsets + Constraint-based Mining‖. [4] C K Bhensdadia, Y P Kosta, ―An Efficient Algorithm for Mining Frequent Sequential Patterns and Emerging Patterns with Various Constraints‖, International Journal of Soft Computing and EngineeringVolume-1, Issue-6, January 2012. [5] Ramachandra. V. Pujeri, G.M. Karthik, ―Constraint based frequent pattern mining for generalized query templates from web log‖, International Journal of Engineering, Science and Technology Vol. 2, No. 11, 2010, pp. 17-33 [6] F. Bonchi, F. Giannotti, A. Mazzanti, and D. Pedreschi, ― ExAMiner: Optimized levelwise frequent pattern mining with monotone constraints‖, In Proc. of ICDM, 2003. [7] Jian Pei, Jiawei Han, Behzad Mortazavi-Asl, Jianyong Wang, Helen Pinto, Qiming Chen, Umeshwar Dayal, and Mei-Chun Hsu, ―Mining Sequential Patterns by Pattern- Growth: The PrefixSpan Approach‖, IEEE Transactions on Knowledge and Data Engineering, Vol. 16, No. 10, October 2004. [8] J. Pei and J. Han. ―Can we push more constraints into frequent pattern mining?‖, Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD’00), pages 350–354, N. Y., Aug. 20–23 2000. ACM Press. [9] Francesco Bonchiyz, Fosca Giannottiy, Alessio Mazzanti,z and Dino Pedreschiz ― ExAnte: Anticipated Data Reduction in Constrained Pattern Mining‖. [10] William Cheung , Osmar R. Zaïane, ―Incremental Mining of Frequent Patterns Without Candidate Generation or Support Constraint‖, Proceedings of the Seventh International Database Engineering and Applications Symposium (IDEAS’03) [11] C. Bucila, J. Gehrke, D. Kifer, and W. White. Dualminer, ―A dual-pruning algorithm for itemsets with constraints‖ in Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2002. [12] G. Grahne, L. Lakshmanan, and X. Wang, ―Efficient mining of constrained correlated sets‖, In 16th International Conference on Data Engineering (ICDE’ 00), pages 512–524. IEEE, 2000.
