Reduction of Association Rules for Big Data Sets in Socially-Aware Computing

Reduction of the number of association rules in data mining is a very important issue in the field of socially-aware computing in which big data need to be manipulated. The existing schemes based on the frequency of occurrences are not effective for relatively large size dataset. In this paper we propose the tabular-algorithm that assigns a weight to each rule for the removal of unimportant rules and employs the Quine-Mccluskey method for rule reduction. Computer simulation reveals that the proposed scheme significantly improves support, credibility, rule reduction rate, and processing time compared to the representative existing schemes such as Apriori and FP-growth algorithm.

[1]  Jiawei Han,et al.  Maintenance of discovered association rules in large databases: an incremental updating technique , 1996, Proceedings of the Twelfth International Conference on Data Engineering.

[2]  Ming-Syan Chen,et al.  Incremental Mining on Association Rules , 2005 .

[3]  Ramakrishnan Srikant,et al.  Fast algorithms for mining association rules , 1998, VLDB 1998.

[4]  Reda Alhajj,et al.  Constructing Complete FP-Tree for Incremental Mining of Frequent Patterns in Dynamic Databases , 2006, IEA/AIE.

[5]  J. David Irwin,et al.  Digital Logic Circuit Analysis and Design , 1995 .

[6]  Zhan Li,et al.  Knowledge and Information Systems , 2007 .

[7]  Daniel T. Larose,et al.  Discovering Knowledge in Data: An Introduction to Data Mining , 2005 .

[8]  Siu-Ming Yiu,et al.  An efficient algorithm for finding dense regions for mining quantitative association rules , 2005 .

[9]  Haibin Zhu,et al.  An Algorithm to Improve the Effectiveness of Apriori , 2007, 6th IEEE International Conference on Cognitive Informatics.

[10]  Antti Oulasvirta,et al.  Towards socially aware pervasive computing: a turntaking approach , 2004, Second IEEE Annual Conference on Pervasive Computing and Communications, 2004. Proceedings of the.

[11]  Paul Lukowicz,et al.  From Context Awareness to Socially Aware Computing , 2012, IEEE Pervasive Computing.

[12]  Soon Myoung Chung,et al.  Mining association rules in text databases using multipass with inverted hashing and pruning , 2002, 14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings..

[13]  Yongji Wang,et al.  Mining Quantitative Associations in Large Database , 2005, APWeb.

[14]  Kun-Lin Hsieh,et al.  Applying cluster-based fuzzy association rules mining framework into EC environment , 2012, Appl. Soft Comput..

[15]  Chen Hong-ye,et al.  Incremental FP_Growth Mining Algorithm Based on Web Information Extraction , 2009, 2009 Second International Conference on Information and Computing Science.

[16]  Lin Yang,et al.  Combination of Partition Table and Grid Index in Large-Scale Spatial Database Query , 2009, 2009 First International Conference on Information Science and Engineering.

[17]  R. Suganya,et al.  Data Mining Concepts and Techniques , 2010 .

[18]  Wei Zhang,et al.  Research on the FP Growth Algorithm about Association Rule Mining , 2008, 2008 International Seminar on Business and Information Management.

[19]  Nan Jiang,et al.  Research issues in data stream association rule mining , 2006, SGMD.

[20]  Umesh Deshpande,et al.  An Optimistic Messaging Distributed Algorithm for Association Rule Mining , 2009, 2009 Annual IEEE India Conference.