A General Framework Based on Composite Granules for Mining Association Rules

At present many algorithms for mining association rules have been proposed, but most of them are only suitable for discovering specific frequent itemsets from characteristic data sets on the appointed environments, namely, these algorithms are not general enough when mining association rules. In this paper, a general framework based on composite granules for mining association rules is proposed, which is a general data mining model without appointed restriction from frequent itemsets, data sets or mining environments and so on. An iterative method is efficiently applied to the general mining framework for discovering frequent itemsets, which adopts repartitioning frequent attributes to iteratively reconstruct the mixed radix information system for reducing a relational database. In order that the framework for discovering frequent itemsets has a generality, in discussing and establishing the general mining framework, this paper introduces a novel conception and data model, namely, a mixed radix information system is applied to describe a relational database, and a composite granules is used to build a specific relationship between an information system and a mixed radix information system, which can hold the same extension and simultaneously exist in two different information systems. The mixed radix information system can help the general framework to reduce information data and improve the performance of the framework for generating frequent itemsets. The composite granules model can create a relationship between an information granule and a digital information granule, and help the framework for computing the support to avoid reading the database repeatedly or using the complex data structure. Finally, a new taxonomy is presented to verify the generality and the high efficiency of the mining framework and all the experiments based on the taxonomy indicate that the general mining framework has the required generality, and the performance of the framework is better than these classical mining frameworks.

[1]  Xiaohua Hu,et al.  Analysis of using granules to find association rules , 2005, 2005 IEEE International Conference on Granular Computing.

[2]  Basilis Boutsinas,et al.  A New Biclustering Algorithm Based on Association Rule Mining , 2013, Int. J. Artif. Intell. Tools.

[3]  Jian Pei,et al.  Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach , 2006, Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06).

[4]  Chong Han,et al.  Mining opened frequent itemsets to generate maximal Boolean association rules , 2009, 2009 IEEE International Conference on Granular Computing.

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

[6]  Li-Min Tsai,et al.  Efficient Mining of Generalized Negative Association Rules , 2010, 2010 IEEE International Conference on Granular Computing.

[7]  Yiyu Yao,et al.  Level-wise Construction of Decision Trees for Classification , 2006, Int. J. Softw. Eng. Knowl. Eng..

[8]  Janusz Zalewski,et al.  Rough sets: Theoretical aspects of reasoning about data , 1996 .

[9]  Yanguang Shen,et al.  Study on the Application of Multi-level Association Rules Based on Granular Computing , 2010, 2010 International Conference on Intelligent Computation Technology and Automation.

[10]  Bo Zhang,et al.  The Quotient Space Theory of Problem Solving , 2003, Fundam. Informaticae.

[11]  Hannu Toivonen,et al.  Sampling Large Databases for Association Rules , 1996, VLDB.

[12]  Nicolas Pasquier,et al.  Discovering Frequent Closed Itemsets for Association Rules , 1999, ICDT.

[13]  Bingru Yang,et al.  Index-Maxminer: a New Maximal Frequent Itemset Mining Algorithm , 2008, Int. J. Artif. Intell. Tools.

[14]  Stéphane Demri,et al.  Logical Analysis of Indiscernibility , 1998 .

[15]  Das Amrita,et al.  Mining Association Rules between Sets of Items in Large Databases , 2013 .

[16]  Zidrina Pabarskaite,et al.  Decision trees for pernicious pages detection , 2003, Int. J. Artif. Intell. Tools.

[17]  Justin Zhijun Zhan.  Granular computing in privacy-preserving data mining , 2008, 2008 IEEE International Conference on Granular Computing.

[18]  Potential Applications of Granular Computing in Knowledge Discovery and Data Mining , 1999 .

[19]  Arno Siebes,et al.  Data Mining: the search for knowledge in databases. , 1994 .

[20]  Shamkant B. Navathe,et al.  An Efficient Algorithm for Mining Association Rules in Large Databases , 1995, VLDB.

[21]  Qing Liu,et al.  Granular computing approach to finding association rules in relational database , 2010, Int. J. Intell. Syst..

[22]  Zhigang Li,et al.  Efficient data mining for maximal frequent subtrees , 2003, Third IEEE International Conference on Data Mining.

[23]  Yuh-Min Chen,et al.  Mining maximal patterns based on improved FP-tree and array technique , 2010 .

[24]  Yiyu Yao,et al.  On modeling data mining with granular computing , 2001, 25th Annual International Computer Software and Applications Conference. COMPSAC 2001.

[25]  J. Yao,et al.  Granular Computing as a Basis for Consistent Classification Problems , 2002 .

[26]  Ramakrishnan Srikant,et al.  Mining Association Rules with Item Constraints , 1997, KDD.

[27]  Tomasz Imielinski,et al.  Database Mining: A Performance Perspective , 1993, IEEE Trans. Knowl. Data Eng..

[28]  M.K. Ghose,et al.  Mining association rules using fast algorithm , 2010, 2010 IEEE 2nd International Advance Computing Conference (IACC).

[29]  Yee Leung,et al.  Granular Computing and Knowledge Reduction in Formal Contexts , 2009, IEEE Transactions on Knowledge and Data Engineering.

[30]  Jian Pei,et al.  CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets , 2000, ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery.

[31]  Andrzej Skowron,et al.  Toward Intelligent Systems: Calculi of Information Granules , 2001, JSAI Workshops.

[32]  Yiyu Yao,et al.  A Partition Model of Granular Computing , 2004, Trans. Rough Sets.

[33]  Z. Pawlak.  Granularity of knowledge, indiscernibility and rough sets , 1998, 1998 IEEE International Conference on Fuzzy Systems Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98CH36228).

[34]  Witold Pedrycz,et al.  Granular computing: an introduction , 2001, Proceedings Joint 9th IFSA World Congress and 20th NAFIPS International Conference (Cat. No. 01TH8569).

[35]  Jian Pei,et al.  Mining frequent patterns without candidate generation , 2000, SIGMOD '00.

[36]  Yunjun Gao,et al.  Mining dynamic association rules with comments , 2010, Knowledge and Information Systems.

[37]  Mohammed J. Zaki,et al.  CHARM: An Efficient Algorithm for Closed Association Rule Mining , 2007 .

[38]  Yiyu Yao,et al.  Granular Computing: basic issues and possible solutions , 2007 .

[39]  Philip S. Yu,et al.  Using a Hash-Based Method with Transaction Trimming for Mining Association Rules , 1997, IEEE Trans. Knowl. Data Eng..