Abstract
The usual support/confidence framework to assess association rules has several drawbacks that lead to obtain many misleading rules, even in the order of 95% of the discovered rules in some of our experiments. In this paper we introduce a different framework, based on Shortliffe and Buchanan’s certainty factors and the new concept of very strong rules. The new framework has several good properties, and our experiments have shown that it can avoid the discovery of misleading rules.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proc. Of the 1993 ACM SIGMOD Conference, pages 207–216, 1993.
F. Berzal, M. Delgado, D. Sánchez, and M.A. Vila. Measuring the accuracy and importance of association rules. Technical Report CCIA-00-01-16, Department of Computer Science and Artificial Intelligence, University of Granada, 2000.
S. Brin, R. Motwani, J.D. Ullman, and S. Tsur. Dynamic itemset counting and implication rules for market basket data. SIGMOD Record, 26(2):255–264, 1997.
L.M. Fu and E.H. Shortliffe. The application of certainty factors to neural computing for rule discovery. IEEE Transactions on Neural Networks, 11(3):647–657, 2000.
G. Piatetsky-Shapiro. Discovery, analysis, and presentation of strong rules. In G. Piatetsky-Shapiro and W. Frawley, editors, Knowledge Discovery in Databases, pages 229–238. AAAI/MIT Press, 1991.
D. Sánchez. Adquisiciín de Relaciones Entre Atributos En Bases de Datos Relacionales (Translates to: Acquisition of Relationships Between Attributes in Relational Databases) (in Spanish). PhD thesis, Department of Computer Science and Artificial Intelligence, University of Granada, December 1999.
E. Shortliffe and B. Buchanan. A model of inexact reasoning in medicine. Mathematical Biosciences, 23:351–379, 1975.
A. Silberschatz and A. Tuzhilin. On subjective measure of interestingness in knowledge discovery. In Proc. First Int’l Conf. Knowledge Discovery and Data Mining (KDD’95), pages 275–281, August 1995.
C. Silverstein, S. Brin, and R. Motwani. Beyond market baskets: Generalizing association rules to dependence rules. Data Mining and Knowledge Discovery, 2:39–68, 1998.
P. Smyth and R.M. Goodman. Rule induction using information theory. In G. Piatetsky-Shapiro and W. J. Frawley, editors, Knowledge Discovery in Databases. AAAI/MIT Press, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berzal, F., Blanco, I., Sánchez, D., Vila, MA. (2001). A New Framework to Assess Association Rules. In: Hoffmann, F., Hand, D.J., Adams, N., Fisher, D., Guimaraes, G. (eds) Advances in Intelligent Data Analysis. IDA 2001. Lecture Notes in Computer Science, vol 2189. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44816-0_10
Download citation
DOI: https://doi.org/10.1007/3-540-44816-0_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42581-6
Online ISBN: 978-3-540-44816-7
eBook Packages: Springer Book Archive