Nonredundant Generalized Rules and Their Impact in Classification

Association rules are commonly used in classification based on associations. These rules are made of conjunctions of attributes in the premise and a class attribute in conclusion. In this chapter, we are interested in understanding the impact of generalized association rules in classification processes. For that purpose, we investigate the use of generalized association rules, i.e., rules in which the conclusion is a disjunction of attributes. We propose a method which directly mines nonredundant generalized association rules, possibly with exceptions, by using the recent developments in condensed representations of pattern mining and hypergraph transversals computing. Then we study the impact of using such rules instead of classical ones for classification purposes. To that aim, we view generalized rules as rules with negations in the premise and possibly concluding on a negative class attribute. To study the impact of such rules, we feed the standard CMAR method with these rules and we compare the results with the use of classical ones.

[1]  Xiaohui Yuan,et al.  Mining negative association rules , 2002, Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications.

[2]  Jianyong Wang,et al.  On Mining Instance-Centric Classification Rules , 2006, IEEE Transactions on Knowledge and Data Engineering.

[3]  Frans Coenen,et al.  Hybrid Rule Ordering in Classification Association Rule Mining , 2008, Trans. Mach. Learn. Data Min..

[4]  Bruno Zanuttini,et al.  A unified framework for structure identification , 2002, Inf. Process. Lett..

[5]  Osmar R. Zaïane,et al.  An associative classifier based on positive and negative rules , 2004, DMKD '04.

[6]  Hao Wang,et al.  Mining a Complete Set of Both Positive and Negative Association Rules from Large Databases , 2008, PAKDD.

[7]  Keith C. C. Chan,et al.  An effective algorithm for mining interesting quantitative association rules , 1997, SAC '97.

[8]  Dimitrios Gunopulos,et al.  Data mining, hypergraph transversals, and machine learning (extended abstract) , 1997, PODS '97.

[9]  Gerd Stumme,et al.  Generating a Condensed Representation for Association Rules , 2005, Journal of Intelligent Information Systems.

[10]  Pavel Krömer,et al.  Upgrading Web Search Queries , 2007 .

[11]  Bruno Crémilleux,et al.  A Data Mining Formalization to Improve Hypergraph Minimal Transversal Computation , 2007, Fundam. Informaticae.

[12]  Elena Baralis,et al.  A lazy approach to pruning classification rules , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[13]  Heikki Mannila,et al.  Levelwise Search and Borders of Theories in Knowledge Discovery , 1997, Data Mining and Knowledge Discovery.

[14]  Elena Baralis,et al.  Majority Classification by Means of Association Rules , 2003, PKDD.

[15]  Samir Elloumi,et al.  Integrated Generic Association Rule Based Classifier , 2007 .

[16]  Jean-François Boulicaut,et al.  Towards the Tractable Discovery of Association Rules with Negations , 2000, FQAS.

[17]  Francesco Bonchi,et al.  Knowledge Discovery in Inductive Databases, 4th International Workshop, KDID 2005, Porto, Portugal, October 3, 2005, Revised Selected and Invited Papers , 2006, KDID.

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

[19]  Hendrik Blockeel,et al.  Knowledge Discovery in Databases: PKDD 2003 , 2003, Lecture Notes in Computer Science.

[20]  Geoffrey I. Webb,et al.  Mining Negative Rules Using GRD , 2004, PAKDD.

[21]  Roberto J. Bayardo.  The Hows, Whys, and Whens of Constraints in Itemset and Rule Discovery , 2004, Constraint-Based Mining and Inductive Databases.

[22]  Matthias Hagen,et al.  Algorithmic and Computational Complexity Issues of MONET , 2008 .

[23]  Heikki Mannila,et al.  Fast Discovery of Association Rules , 1996, Advances in Knowledge Discovery and Data Mining.

[24]  Lakhmi C. Jain,et al.  Knowledge-Based Intelligent Information and Engineering Systems , 2004, Lecture Notes in Computer Science.

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

[26]  Bruno Crémilleux,et al.  A Unified View of Objective Interestingness Measures , 2007, MLDM.

[27]  Georg Gottlob,et al.  Identifying the Minimal Transversals of a Hypergraph and Related Problems , 1995, SIAM J. Comput..

[28]  Kimmo Hätönen,et al.  Constraint-Based Mining and Inductive Databases , 2006 .

[29]  Elena Baralis,et al.  Associative text categorization exploiting negated words , 2006, SAC '06.

[30]  Osmar R. Zaïane,et al.  On Pruning and Tuning Rules for Associative Classifiers , 2005, KES.

[31]  Guoqing Chen,et al.  Mining Positive and Negative Association Rules from Large Databases , 2006, 2006 IEEE Conference on Cybernetics and Intelligent Systems.

[32]  Xiangjun Dong,et al.  Mining Both Positive and Negative Association Rules from Frequent and Infrequent Itemsets , 2007, ADMA.

[33]  Leonid Khachiyan,et al.  On the Complexity of Dualization of Monotone Disjunctive Normal Forms , 1996, J. Algorithms.

[34]  Jaideep Srivastava,et al.  Selecting the right interestingness measure for association patterns , 2002, KDD.

[35]  Bruno Crémilleux,et al.  Mining Correct Properties in Incomplete Databases , 2006, KDID.

[36]  Jiawei Han,et al.  CPAR: Classification based on Predictive Association Rules , 2003, SDM.

[37]  Toon Calders,et al.  Minimal k-Free Representations of Frequent Sets , 2003, PKDD.

[38]  Hongxing He,et al.  Association Rule Discovery with Unbalanced Class Distributions , 2003, Australian Conference on Artificial Intelligence.

[39]  Naren Ramakrishnan,et al.  BLOSOM: a framework for mining arbitrary boolean expressions , 2006, KDD '06.

[40]  Raghu Ramakrishnan,et al.  Proceedings : KDD 2000 : the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, August 20-23, 2000, Boston, MA, USA , 2000 .

[41]  Daniel A. Keim,et al.  Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining , 2002, KDD.

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

[43]  Dimitrios Gunopulos,et al.  Data mining, hypergraph transversals, and machine learning (extended abstract) , 1997, PODS.

[44]  Xindong Wu,et al.  Efficient mining of both positive and negative association rules , 2004, TOIS.

[45]  Jian Pei,et al.  CMAR: accurate and efficient classification based on multiple class-association rules , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

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