Abstract

DISCOVERING FREQUENT ITEM SET USING CONFABULATION-INSPIRED ASSOCIATION RULE MINING

Ms. T. Malathi, Dr. T. Senthil Prakash, Mr. K. Arun

Volume: 6 Issue: 1 2016

Abstract:

In recent years, the development of computer technologies, such as data storage and data base management systems, has enabled storage of huge amount of data. Data mining techniques are methods for obtaining useful knowledge from these large databases. One of the main tasks of data mining is association rule mining (ARM), which is used to find interesting rules from large amounts of data. A new confabulation-inspired association rule mining (CARM) algorithm is proposed using an interestingness measure inspired by cogency. Cogency is only computed based on pairwise item conditional probability, so the proposed algorithm mines association rules by only one pass through the file. The proposed algorithm is also more efficient for dealing with infrequent items due to its cogency-inspired approach. The problem of associative classification is used here for evaluating the proposed algorithm. This project evaluates CARM over data sets. Experiments show that the proposed algorithm is consistently faster due to its one time file access and consumes less memory space than the Conditional Frequent Patterns growth algorithm. In addition, statistical analysis reveals the superiority of the approach for classifying minority classes in unbalanced data sets.

Back Download

References

• B. Nath, D. Bhattacharyya, and A. Ghosh, “Discovering association rules from incremental datasets,” IJCSC, vol. 1, no. 2, pp. 433–441, 2010
• Y. Cao, H. He, and H. Man, “SOMKE: Kernel density estimation over data streams by sequences of self-organizing maps,” IEEE Trans. Neural Netw. Learn. Syst., vol. 23, no. 8, pp. 1254–1268, Aug. 2012.
• P. Domingos and G. Hulten, “A general framework for mining massive data stream,” J. Comput. Graphical Statist., vol. 12, no. 4, pp. 945–949, 2003
• C. C. Aggarwal, J. Han, J. Wang, and P. S. Yu, “A framework for on-demand classification of evolving data streams,” IEEE Trans. Knowl. Data Eng., vol. 18, no. 5, pp. 577–589, May 2006
• B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom, “Models and issues in data stream systems,” in Proc. 21st ACM Symp. Principles Database Syst., 2002, pp. 1–16
• B. W. Silverman, Density Estimation for Statistics and Data Analysis. London, U.K.: Chapman & Hall, 1986
• J. DiNardo and J. L. Tobias, “Nonparametric density and regression estimation,” J. Economic Perspectives, vol. 15, no. 4, pp. 11–28, 2001
• Y. Cao, H. He, H. Man, and X. Shen, “Integration of self-organizing map (som) and kernel density estimation (kde) for network intrusion detection,” Proc. SPIE, vol. 7480, pp. 74800N-1–74800N-12, Sep. 2009
• P. N. Nohuddin, F. Coenen, R. Christley, C. Setzkorn, Y. Patel, and S. Williams, “Finding ‘interesting’ trends in social networks using frequent pattern mining and self organizing maps,” Knowl. Based Syst., vol. 29, pp. 104–113, May 2012
• L. Gu, J. Li, H. He, G. Williams, S. Hawkins, and C. Kelman, “Association rule discovery with unbalanced class distributions,” in Proc. 16th Austral. Joint Conf. Artif. Intell.,2003, pp. 221–232
• M. J. Heravi, “A study on interestingness measures for associative classifiers,” M.S. thesis, Dept. Comput. Sci., Alberta Univ., Edmonton, AB, Canada, 2009
• Y. S. Koh and R. Pears, “Rare association rule mining via transaction clustering,” in Proc. 7th Austral. Data Mining Conf., 2008, pp. 87–94
• Azadeh Soltani and M.-R. Akbarzadeh-T., Senior Member, IEEE, 'Confabulation-Inspired Association Rule Mining for Rare and Frequent Itemsets', Ieee Transactions On Neural Networks And Learning Systems, Vol. 25, No. 11, November 2014 2053