Incremental Classification Rules Based on Association Rules Using Formal Concept Analysis

Concept lattice, core structure in Formal Concept Analysis has been used in various fields like software engineering and knowledge discovery.In this paper, we present the integration of Association rules and Classification rules using Concept Lattice. This gives more accurate classifiers for Classification. The algorithm used is incremental in nature. Any increase in the number of classes, attributes or transactions does not require the access to the previous database. The incremental behavior is very useful in finding classification rules for real time data such as image processing. The algorithm requires just one database pass through the entire database. Individual classes can have different support threshold and pruning conditions such as criteria for noise and number of conditions in the classifier.

[1]  Lizhu Zhou,et al.  Integrating Classification and Association Rule Mining: A Concept Lattice Framework , 1999, RSFDGrC.

[2]  Ramakrishnan Srikant,et al.  Mining quantitative association rules in large relational tables , 1996, SIGMOD '96.

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

[4]  J. Ross Quinlan,et al.  Induction of Decision Trees , 1986, Machine Learning.

[5]  Mehran Sahami.  Learning Classification Rules Using Lattices (Extended Abstract) , 1995, ECML.

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

[7]  Engelbert Mephu Nguifo,et al.  A Comparative Study of FCA-Based Supervised Classification Algorithms , 2004, ICFCA.

[8]  L. Beran,et al.  [Formal concept analysis]. , 1996, Casopis lekaru ceskych.

[9]  Jorma Rissanen,et al.  SLIQ: A Fast Scalable Classifier for Data Mining , 1996, EDBT.

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

[11]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[12]  Mohammed J. Zaki.  Generating non-redundant association rules , 2000, KDD '00.

[13]  Claudio Carpineto,et al.  GALOIS: An Order-Theoretic Approach to Conceptual Clustering , 1993, ICML.

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

[15]  AgrawalRakesh,et al.  Mining quantitative association rules in large relational tables , 1996 .

[16]  Wynne Hsu,et al.  Integrating Classification and Association Rule Mining , 1998, KDD.

[17]  Christopher J. Merz,et al.  UCI Repository of Machine Learning Databases , 1996 .

[18]  Mehran Sahami,et al.  Learning Classification Rules Using Lattices , 1995 .

[19]  Rokia Missaoui,et al.  INCREMENTAL CONCEPT FORMATION ALGORITHMS BASED ON GALOIS (CONCEPT) LATTICES , 1995, Comput. Intell..

[20]  Mong-Li Lee,et al.  Concept lattice based composite classifiers for high predictability , 2002, J. Exp. Theor. Artif. Intell..

[21]  Catherine Blake,et al.  UCI Repository of machine learning databases , 1998 .