Abstract
Most rule-interest measures are suitable for binary attributes and using an unsupervised usual algorithm for the discovery of association rules requires a transformation for other kinds of attributes. Given that the complexity of these algorithms increases exponentially with the number of attributes, this transformation can lead us, on the one hand to a combinatorial explosion, and on the other hand to a prohibitive number of weakly significant rules with many redundancies. To fill the gap, we propose in this study a new objective rule-interest measure called intensity of inclination which evaluates the implication between two ordinal attributes (numeric or ordinal categorical attributes). This measure allows us to extract a new kind of knowledge: ordinal association rules. An evaluation of an application to some banking data ends up the study.
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
Brin S., Motwani R., Ullman J.D. et Tsur S.,”Dynamic Itemset Counting and Implications Rules for market Basket Data”, In Proc. Of the 1997 ACM SIGMOD Conference, p. 255–264, 1997, Tucson, Arizona, USA.
Kodratoff Y., Rating the Interest of Rules Induced from Data and within Texts, proc. 12th IEEE-International Conference on Databases and Expert Systems Applications-DEXA 2001, Munich, Sept. 2001.
Silberschatz A. et Tuzhilin A., ”What makes Patterns interesting in Knowledge Discovery Systems”, IEEE Trans. On Know. And Data Eng. 8(6), p. 970–974, 1996.
Agrawal R., Mannila H., Srhcant R., Toivonen H. et Verkamo A.I.,”Fast Discovery of Association Rules”, In Fayyad U.M., Piatetsky-Shapiro G., Smyth P. and Uthurusamy R. eds., Advances in Knowledge Discovery and Data Mining. AAAI/MIT Press. p. 307–328, 1996.
Srikant R., Agrawal R., „Mining quantitative association rules in large relational tables“, Proceedings 1996 ACM-SIGMOD International Conference Management of Data, Montréal, Canada, Juin 1996.
Guillaume S., Khenchaf A., Briand H., „Generalizing association rules to ordinal rules“, Proceedings of the 2000 Conference on Information Quality IQ’2000, Boston, USA, 2000, p. 268–282.
Lagrange J.B., Analyse Implicative d’un Ensemble de Variables Numériques, Application au Traitement d’un Questionnaire à Réponses Modales Ordonnées, rapport interne Institut de Recherche Mathématique de Rennes, Prépublication 97-32 Implication Statistique, Décembre1997.
Gras R., Almouloud S.A.; Bailleul M.; Larher A.; Polo M.; Ratsimba-rajohn H. and Totohasina A. 1996. L’implication Statistique, Ouvrage de 320 pages dans la Collection Associée à ”Recherches en Didactique des Mathématiques”, La Pensée Sauvage, Grenoble.
Guillaume S., „L’intensité d’inclination: une généralisation de l’intensité d’implication ordinale“, Actes des 8ème Rencontres de la Société Francophone de Classification (SFC’2001), 17–21 décembre 2001, Pointe-à-Pitre, Guadeloupe.
Guillaume S., “Traitement des données volumineuses — Mesures et algorithmes d’extraction de règles d’association et règles ordinales”, Thèse de Doctorat, Nantes, 15 Décembre 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guillaume, S. (2002). Discovery of Ordinal Association Rules. In: Chen, MS., Yu, P.S., Liu, B. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2002. Lecture Notes in Computer Science(), vol 2336. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47887-6_32
Download citation
DOI: https://doi.org/10.1007/3-540-47887-6_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43704-8
Online ISBN: 978-3-540-47887-4
eBook Packages: Springer Book Archive