A Granular Computing Approach to Knowledge Discovery in Relational Databases

Abstract The main objective of this paper is to present granular computing algorithms of finding association rules with different levels of granularity from relational databases or information tables. Firstly, based on the partition model of granular computing, a framework for knowledge discovery in relational databases was introduced. Secondly, referring to granular computing, the algorithms for generating frequent k -itemsets were proposed. Finally, the proposed algorithms were illustrated with a real example and tested on two data sets under different supports. Experiment results show that the algorithms are effective and feasible. Moreover, the meanings of mining association rules based on granular computing are clearly understandable.

[1]  Ying Wang,et al.  Granulations Based on Semantics of Rough Logical Formulas and Its Reasoning , 2009, RSFDGrC.

[2]  Unil Yun,et al.  An efficient mining of weighted frequent patterns with length decreasing support constraints , 2008, Knowl. Based Syst..

[3]  Andrzej Skowron,et al.  Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms , 2007 .

[4]  Hung Son Nguyen,et al.  Granular Computing: a Rough Set Approach , 2001, Comput. Intell..

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

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

[7]  Tzung-Pei Hong,et al.  An improved data mining approach using predictive itemsets , 2009, Expert Syst. Appl..

[8]  Chun Zhang,et al.  Storing and querying ordered XML using a relational database system , 2002, SIGMOD '02.

[9]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[10]  Daowu Pei.  Some Models of Granular Computing , 2007 .

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

[12]  Liu Jun.  Survey on Association Rules Mining Technology , 2004 .

[13]  Jiawei Han,et al.  Data Mining: Concepts and Techniques , 2000 .

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

[15]  Keith C. C. Chan,et al.  Mining changes in association rules: a fuzzy approach , 2005, Fuzzy Sets Syst..

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

[17]  E. Louie,et al.  Modeling the real world for data mining: granular computing approach , 2001, Proceedings Joint 9th IFSA World Congress and 20th NAFIPS International Conference (Cat. No. 01TH8569).

[18]  Yiyu Yao,et al.  Granular computing for data mining , 2006, SPIE Defense + Commercial Sensing.

[19]  Chun-Chin Hsu,et al.  An information granulation based data mining approach for classifying imbalanced data , 2008, Inf. Sci..

[20]  Yiyu Yao,et al.  Perspectives of granular computing , 2005, 2005 IEEE International Conference on Granular Computing.

[21]  Bruno Apolloni,et al.  Algorithmic inference: From information granules to subtending functions , 2008 .

[22]  Hui Xiong,et al.  Discovery of maximum length frequent itemsets , 2008, Inf. Sci..

[23]  Yiyu Yao,et al.  The Art of Granular Computing , 2007, RSEISP.

[24]  Witold Pedrycz,et al.  The design of granular classifiers: A study in the synergy of interval calculus and fuzzy sets in pattern recognition , 2008, Pattern Recognit..

[25]  Margaret H. Dunham,et al.  Data Mining: Introductory and Advanced Topics , 2002 .

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

[27]  Yao,et al.  The rise of granular computing , 2008 .

[28]  Lotfi A. Zadeh,et al.  Toward a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic , 1997, Fuzzy Sets Syst..