COMPARISON OF HYBRID APPROACHES WITH TRADITIONAL ALGORITHMS FOR IMPROVING SCALABILITY OF FREQUENT PATTERN MINING
Keywords:
Ant Colony algorithm, Frequent Pattern Mining, k-Direct Count and Intersect algorithm, Selective Item Replication algorithm, Transaction Mapping algorithmAbstract
Frequent pattern mining always occupies its space in research activities in spite of various emerging research ideas. This paper focuses on performance of four competitive algorithms namely hybrid k-Direct Count and Intersect algorithm with apriori algorithm, hybrid k-Direct Count and Intersect algorithm with transaction mapping algorithm, Modified Ant Colony algorithm and improved Ant Colony algorithm over frequent pattern mining against traditional algorithms. We focus on a set of well defined parameters such as database layout, scanning of input databases, memory requirement, input / output cost, input / output overhead, computational cost, execution speed, scalability, support for parallelization, complexity of the algorithm to do this comparison. Experimental results support for this effective comparison with help of visualization through graphs. We used ASP.net as front end tool and SQL server 2005 as back end tool for implementing our proposed approaches. As a result of this study, there is good improvement in effectiveness of pattern mining in all aspects while using the improved Ant Colony algorithm against other hybrid approaches and traditional algorithms.
Downloads
References
Abdullah, Z, Herawan, T, & Deris, MM 2010,‘Scalable model for mining critical least
association rules’, Lecture Notes in Computer Science, Information Computing and Applications,
Springer, vol. 6377, pp. 509-516.
Bernecker, T, Kriegel, H P, Renz, M, Verhein, F, & Züfle, A 2012, ‘Probabilistic frequent
pattern growth for itemset mining in uncertain databases’, Scientific and Statistical Database
Management, Springer Berlin Heidelberg , vol. 7338, pp. 38-55.
Borgelt, C 2012, ‘Frequent item set mining’, Wiley Interdisciplinary Reviews: Data Mining
and Knowledge Discovery, vol. 2, no. 6, pp. 437-456.
Lin, K C, Liao, I E, & Chen, Z S 2011, ‘An improved frequent pattern growth method for
mining association rules’, Expert Systems with Applications, vol.38, no. 5, pp. 5154-5161.
Liu, Z, & Chang, R 2011, ‘Study on efficient algorithm of frequent item-set mining’, IEEE
International Conference on Electronics and Optoelectronics, vol. 1, pp. 222 – 225.
Mohanty, A K, Senapati, M R, & Lenka, S K 2013, ‘An improved data mining technique for
classification and detection of breast cancer from mammograms’, Neural Computing and Applications,
Springer, vol. 22, no. 1, pp. 303-310.
Pei, J, Han, J, Mortazavi-Asl, B, Pinto, H, Chen, Q, Dayal, U, & Hsu, M C 2013, ‘Prefixspan:
Mining sequential patterns efficiently by prefix-projected pattern growth’, 29th IEEE International
Conference on Data Engineering (ICDE).
Rajendran, P, & Madheswaran, M 2010, ‘Hybrid medical image classification using
association rule mining with decision tree algorithm’, Journal of Computing, vol. 2, no.1, pp.127-136.
Rao, S, & Gupta, P 2012, ‘Implementing Improved Algorithm Over APRIORI Data Mining
Association Rule Algorithm’, International Journal of computer Science and Technology, vol. 3, no. 1,
pp. 489-493.
Suriya, S & Shantharajah, S P 2013, ‘A Hybrid k-DCI Algorithm and Apriori Algorithm for
Mining Frequent Itemsets’, IEEE International Conference on Circuit, Power and Computing
Technologies (ICCPCT’13), ISBN 978-1-4673-4921-5, pp. 1059-1064.
Suriya, S & Shantharajah, S P 2013, ‘Selective Marketing for Retailers to promote Stock
using improved Ant Colony Algorithm’, International Journal of Engineering and Technology, vol.5,
no.5, pp. 45-58
Suriya, S & Shantharajah, S P 2014, ‘An Improved Ant colony Algorithm for Effective
Mining of Frequent items’, Journal of Web Engineering, vol.13, no.3&4, pp. 263-276
Wang, L, Cheung, DL, Cheng, R, Lee, SD, & Yang, XS 2012, ‘Efficient mining of frequent
item sets on large uncertain databases’, IEEE Transactions on Knowledge and Data Engineering, vol.
, no.12, pp. 2170-2183.
