The week's pick
Reseach Article
Ontological Frequent Patterns Mining by potential use of Neural Network
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 36 - Number 10 |
| Year of Publication: 2011 |
| Authors: Amit Bhagat, Sanjay Sharma, K. R. Pardasani |
10.5120/4529-6465
|
Amit Bhagat, Sanjay Sharma, K. R. Pardasani . Ontological Frequent Patterns Mining by potential use of Neural Network. International Journal of Computer Applications. 36, 10 ( December 2011), 44-53. DOI=10.5120/4529-6465
Abstract
Association rule mining has attracted wide attention in both research and application areas recently. The mining of multilevel association rules is one of the important branches of it. Mining association rules at multiple levels helps in finding more specific and relevant knowledge. In most of the studies, multilevel rules will be mined through repeated mining from databases or mining the rules at each individually levels, it affects the efficiency, integrality and accuracy. In this paper, an efficient algorithm named Multi Level Feed Forward Mining (MLFM) is proposed for efficient mining of multiple-level association rules from large transaction databases. This algorithm uses Feed Forward Neural Networks as Neural networks have been successfully applied in a wide range of supervised and unsupervised learning applications. Neural networks have high acceptance ability for noisy data and high accuracy and are preferable in data mining. So we have used supervised neural network in parallel for finding frequent item sets at each concept levels in only single scan of database.
References
- Jiawei Han, Micheline Kamber 2001. “Data Mining Concepts andTechniques” Harcourt India Private Limited ISBN:81-7867-023-2.
- R. Agrawal, T. Imielinski, and A. Swami, “Mining association rules between sets of items in large databases”. 1993, ACM SIGMOD International Conference on Management of Data, pages 207-216, Washington, DC, May26-28.
- Jiawei Han and Yongjian Fu., “Discovery of Multiple-Level Association Rules from Large Databases”. 1999, Proceeding in IEEE Trans. on Knowledge and Data Eng. Vol. 11 No. 5, pp 798-804,.
- R. Agrawal and R, Shrikanth, 1994 “Fast Algorithm for Mining Association Rules”. Proceedings Of VLDB conference, pp 487– 449, Santigo, Chile,.
- M.H.Margahny and A.A.Mitwaly, December 2005 “Fast Algorithm for Mining Association Rules”. Proceedings of AIML 05 Conference, CICC, Cairo, Egypt, 19-21
- T. P. Hong, Y. C. Lee, T. C Wang, 2008 “Multi-level fuzzy mining with multiple minimum supports”, international journal of Expert Systems with Applications, Vol. 34, , pp. 459–468.
- J. Han, & Y. Fu, 1995 “Discovery of multiple-level association rules from large databases”, the international conference on very large databases, , pp. 420–431
- T. P. Hong, K. Y. Lin, S. L. Wang, 2003 “Fuzzy data mining for interesting generalized association rules”, international journal of Fuzzy Sets and Systems, Vol. 138, No 2, , pp.255-269.
- Amit Bhagat,Sanjay Sharma and K.R.Pardasani, November 2010 “Feed Forward Neural Network algorithm for Frequent patterns mining ”, International Journal of Computer Science and Information Security Vol 8,No.8, pp. 201-205
- Jiwai Han, Yongjian Fu, 1999, IEEE Transactions on Knowledge and Data Engineering Vol 11 No 5.
- Xia Shi Xiong, Li Fan, Zhang Lei, 2010 Ontology-based Association Rule Quality Evaluation Using Information Theory” IEEEInternational Conference on Computational and Information Sciences,
- Yun Li, Lianglei Sun, Jiang Yin, Wenyan Bao, Mengyuan Gu, December 2010 “Multi-Level Weighted Sequential Pattern Mining Based on Prime Encoding” International Journal of Digital Content Technology and its Applications Volume 4, Number 9,
- Ehsan Vejdani Mahmoudi, Elahe Sabetnia et.al, 2011 “Multi-level Fuzzy Association Rules Mining via Determining Minimum Supports and Membership Functions” IEEE Second International Conference on Intelligent Systems, Modelling and Simulation.
Index Terms
Keywords