Determination of interesting rules in FCA using information gain

The difficult job in association rules is to identify the frequent item sets immersed into the huge collection of data. The association rules can be discovered using Formal Concept Analysis (FCA). Several contexts often contain large number of rules and hence interesting rules are required to be determined. With this objective, this paper proposes a method for determining interesting rules in FCA involving many-valued contexts based on Shannon's information entropy (IE) theory. For this purpose we define a gain_lift measure on association rules. The proposed method is illustrated by means of an example available from the field of medical diagnosis.

[1]  Cherukuri Aswani Kumar,et al.  Critical Analysis on Open Source LMSs using FCA , 2013, Int. J. Distance Educ. Technol..

[2]  Huan Liu,et al.  Feature Selection for High-Dimensional Data: A Fast Correlation-Based Filter Solution , 2003, ICML.

[3]  Cherukuri Aswani Kumar,et al.  FUZZY CLUSTERING-BASED FORMAL CONCEPT ANALYSIS FOR ASSOCIATION RULES MINING , 2012, Appl. Artif. Intell..

[4]  Claudio Carpineto,et al.  Concept data analysis - theory and applications , 2004 .

[5]  K. Sumangali,et al.  Performance evaluation of employees of an organization using formal concept analysis , 2012, International Conference on Pattern Recognition, Informatics and Medical Engineering (PRIME-2012).

[6]  B. K. Tripathy,et al.  A Framework for Intelligent Medical Diagnosis using Rough Set with Formal Concept Analysis , 2011, ArXiv.

[7]  Zainab Assaghir,et al.  On the mining of numerical data with Formal Concept Analysis and similarity , 2009 .

[8]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[9]  Ch. Aswani Kumar,et al.  MINING ASSOCIATIONS IN HEALTH CARE DATA USING FORMAL CONCEPT ANALYSIS AND SINGULAR VALUE DECOMPOSITION , 2010 .

[11]  Xindong Wu,et al.  Fundamentals of association rules in data mining and knowledge discovery , 2011, Wiley Interdiscip. Rev. Data Min. Knowl. Discov..

[12]  Roberto J. Bayardo,et al.  Mining the most interesting rules , 1999, KDD '99.

[13]  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..

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

[15]  Radim Belohlávek,et al.  Selecting Important Concepts Using Weights , 2011, ICFCA.

[16]  Bao-Cheng Su,et al.  Data Reduction Through Combining Lattice with Rough Sets , 2006, 2006 International Conference on Machine Learning and Cybernetics.

[17]  Mohammed J. Zaki.  Mining Non-Redundant Association Rules , 2004, Data Min. Knowl. Discov..

[18]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[19]  Bernhard Ganter,et al.  Formal Concept Analysis: Mathematical Foundations , 1998 .

[20]  Ch. Aswanikumar,et al.  Concept lattice reduction using fuzzy K-Means clustering , 2010, Expert Syst. Appl..

[21]  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.

[22]  Amedeo Napoli,et al.  Many-Valued Concept Lattices for Conceptual Clustering and Information Retrieval , 2008, ECAI.

[23]  Junli Li,et al.  An Entropy-Based Weighted Concept Lattice for Merging Multi-Source Geo-Ontologies , 2013, Entropy.

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

[25]  Geoff Holmes,et al.  Benchmarking Attribute Selection Techniques for Discrete Class Data Mining , 2003, IEEE Trans. Knowl. Data Eng..

[26]  Aswani Kumar Ch.  Mining Association Rules Using Non-Negative Matrix Factorization and Formal Concept Analysis , 2011 .

[27]  Uta Priss,et al.  Formal concept analysis in information science , 2006, Annu. Rev. Inf. Sci. Technol..