AN IMPROVED ANT COLONY ALGORITHM FOR EFFECTIVE MINING OF FREQUENT ITEMS
Data Mining involves discovery of required potentially qualified content from a heavy collection of heterogeneous data sources. Two decades passed, still it remains the interested area for researchers. It has become a flexible platform for mining engineers to analyse and visualize the hidden relationships among the data sources. Association rules have a strong place in representing those relationships by framing suitable rules. It has two powerful parameters namely support and confidence which helps to carry out framing of such rules. Frequent itemset mining is also termed to be frequent pattern mining. When the combination of items increases rapidly, we term it to be a pattern. The ultimate goal is to design rules over such frequent patterns in an effective manner i.e in terms of time complexity and space complexity. The count of evolutionary algorithms to achieve this goal is increasing day by day. Bio Inspired algorithms holds a strong place in machine learning, mining, evolutionary computing and so on. Ant Colony Algorithm is one such algorithm which is designed based on behaviour of biological inspired ants. This algorithm is adopted for its characteristic of parallel search and dynamic memory allocation. It works comparatively faster than basic Apriori algorithm, AIS, FP Growth algorithm. The two major parameters of this algorithm are pheromone updating rule and transition probability. The basic ant colony algorithm is improved by modifying the pheromone updating rule in such way to reduce multiple scan over data storage and reduced count of candidate sets. The proposed approach was tested using MATLAB along with WEKA toolkit. The experimental results prove that the stigmeric communication of improved ant colony algorithm helps in mining the frequent items faster and effectively than the above stated existing algorithms.
Jiawei Han, Micheline Kamber, “Data Mining: Concepts and Techniques”, Second Edition, Morgan Kaufmann publishers, 2006.
Qiang Yang, Xindong Wu, “10 Challenging Problems In Data Mining Research”, International Journal of Information Technology & Decision Making ,Vol. 5, No. 4, page no: 597–604, 2006.
Heikki Mannila, Hannu Toivonen, “Levelwise Search and Borders of Theories in knowledge Discovery”, International Journal of Data Mining and Knowledge Discovery (Springer), Volume 1, Issue 1, pg: 241 – 258, 1997.
Sarvestani.A.S., Safavi.A.A, Parandeh, N.M, Salehi.M, “Predicting breast cancer survivability using data mining techniques”, IEEE Second International conference on Software Technology and Engineering, volume 2, Page no:227 -231,3-5 October 2010.
Al-Noukari.M, Al-Hussan.W, “Using Data Mining Techniques for Predicting Future Car market Demand; DCX Case Study”, IEEE Third International conference on Information and Communication Technologies: From Theory to Applications, page1-5, 7-11 April, 2008.
Ahonen. H, Heinonen.O ,Klemettinen.M, Verkamo, A.Inkeri, “Applying data mining techniques for descriptive phrase extraction in digital document collections”, IEEE International Forum on Research and Technology Advances in Digital Libraries, page no:2-11, 22-24 April 1998.
Ning Zhong, Yuefeng Li, Sheng-Tang Wu, "Effective Pattern Discovery for Text Mining," IEEE Transactions on Knowledge and Data Engineering, vol. 24, no. 1, pp. 30-44, January, 2012.
Gkoulalas-Divanis, “A Hybrid Approach to Frequent Itemset Hiding”, 19th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2007, 29-31 Oct. 2007, Volume 1, Page(s): 297 – 304, 2007.
Rakesh Agrawal, Tomasz Imielinski, Arum Swami, “Mining Association Rules between sets of items in large databases”, Proceedings of the ACM SIGMOD international conference on Management of data, Volume 22 Issue 2, Pages 207-216, 1993.
Feng Yucai, “Association Rules Incremental Updating Algorithm”, Journal of Software, Sept., 1998.
Qiankun Zhao and Sourav S. Bhowmick, “Association Rule Mining: A Survey”, Technical Report, CAIS, Nanyang Technological University, Singapore, No. 2003116, 2003.
“Privacy-Preserving Data Mining: Why, How, and When”, IEEE Security & Privacy, published by the IEEE Computer Society, 2004.
Crina Grosan, Ajith Abraham, Monica Chis, “Swarm Intelligence in Data Mining”, Studies in Computational Intelligence Volume 34, page no 1-20,2006.
Andrew Secker, Alex A. Freitas, Jon Timmis, “A Danger Theory Inspired Approach to Web Mining”, Artificial Immune Systems, Lecture Notes in Computer Science Volume 2787, page no 156-167, 2003.
Marco Dorigo, Mauro Birattari, and Thomas Stutzle, “Ant Colony Optimization - Artificial Ants as a Computational Intelligence Technique”, IRIDIA – Technical Report Series, Technical Report No. TR/IRIDIA/2006-023, September 2006.
Handl J, Knowles J, Dorigo M. , “Ant-based clustering and topographic mapping”, Artificial Life, MIT Press Journals, volume 12 , Issue 1 – winter, page no35-62, 2006.
Marco Dorigo, Gianni Di Caro and Luca M. Gambardella, “Ant Algorithms for Discrete Optimization”, Artificial Life, MIT Press Journals, Spring 1999, Vol. 5, No. 2, Pages 137-172, Posted Online March 11, 2006.
P. Mathiyalagan, S. Suriya and S.N. Sivanandam, “Hybrid enhanced ant colony algorithm and enhanced bee colony algorithm for grid scheduling”, International Journal of grid and Utility Computing, volume 2, Issue 1, page no: 45-58, 2011.
S.Suriya, Dr.S.P.Shantharajah, “Selective Marketing for Retailers to promote stock using improved Ant Colony algorithm", International Journal of Engineering and Technology (IJET), Volume 5 Issue 5, Page No: 3715-3725, October- November 2013.
Chengqi Zhang, Shichao Zhang, “Association rule mining: models and algorithms”, Book from ACM DL, Springer-Verlag Berlin, Heidelberg 2002, ISBN:3-540-43533-6.
Sotiris Kotsiantis, Dimitris Kanellopoulos, “Association Rules Mining: A Recent Overview”, GESTS International Transactions on Computer Science and Engineering, Vol.32 (1), pp. 71-82, 2006.
Weiyang Lin, Sergio A. Alvarez, Carolina Ruiz, “Efficient Adaptive-Support Association Rule Mining for Recommender Systems”, Data Mining and Knowledge Discovery, Volume 6, Issue 1, page no 83-105,January 2002.
Lei Ji, Baowen Zhang, Jianhua Li, “A New Improvement on Apriori Algorithm”, International Conference on Computational Intelligence and Security, Page No:840 – 844, Volume 1, November 2006.
Sheng Chai, Jia Yang ; Yang Cheng, “The Research of Improved Apriori Algorithm for Mining Association Rules”, International Conference on Sevice Systems and Service Management, Page 1-4, June 9 -11,2007.
Grahne G, Zhu, “Fast algorithms for frequent itemset mining using FP-trees”, IEEE Transactions on Knowledge and Data Engineering , Volume 17, Issue 10, page No:1347 – 1362, October 2005.
Shengwei Li, Lingsheng Li, Chong Han, “Mining closed frequent itemset based on FP-Tree”, IEEE International Conference on Granular Computing, Page No: 354 – 357, August 17-19, 2009.
M. Dorigo. Optimization, Learning and Natural Algorithms (in Italian). PhD thesis, Dipartimento di Elettronica e Informazione, Politecnico di Milano, IT, 1992.
Binitha S, S Siva Sathya, “A Survey of Bio inspired Optimization Algorithms”, International Journal of Soft Computing and Engineering (IJSCE), ISSN: 2231-2307, Volume-2, Issue-2, May 2012.
Yi Zhang, Dingding Wang, Tao Li, “LIBGS: A MATLAB software package for gene selection”, International Journal of Data Mining and Bioinformatics, Inderscience Publishers, Volume 4, Number 3, Pages 348-355, 2010.
Remco R. Bouckaert , Eibe Frank, Mark A. Hall, Geoffrey Holmes, Bernhard Pfahringer, Peter Reutemann, Ian H. Witten, “WEKA---Experiences with a Java Open-Source Project”, The Journal of Machine Learning Research, Volume 11, Pages 2533-2541, 2010.
Baharak Goli and Geetha Govindan, “WEKA – A powerful free software for implementing Bio-inspired Algorithm”, Technical Trends, CSI Communications, Page No:9-12, December 2012.