Abstract
Evaluating the interestingness of rules or trees is a challenging problem of knowledge discovery and data mining. In recent studies, the use of two interestingness measures at the same time was prevailing. Mining of Pareto-optimal borders according to support and confidence, or support and anti-support are examples of that approach. Here, we consider induction of “if..., then...” association rules with a fixed conclusion. We investigate ways to limit the set of rules non–dominated wrt support and confidence or support and anti-support, to a subset of truly interesting rules. Analytically, and through experiments, we show that both of the considered sets can be easily reduced by using the valuable semantics of confirmation measures.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Imielinski, T.: Mining associations between sets of items in massive databases. In: Proc.of ACM-SIGMOD Int’l Conf. on Management of Data, ACM Press, New York (1993)
Bayardo, R.J., Agrawal, R.: Mining the most interesting rules. In: Proc. of 5th ACM-SIGKDD Int’l Conf. on Knowledge Disc.and Data Mining, pp. 145–154. ACM Press, New York (1999)
Brzezińska, I., Greco, S., Słowiński, R.: Mining pareto-optimal rules with respect to support and anti-support. Eng. Applic.of Artif. Intelligence (to appear)
Fitelson, B.: Studies in Bayesian Confirmation Theory. MSc. thesis, University of Wisconsin, Madison (2001)
Greco, S., Pawlak, Z., Słowiński, R.: Can bayesian confirmation measures be useful for rough set decision rules? Eng. Applic.of Artif. Intelligence 17, 345–361 (2004)
Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proc. ACM SIGMOD Conference on Management of Data, pp. 1–12. ACM Press, New York (2000)
Kohavi, R.J.: Scaling up the accuracy of naive-bayes classifiers: a decision-tree hybrid. In: Proc. of the 2nd Int’l Conf. on Knowledge Discovery and Data Mining (1996)
Słowiński, R., Szczech, I., Urbanowicz, M., Greco, S.: Experiments with induction of assoc. rules wrt support,anti-support. Technical Report RA-018/06, II-PP (2006)
Urbanowicz, M.: Induction of association rules with given support, confidence and confirmation. PhD thesis, Poznań University of Technology (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Słowiński, R., Szczęch, I., Urbanowicz, M., Greco, S. (2007). Mining Association Rules with Respect to Support and Anti-support-Experimental Results. In: Kryszkiewicz, M., Peters, J.F., Rybinski, H., Skowron, A. (eds) Rough Sets and Intelligent Systems Paradigms. RSEISP 2007. Lecture Notes in Computer Science(), vol 4585. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73451-2_56
Download citation
DOI: https://doi.org/10.1007/978-3-540-73451-2_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73450-5
Online ISBN: 978-3-540-73451-2
eBook Packages: Computer ScienceComputer Science (R0)