Abstract
In recent years, the problem of finding the different aspects existing in a dataset has attracted many authors in the domain of knowledge quality in KDD. The discovery of knowledge in the form of association rules has become an important research. One of the most difficult issues is that an enormous number of association rules are discovered, so it is not easy to choose the best association rules or knowledge for a given dataset. Some methods are proposed for choosing the best rules with an interestingness measure or matching properties of interestingness measure for a given set of interestingness measures. In this paper, we propose a new approach to discover the clusters of interestingness measures existing in a dataset. Our approach is based on the evaluation of the distance computed between interestingness measures. We use two techniques: agglomerative hierarchical clustering (AHC) and partitioning around medoids (PAM) to help the user graphically evaluates the behavior of interestingness measures.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
- Association Rule
- Mining Association Rule
- Agglomerative Hierarchical Cluster
- Interestingness Measure
- Data Analysis Approach
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.
References
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. of the 20th VLDB, Santiago, Chile, pp. 487–499 (1994)
Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proc. of the ACM-SIGMOD Int. Conf. on Management of Data, Washington DC, USA, pp. 207–216 (1993)
Bayardo Jr., R.J., Agrawal, R.: Mining the most interestingness rules. In: KDD 1999, San Diego, CA, USA, pp. 145–154 (1999)
Blake, C.L., Merz, C.J.: UCI Repository of machine learning databases, University of California, Irvine, Dept. of Information and Computer Sciences (1998), http://www.ics.uci.edu/~mlearn/MLRepository.html
Freitas, A.A.: On rule interestingness measures. Knowledge-Based Systems 12(5-6), 309–315 (1999)
Gras, R., Couturier, R., Blanchard, J., Briand, H., Kuntz, P., Peter, P.: Quelques critères pour une mesure de qualité de règles d’association. Mesures de Qualité pour la Fouille de Données, RNTI-E-1. Cépaduès Editions, 3–31 (2004)
Gras, R.: L’implication statistique - Nouvelle méthode exploratoire de données. La pensée sauvage édition (1996)
Hilderman, R.J., Hamilton, H.J.: Knowledge Discovery and Measures of Interestingness. Kluwer Academic Publishers, Dordrecht (2001)
Huynh, X.H., Guillet, F., Briand, H.: ARQAT: an exploratory analysis tool for interestingness measures. In: ASMDA 2005, pp. 334–344 (2005)
Huynh, X.H., Guillet, F., Briand, H.: Clustering interestingness measures with positive correlation. In: ACM ICEIS 2005, pp. 248–253 (2005)
Kaufman, L., Rousseeuw, P.J.: Finding Groups in Data: An Introduction to Cluster Analysis. Wiley, New York (1990)
Liu, B., Hsu, W., Mun, L., Lee, H.: Finding interestingness patterns using user expectations. IEEE Trans. on Knowledge and Data Mining (11), 817–832 (1999)
Padmanabhan, B., Tuzhilin, A.: A belief-driven method for discovering unexpected patterns. In: KDD 1998, pp. 94–100 (1998)
Piatetsky-Shapiro, G.: Discovery, analysis and presentation of strong rules. In: Piatetsky-Shapiro, G., Frawley, W. (eds.) Knowledge Discovery in Databases, pp. 229–248. MIT Press, Cambridge (1991)
Saporta, G.: Probabilité, analyse des données et statistique. Edition Technip (1990)
Tan, P.N., Kumar, V., Srivastava, J.: Selecting the right objective measure for association analysis. Information Systems 29(4), 293–313 (2004)
Vaillant, B., Lenca, P., Lallich, S.: A clustering of interestingness measures. In: DS 2004, pp. 290–297 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huynh, XH., Guillet, F., Briand, H. (2005). A Data Analysis Approach for Evaluating the Behavior of Interestingness Measures. In: Hoffmann, A., Motoda, H., Scheffer, T. (eds) Discovery Science. DS 2005. Lecture Notes in Computer Science(), vol 3735. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11563983_28
Download citation
DOI: https://doi.org/10.1007/11563983_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29230-2
Online ISBN: 978-3-540-31698-5
eBook Packages: Computer ScienceComputer Science (R0)