Abstract
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.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.: Fast discovery of association rules. In: Advances in Knowledge Discovery and Data Mining pp. 307–328 (1996)
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Intl. Conference on Very Large Data Bases (VLDB 1994), Santiago de Chile, Chile, pp. 487–499 (1994)
Antonie, M.L., Zaïane, O.: An associative classifier based on positive and negative rules. In: ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery (DMKD 2004), Paris, France (2004)
Baralis, E., Garza, P.: A lazy approach to pruning classification rules. In: IEEE International Conference on Data Mining, ICDM 02 Maebashi City, Japan (2002)
Baralis, E., Garza, P.: Majority classification by means of association rules. In: Lavrač, N., Gamberger, D., Todorovski, L., Blockeel, H. (eds.) PKDD 2003. LNCS (LNAI), vol. 2838, pp. 35–46. Springer, Heidelberg (2003)
Baralis, E., Garza, P.: Associative text categorization exploiting negated words. In: SAC 2006: Proceedings of the 2006 ACM symposium on Applied computing, pp. 530–535. ACM, New York (2006), http://doi.acm.org/10.1145/1141277.1141402
Bayardo, R.J.: The hows, whys, and whens of constraints in itemset and rule discovery. In: Boulicaut, J.-F., De Raedt, L., Mannila, H. (eds.) Constraint-Based Mining and Inductive Databases. LNCS (LNAI), vol. 3848, pp. 1–13. Springer, Heidelberg (2006)
Blake, C., Merz, C.: UCI repository of machine learning databases (1998), http://www.ics.uci.edu/~mlearn/MLRepository.html
Boulicaut, J.F., Bykowski, A., Jeudy, B.: Towards the tractable discovery of association rules with negations. In: Fourth Int. Conference on Flexible Query Answering Systems FQAS 2000, pp. 425–434 (2000)
Bouzouita, I., Elloumi, S.: Integrated generic association rule based classifier. In: DEXA 2007: Proceedings of the 18th International Conference on Database and Expert Systems Applications (DEXA 2007), pp. 514–518. IEEE Computer Society, Washington (2007), http://dx.doi.org/10.1109/DEXA.2007.90
Calders, T., Goethals, B.: Minimal k-free representations of frequent sets. In: Lavrač, N., Gamberger, D., Todorovski, L., Blockeel, H. (eds.) PKDD 2003. LNCS (LNAI), vol. 2838, pp. 71–82. Springer, Heidelberg (2003)
Chan, K.C.C., ho Au, W.: An effective algorithm for mining interesting quantitative association rules. In: Proc. of the 12th ACM Symp. on Applied Computing (SAC 1997), pp. 88–90. ACM Press, New York (1997)
Cornells, C., Yan, P., Zhang, X., Chen, G.: Mining positive and negative association rules from large databases. In: IEEE Conference on Cybernetics and Intelligent Systems, pp. 1–6 (2006)
Dong, X., Niu, Z., Shi, X., Zhang, X., Zhu, D.: Mining both positive and negative association rules from frequent and infrequent itemsets. In: Alhajj, R., Gao, H., Li, X., Li, J., Zaïane, O.R. (eds.) ADMA 2007. LNCS (LNAI), vol. 4632, pp. 122–133. Springer, Heidelberg (2007), http://dx.doi.org/10.1007/978-3-540-73871-8_13
Eiter, T., Gottlob, G.: Identifying the minimal transversals of a hypergraph and related problems. SIAM Journal on Computing 24(6), 1278–1304 (1995)
Fredman, M., Kachiyan, L.: On the complexity of dualization of monotone disjunctive normal forms. Journal of Algorithms 21(2), 618–628 (1996)
Gu, L., Li, J., He, H., Williams, G.J., Hawkins, S., Kelman, C.: Association rule discovery with unbalanced class distributions. In: Australian Conference on Artificial Intelligence, pp. 221–232 (2003)
Gunopulos, D., Mannila, H., Khardon, R., Toivonen, H.: Data mining, hypergraph transversals, and machine learning. In: ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS 1997), Tucson, USA (1997)
Hagen, M.: Algorithmic and computational complexity issues of monet. Ph.D. thesis, Firedrich-Schiller-University Jena, Germany (2008)
Hébert, C., Bretto, A., Crémilleux, B.: A data mining formalization to improve hypergraph transversal computation. Fundamenta Informaticae 80(4), 415–433 (2007)
Hébert, C., Crémilleux, B.: A unified view of objective interestingness measures. In: Perner, P. (ed.) MLDM 2007. LNCS (LNAI), vol. 4571, pp. 533–547. Springer, Heidelberg (2007)
Li, W., Han, J., Pei, J.: Cmar: Accurate and efficient classification based on multiple class-association rules. In: IEEE International Conference on Data Mining (ICDM 2001), San Jose, USA (2001)
Liu, B., Hsu, W., Ma, Y.: Integrating classification and association rules mining. In: International Conference on Knowledge Discovery and Data Mining (KDD 1998), New York, USA, pp. 80–86 (1998)
Mannila, H., Toivonen, H.: Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery 1(3), 241–258 (1997), citeseer.nj.nec.com/mannila97levelwise.html
Pasquier, N., Taouil, R., Bastide, Y., Stumme, G., Lakhal, L.: Generating a condensed representation for association rules. Journal Intelligent Information Systems (JIIS) 24(1), 29–60 (2005), http://www.kde.cs.uni-kassel.de/stumme/papers/2005/pasquier2005generating.pdf
Rioult, F., Crémilleux, B.: Mining correct properties in incomplete databases. In: Džeroski, S., Struyf, J. (eds.) KDID 2006. LNCS, vol. 4747, Springer, Heidelberg (2007)
Tan, P.N., Kumar, V., Srivastava, J.: Selecting the right interestingness measure for association patterns. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Edmonton, Alberta, Canada, July 23-26, 2002, pp. 32–41 (2002)
Thiruvady, D.R., Webb, G.: Mining negative rules using GRD. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol. 3056, pp. 161–165. Springer, Heidelberg (2004)
Wang, H., Zhang, X., Chen, G.: Mining a complete set of both positive and negative association rules from large databases. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol. 5012, pp. 777–784. Springer, Heidelberg (2008)
Wang, J., Karypis, G.: On mining instance-centric classification rules. IEEE Trans. Knowl. Data Eng. 18(11), 1497–1511 (2006)
Wang, Y., Xin, Q., Coenen, F.: Hybrid rule ordering in classification association rule mining. To appear in Transactions on Machine Learning and Data Mining in Pattern Recognition (2008)
Wu, X., Zhang, C., Zhang, S.: Efficient mining of both positive and negative association rules. ACM Trans. Inf. Syst. 22(3), 381–405 (2004), http://doi.acm.org/10.1145/1010614.1010616
Yin, X., Han, J.: Cpar: Classification based on predictive association rules. In: Proceedings of the 2003 SIAM Int. Conf. on Data Mining (SDM 2003). San Fransisco, CA (2003)
Yuan, X., Buckles, B.P., Yuan, Z., Zhang, J.: Mining negative association rules. In: ISCC 2002: Proceedings of the Seventh International Symposium on Computers and Communications (ISCC’02), p. 623. IEEE Computer Society Press, Washington (2002)
Zaïane, O.R., Antonie, M.-L.: On pruning and tuning rules for associative classifiers. In: Khosla, R., Howlett, R.J., Jain, L.C. (eds.) KES 2005. LNCS (LNAI), vol. 3683, pp. 966–973. Springer, Heidelberg (2005)
Zaki, M.: Generating non-redundant association rules. In: ACM SIGKDD international conference on Knowledge discovery and data mining, Boston, USA, pp. 34–43 (2000)
Zanuttini, B., Hébrard, J.J.: A unified framework for structure identification. Information Processing Letters 81(6), 335–339 (2002)
Zhao, L., Zaki, M.J., Ramakrishnan, N., Blosom, N.: A framework for mining arbitrary boolean expression. In: Proceedings of the 12th International Conference on Knowledge Discovery and Data Mining (KDD 2006), pp. 827–832 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Rioult, F., Zanuttini, B., Crémilleux, B. (2010). Nonredundant Generalized Rules and Their Impact in Classification. In: Ras, Z.W., Tsay, LS. (eds) Advances in Intelligent Information Systems. Studies in Computational Intelligence, vol 265. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05183-8_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-05183-8_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05182-1
Online ISBN: 978-3-642-05183-8
eBook Packages: EngineeringEngineering (R0)