Abstract
A lot of data mining literature is devoted to association rules and their evaluation. As the number of discovered rules is often huge, their direct usage by a human being may be infeasible. In the case of classical strong association rules, which are defined as rules supported by sufficiently large fraction of data and having sufficient confidence, a number of their concise representations have been proposed. However, as indicated in the literature, support and confidence measures of association rules seem not to cover many aspects that could be of interest to a user. In consequence, many other measures have been proposed to evaluate association rules. In this paper, we identify an important and wide class of rule ACBC-evaluation measures and offer a lossless representation of association rules satisfying constraints for any set of evaluation measures from this class. A number of properties of the representation is derived as well.
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
References
Agrawal, R., Imielinski, T., Swami, A.N.: Mining association rules between sets of items in large databases. In: ACM SIGMOD International Conference on Management of Data, pp. 207–216 (1993)
Bastide, Y., Pasquier, N., Taouil, R., Stumme, G., Lakhal, L.: Mining minimal non-redundant association rules using frequent closed itemsets. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 972–986. Springer, Heidelberg (2000)
Brin, S., Motwani, R., Ullman, J.D., Tsur, S.: Dynamic itemset counting and implication rules for market basket data. In: ACM SIGMOD 1997 International Conference on Management of Data, pp. 255–264 (1997)
Hamrouni, T., Yahia, S.B., Nguifo, E.M.: Succinct minimal generators: theoretical foundations and applications. Int. J. Found. Comput. Sci. 19(2), 271–296 (2008)
Hilderman, R.J., Hamilton, H.J.: Evaluation of interestingness measures for ranking discovered knowledge. In: Cheung, D., Williams, G.J., Li, Q. (eds.) PAKDD 2001. LNCS (LNAI), vol. 2035, pp. 247–259. Springer, Heidelberg (2001)
Kryszkiewicz, M.: Closed set based discovery of representative association rules. In: Hoffmann, F., Adams, N., Fisher, D., Guimaraes, G., Hand, D.J. (eds.) IDA 2001. LNCS, vol. 2189, pp. 350–359. Springer, Heidelberg (2001)
Kryszkiewicz M.: Concise Representations of Frequent Patterns and Association Rules, Prace Naukowe Politechniki Warszawskiej. Elektronika, no. 142 (2002)
Kryszkiewicz, M.: Concise Representations of Association Rules. In: Hand, D.J., Adams, N.M., Bolton, R.J. (eds.) Pattern Detection and Discovery. LNCS (LNAI), vol. 2447, pp. 92–109. Springer, Heidelberg (2002)
Kryszkiewicz, M.: Dependence factor for association rules. In: Nguyen, N.T., Trawiński, B., Kosala, R. (eds.) ACIIDS 2015. LNCS, vol. 9012, pp. 135–145. Springer, Heidelberg (2015)
Kryszkiewicz, M.: Dependence factor as a rule evaluation measure. In: Matwin, S., Mielniczuk, J. (eds.) Challenges in Computational Statistics and Data Mining, Studies in Computational Intelligence, vol. 605, pp. 205–223. Springer, Switzerland (2016)
Lavrač, N., Flach, P.A., Zupan, B.: Rule evaluation measures: a unifying view. In: Džeroski, S., Flach, P.A. (eds.) ILP 1999. LNCS (LNAI), vol. 1634, pp. 174–185. Springer, Heidelberg (1999)
Lenca, P., Meyer, P., Vaillant, B., Lallich, S.: On selecting interestingness measures for association rules: user oriented description and multiple criteria decision aid. Eur. J. Oper. Res. 184, 610–626 (2008). Elsevier
Piatetsky-Shapiro, G.: Gregory piatetsky-shapiro: discovery, analysis, and presentation of strong rules. In: Knowledge Discovery in Databases, pp. 229–248. AAAI/MIT Press (1991)
Sheikh, L.M., Tanveer, B., Hamdani, S.M.A.: Interesting measures for mining association rules. In: Proceedings of INMIC 2004, IEEE 2004 (2004)
Shortliffe, E., Buchanan, B.: A model of inexact reasoning in medicine. Math. Biosci. 23, 351–379 (1975)
Suzuki, E.: Interestingness measures - limits, desiderata, and recent results. In: Lenca, P., Lallich, S. (Eds.) QIMIE/PAKDD 2009 (2009)
Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: Intelligent structuring and reducing of association rules with formal concept analysis. In: Baader, F., Brewka, G., Eiter, T. (eds.) KI 2001. LNCS (LNAI), vol. 2174, pp. 335–350. Springer, Heidelberg (2001)
Zaki, M.J.: Generating non-redundant association rules. In: 6th ACM SIGKDD (2000)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kryszkiewicz, M. (2016). A Lossless Representation for Association Rules Satisfying Multiple Evaluation Criteria. In: Nguyen, N.T., Trawiński, B., Fujita, H., Hong, TP. (eds) Intelligent Information and Database Systems. ACIIDS 2016. Lecture Notes in Computer Science(), vol 9622. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-49390-8_14
Download citation
DOI: https://doi.org/10.1007/978-3-662-49390-8_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-49389-2
Online ISBN: 978-3-662-49390-8
eBook Packages: Computer ScienceComputer Science (R0)