Abstract

Recently, frequent pattern mining (FPM) has become one of the most popular data mining approaches for various applications such as education, medical, farming, analysis of sale and purchase patterns etc. Apriori algorithm [11] and FP growth algorithm are working efficiently in data mining. These algorithms are typically restricted to a single concept level of hierarchy and uniform support threshold. Sometimes domain database support concept hierarchies that represent the relationships among many different concept levels. In this paper efforts are made to discover items at multiple levels of concept hierarchy. Up till now, a very few concern has been shown to this area. In this study mining multiple levels is explored and extended to mining cross levels in large database on the basis of user specified reduced support threshold constraint.

References

• J. Han, "Mining Multiple-Level Association Rules in Large Databases", IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, Vol. 5, NO. 5, 1999.
• R. Agrawal, T. Imielinsk and A. Swami, "Mining Association Rules Between Sets of Items in Large Databases", Proc. ACM SIGMOD Int'l Conference Management of Data, Washington, D. C. 1993.
• R. Agrawal and J. C. Shafer, "Parrallel Mining of Association Rules: Design, Implementation and Experience", IEEE Transaction Knowledge and Data Eng. , Vol. 8, 1996.
• R. Agrawal and R. Srikant, "Fast Algorithms for Mining Association Rules, "Proc. International Conference Very Large Data Bases, Santiago Chile, 1994.
• R. Agrawal and Srikant, "Mining Sequential Patterns", Proceeding International Conference on Data Engineering, 1995.
• C. K. Leung and D. A. Brajezule, "Efficient Algorithm for the Mining of Constrained Frequent Patterns from Uncertain Data", SIGKDD Explorations, Volume 11, Issue 2, 2009.
• Y. Liu, W. Liao and Alok Choudhary, " A Two Phase Algorithm for fast discovery of High Utility item sets", Springer-Verlag Berlin Heidelberg 2005.
• Y. M. Huang, J. N. Chen and S. C. Cheng, "A method of Cross-Level Frequent Pattern Mining for Web Instructions", Education Technology and Society, 10(3), 2007.
• S. Bhasgi and P. Kulkarni, "Multilevel Association Rule Based Data Mining", International Journal of Advances in Computing and Information Researches, Volume 1, No. 2, 2012.
• M. S. Gouider and Amine Farhat, "Mining Multi Level Frequent Item sets under Constraints", International Journal of Database Theory and Applications, Vol. 3, No 4, 2010.
• R. Agrawal and R. Srikant, "Fast Algorithm for Mining Association Rules", Proc. International Conference. Very Large Data Bases, Santiago, 1994.
• Shaharanee D. M. . Dillon T. S. and Hadzic F. , "Ascertaining Data Mining Rules Using Statistical Approaches", International Symposium on Computing, Communication and Control, Proc. of CSIT, Vol. 1, 2011.
• Shapiro G. P. and Fayyad U. ," An Introduction to SIGKDD and A Reflection on the Term 'Data Mining", SIGKDD Explorations, Vol. 13 Issue 2, 2011.
• Exforsys Inc. , "How data mining is evolving", 2006, http://www. exforsys. com/tutorials/data-mining/how-data-mining-is-evolving. html