Abstract
Association rule mining is one of the key issues in knowledge discovery. In recent years, negative association rule mining has attracted remarkable attention. This paper presents a notion of validity for both positive and negative association rules, which is considered intuitive and necessary. Then, a mining algorithm to find all rules in light of completeness is proposed. In doing so, several pruning strategies based on the upward closure property are developed and incorporated into the algorithm so as to guarantee the computational efficiency.
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
Piatetsky-Shapiro, G.: Discovery, Analysis and Presentation of Strong Rules. In: Knowledge Discovery in Databases, pp. 229–248. AAAI/MIT, Menlo Park (1991)
Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules between Sets of Items in Large Databases. In: Proc. ACM-SIGMOD Intl. Conf. on Management of Data, pp. 207–216 (1993)
Srikant, R., Agrawal, R.: Fast Algorithms for Mining Association Rules. In: Proc. VLDB Conference, pp. 487–499 (1994)
Brin, S., Motwani, R., Silverstein, C.: Beyond Market Baskets: Generalizing Association Rules to Correlations. In: Proc. ACM SIGMOD on Management of Data, pp. 265–276 (1997)
Savasere, A., Omiecinski, E., Navathe, S.: Mining for Strong Negative Associations in a Large Database of Customer Transactions. In: Proc. Intl. Conf. on Data Engineering, pp. 494–502 (1998)
Aggarwal, C.C., Yu, P.S.: A New Framework for Itemset Generation. In: Proc. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 18–24 (1998)
Wei, Q., Chen, G.: Association Rules with Opposite Items in Large Categorical Database. In: Proc. Intl. Conf. on Flexible Query Answering Systems, pp. 507–514 (2000)
Yuan, X., Buckles, B.P., Yuan, Z., Zhang, J.: Mining Negative Association Rules. In: Proc. Seventh Intl. Symposium on Computers and Communication, Italy, pp. 623–629 (2002)
Antonie, M.L., Zaïane, O.R.: Mining Positive and Negative Association Rules: an Approach for Confined Rules. In: Proc. Intl. Conf. on Principles and Practice of Knowledge Discovery in Databases, pp. 27–38 (2004)
Daly, O., Taniar, D.: Exception Rules Mining Based On Negative Association Rules. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds.) ICCSA 2004. LNCS, vol. 3046, pp. 543–552. Springer, Heidelberg (2004)
Thiruvady, D.R., Webb, G.I.: Mining Negative Association Rules Using GRD. In: Proc. Pacific-Asia Conf. on Advances in Knowledge Discovery and Data Mining, pp. 161–165 (2004)
Wu, X., Zhang, C., Zhang, S.: Efficient Mining of Both Positive and Negative Association Rules. ACM Trans. on Information Systems 22(3), 381–405 (2004)
Cornelis, C., Yan, P., Zhang, X., Chen, G.: Mining Positive and Negative Association Rules from Large Databases. In: Wang, Y., Cheung, Y.-m., Liu, H. (eds.) CIS 2006. LNCS (LNAI), vol. 4456, Springer, Heidelberg (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, H., Zhang, X., Chen, G. (2008). Mining a Complete Set of Both Positive and Negative Association Rules from Large Databases. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2008. Lecture Notes in Computer Science(), vol 5012. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68125-0_75
Download citation
DOI: https://doi.org/10.1007/978-3-540-68125-0_75
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68124-3
Online ISBN: 978-3-540-68125-0
eBook Packages: Computer ScienceComputer Science (R0)