Abstract
The association rules (ARs) post-processing step is challenging, since many patterns are extracted and only a few of them are useful to the user. One of the most traditional approaches to find rules that are of interestingness is the use of objective measures (OMs). Due to their frequent use, many of them exist (over 50). Therefore, when a user decides to apply such strategy he has to decide which one to use. To solve this problem this work proposes a process to cluster ARs based on their interestingness, according to a set of OMs, to obtain an ordered list containing the most relevant patterns. That way, the user does not need to know which OM to use/select nor to handle the output of different OMs lists. Experiments show that the proposed process behaves equal or better than as if the best OM had been used.
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
Notes
- 1.
The algorithm won the “2014 SIGKDD Test of Time Award” (http://www.kdd.org/News/view/2014-sigkdd-test-of-time-award).
References
Belohlavek, R., Grissa, D., Guillaume, S., Nguifo, E.M., Outrata, J.: Boolean factors as a means of clustering of interestingness measures of association rules. Ann. Math. Artif. Intell. 70(1), 151–184 (2014)
Bong, K.K., Joest, M., Quix, C., Anwar, T.: Automated interestingness measure selection for exhibition recommender systems. In: Nguyen, N.T., Attachoo, B., Trawiński, B., Somboonviwat, K. (eds.) ACIIDS 2014. LNCS (LNAI), vol. 8397, pp. 221–231. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-05476-6_23
de Carvalho, V.O., de Padua, R., Rezende, S.O.: Solving the problem of selecting suitable objective measures by clustering association rules through the measures themselves. In: Freivalds, R.M., Engels, G., Catania, B. (eds.) SOFSEM 2016. LNCS, vol. 9587, pp. 505–517. Springer, Heidelberg (2016). https://doi.org/10.1007/978-3-662-49192-8_41
de Carvalho, V.O., dos Santos, F.F., Rezende, S.O., de Padua, R.: PAR-COM: a new methodology for post-processing association rules. In: Zhang, R., Zhang, J., Zhang, Z., Filipe, J., Cordeiro, J. (eds.) ICEIS 2011. LNBIP, vol. 102, pp. 66–80. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-29958-2_5
Djenouri, Y., Drias, H., Habbas, Z., Chemchem, A.: Organizing association rules with meta-rules using knowledge clustering. In: 11th International Symposium on Programming and Systems, pp. 109–115 (2013)
Ester, M., Kriegel, H., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: 2nd International Conference on Knowledge Discovery and Data Mining, pp. 226–231 (1996)
Guillaume, S., Grissa, D., Mephu Nguifo, E.: Categorization of interestingness measures for knowledge extraction. CoRR abs/1206.6741 (2012)
Huynh, X.H., Guillet, F., Blanchard, J., Kuntz, P., Briand, H., Gras, R.: A graph-based clustering approach to evaluate interestingness measures: a tool and a comparative study. In: Guillet, F.J., Hamilton, H.J. (eds.) Quality Measures in Data Mining. Studies in Computational Intelligence, vol. 43, pp. 25–50. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-44918-8_2
Kaufman, F., Rousseeuw, P.J.: Finding Groups in Data: An Introduction to Cluster Analysis. Wiley, Hoboken (2005)
Tan, P., Steinbach, M., Kumar, V.: Introduction to Data Mining (2006)
Tew, C., Giraud-Carrier, C., Tanner, K., Burton, S.: Behavior-based clustering and analysis of interestingness measures for association rule mining. Data Min. Knowl. Discov. 28(4), 1004–1045 (2014)
Acknowledgments
We wish to thank FAPESP (2015/08059-0) and CAPES for the financial support.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
de Carvalho, V.O., de Paula, D.D., Pacheco, M.V., dos Santos, W.E., de Padua, R., Rezende, S.O. (2018). Ranking Association Rules by Clustering Through Interestingness. In: Castro, F., Miranda-Jiménez, S., González-Mendoza, M. (eds) Advances in Soft Computing. MICAI 2017. Lecture Notes in Computer Science(), vol 10632. Springer, Cham. https://doi.org/10.1007/978-3-030-02837-4_28
Download citation
DOI: https://doi.org/10.1007/978-3-030-02837-4_28
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-02836-7
Online ISBN: 978-3-030-02837-4
eBook Packages: Computer ScienceComputer Science (R0)