Nonredundant Generalized Rules and Their Impact in Classification

作者: François Rioult , Bruno Zanuttini , Bruno Crémilleux

DOI: 10.1007/978-3-642-05183-8_1

关键词:

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

参考文章(46)
Raymond Ng, Randy Goebel, Daniel Keim, D. J. Hand, Osmar R. Zaïane, KDD-2002 : proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, July 23-26, 2002, Edmonton, Alberta, Canada Association for Computing Machinery. ,(2002)
Ramakrishnan Srikant, Rakesh Agrawal, Fast algorithms for mining association rules very large data bases. pp. 580- 592 ,(1998)
Hao Wang, Xing Zhang, Guoqing Chen, Mining a complete set of both positive and negative association rules from large databases knowledge discovery and data mining. pp. 777- 784 ,(2008) , 10.1007/978-3-540-68125-0_75
Osmar R. Zaïane, Maria-Luiza Antonie, On pruning and tuning rules for associative classifiers international conference on knowledge based and intelligent information and engineering systems. pp. 966- 973 ,(2005) , 10.1007/11553939_136
Heikki Mannila, A. Inkeri Verkamo, Ramakrishnan Srikant, Hannu Toivonen, Rakesh Agrawal, Fast discovery of association rules knowledge discovery and data mining. pp. 307- 328 ,(1996)
Xiangjun Dong, Zhendong Niu, Xuelin Shi, Xiaodan Zhang, Donghua Zhu, Mining Both Positive and Negative Association Rules from Frequent and Infrequent Itemsets advanced data mining and applications. pp. 122- 133 ,(2007) , 10.1007/978-3-540-73871-8_13
Dhananjay R. Thiruvady, Geoff I. Webb, Mining Negative Rules Using GRD Advances in Knowledge Discovery and Data Mining. pp. 161- 165 ,(2004) , 10.1007/978-3-540-24775-3_20
Elena Baralis, Paolo Garza, Majority Classification by Means of Association Rules european conference on principles of data mining and knowledge discovery. ,vol. 2838, pp. 35- 46 ,(2003) , 10.1007/978-3-540-39804-2_6
Roberto J. Bayardo, The hows, whys, and whens of constraints in itemset and rule discovery Lecture Notes in Computer Science. pp. 1- 13 ,(2004) , 10.1007/11615576_1