Abstract
Mining for association rules is one of the fundamental tasks of data mining. Association rule mining searches for interesting relationships amongst items for a given dataset based mainly on the support and confidence measures. Support is used for filtering out infrequent rules, while confidence measures the implication relationships from a set of items to one another. However, one of the main drawbacks of the confidence measure is that it presents the absolute value of implication that does not reflect truthfully the relationships amongst items. For example, if two items have a very high frequency, then they will probably form a rule with a high confidence even if there is no relationship between them at all. In this paper, we propose a new measure known as relative confidence for mining association rules, which is able to reflect truthfully the relationships of items. The effectiveness of the relative confidence measure is evaluated in comparison with the confidence measure in mining interesting relationships between terms from textual documents and in associative classification.
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
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. of the 20th Int’l Conf. on Very Large Databases (VLDB 1994), Santiago, Chile, June 1994, pp. 487–499 (1994)
Brin, S., Motwani, R., Silverstein, C.: Beyond Market Baskets: Generalizing association rules to correlations. In: Proc. of the ACM SIGMOD Conference, pp. 265–276 (1997)
Brin, S., Motwani, R., Ullman, J.D., Tsur, S.: Dynamic itemset counting and implication rules for market basket data. In: Proc. of the ACM SIGMOD Conference, May 1997, pp. 255–264 (1997)
Ahmed, K., EI-Makky, N., Taha, Y.: A note on ‘Beyond Market Baskets: Generalizing association rules to correlations’. ACM SIGKDD Explorations 1(2), 46–48 (2000)
Liu, B., Hsu, W., Ma, Y.: Integrating classification and association rule mining. In: Proc of the Fourth International Conference on Knowledge Discovery and Data Mining, New York, NY, pp. 80–86 (1998)
UCI Machine Learning Repository, Available online at http://www.ics.uci.edu/~mlearn/MLRepository.html
Liu, B., Ma, Y., Wong, C.K.: Classification Using Association Rules: Weaknesses and Enhancements. In: Kumar, V., et al. (eds.) Data mining for scientific applications (2001)
Antonie, M.L., Zaïane, O.R.: Text Document Categorization by Term Association. In: Proc. of the IEEE International Conference on Data Mining (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Do, T.D., Hui, S.C., Fong, A.C.M. (2004). Mining Association Rules Using Relative Confidence. In: Yang, Z.R., Yin, H., Everson, R.M. (eds) Intelligent Data Engineering and Automated Learning – IDEAL 2004. IDEAL 2004. Lecture Notes in Computer Science, vol 3177. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28651-6_45
Download citation
DOI: https://doi.org/10.1007/978-3-540-28651-6_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22881-3
Online ISBN: 978-3-540-28651-6
eBook Packages: Springer Book Archive