Abstract
Data Mining helps to uncover the already unknown and non-redundant knowledge in large databases, which can be used for decision making purpose. Association rule mining is one of the key research area in the field of Data Mining. Association rule mining can be considered as unsupervised learning model, it discovers the interesting relationship among large set of data items on the basis of some predefined threshold. Support-confidence is the classical model used for the rule mining purpose, it uses confidence for final rule generation but it has some limitations. As sometimes it can generate those rules which are not positively correlated and thus can mislead the decision maker. In this paper we addressed the problems associated with existing approach and also proposed two new measure of interestingness to deal with these problems. The new measures have been tested for their correctness.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Imielinski, T., Agrawal, R., Swami, A.N.: Mining association rules between sets of items in large databases. In: Proceedings of the ACM SIGMOD Conference on Management of Data, vol. 22, pp. 207–216 (1993)
Agrawal, R., Srikant, R.: Fast algorithm for mining association rules. In: Proceeding of 20th International Conference on Very Large Databases, pp. 487–499 (2003)
Silberschatz, A., Tuzhilin, A.: What makes pattern interesting in knowledge discovery systems. IEEE Transactions on Knowledge and Data Engineering, 970–974 (1996)
Piatetsky-Shapiro, G.: Discovery, analysis and presentation of strong rules. In: Piatetsky-Shapiro, G., Frawley, W. (eds.) Knowledge Discovery in Databases, pp. 229–248 (1991)
Kumar, V., Tan, P., Srivastva, J.: Selecting the right interestingness measure for association patterns. In: Proceedings of the 8th International Conference on Knowledge Discovery and Data Mining, pp. 32–41 (2002)
Omiecinski, E., Savasere, A., Navathe, S.: An efficient algorithm for mining association in large databases. In: Proceedings of the 21st International Conference on Very Large Databases, pp. 432–444 (1995)
Toivonen, H.: Sampling large databases for association rules. VLDB Journal, 134–145 (1996)
Ullman, J.D., Brin, S., Motwani, R., Tsur, S.: Dynamic itemset counting and implication rules for market basket data. In: Proceedings of ACM SIGMOD International Conference Management of Data, vol. 8, pp. 255–264 (1997)
Pei, J., Han, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proc. ACM-SIGMOD International Conference on Management of Data, pp. 1–12 (2000)
Zhang, C., Wu, X., Zhang, S.: Efficient mining of both positive and negative association rules. ACM Transaction on Information Systems 22, 381–405 (2004)
Geng, L., Hamilton, H.J.: Interestingness measures for Data Mining. A survey. ACM Computing Surveys 38 (2006)
Vanhoof, K., Brijs, T., Vets, G.: Defining interestingness for association rules. International Journal on Information Theories Applications 10, 370–375 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bhurani, P., Ahmed, M., Meena, Y.K. (2012). New Measure of Interestingness for Efficient Extraction of Association Rules. In: Satapathy, S.C., Avadhani, P.S., Abraham, A. (eds) Proceedings of the International Conference on Information Systems Design and Intelligent Applications 2012 (INDIA 2012) held in Visakhapatnam, India, January 2012. Advances in Intelligent and Soft Computing, vol 132. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27443-5_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-27443-5_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27442-8
Online ISBN: 978-3-642-27443-5
eBook Packages: EngineeringEngineering (R0)