Abstract
Mining association rules is a fundamental data mining task. However, depending on the choice of the parameters (the minimum confidence and minimum support), current algorithms can become very slow and generate an extremely large amount of results or generate too few results, omitting valuable information.This is a serious problem because in practice users have limited resources for analyzing the results and thus are often only interested in discovering a certain amount of results, and fine tuning the parameters is time-consuming.To address this problem, we propose an algorithm to mine the top-k association rules, where k is the number of association rules to be found and is set by the user. The algorithm utilizes a new approach for generating association rules named rule expansions and includes several optimizations. Experimental results show that the algorithm has excellent performance and scalability, and that it is an advantageous alternative to classical association rule mining algorithms when the user want to control the number of rules generated.
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.
Similar content being viewed by others
References
Agrawal, R., Imielminski, T., Swami, A.: Mining Association Rules Between Sets of Items in Large Databases. In: Proc. ACM Intern. Conf. on Management of Data, pp. 207–216. ACM Press (June 1993)
Han, J., Kamber, M.: Data Mining: Concepts and Techniques, 2nd edn. Morgan Kaufmann Publ., San Francisco (2006)
Han, J., Pei, J., Yin, Y., Mao, R.: Mining Frequent Patterns without Candidate Generation. Data Mining and Knowledge Discovery 8, 53–87 (2004)
Pei, J., Han, J., Lu, H., Nishio, S., Tang, S., Yang, D.: H-Mine: Fast and space-preserving frequent pattern mining in large databases. IIE Trans. 39(6), 593–605 (2007)
Webb, G.I., Zhang, S.: K-Optimal-Rule-Discovery. Data Mining and Knowledge Discovery 10(1), 39–79 (2005)
Webb, G.I.: Filtered top-k association discovery. WIREs Data Mining and Knowledge Discovery 1, 183–192 (2011)
Kun Ta, C., Huang, J.-L., Chen, M.-S.: Mining Top-k Frequent Patterns in the Presence of the Memory Constraint. VLDB Journal 17(5), 1321–1344 (2008)
Wang, J., Lu, Y., Tzvetkov, P.: Mining Top-k Frequent Closed Itemsets. IEEE Trans. Knowledge and Data Engineering 17(5), 652–664 (2005)
Pietracaprina, A., Vandin, F.: Efficient Incremental Mining of Top-K Frequent Closed Itemsets. In: Corruble, V., Takeda, M., Suzuki, E. (eds.) DS 2007. LNCS (LNAI), vol. 4755, pp. 275–280. Springer, Heidelberg (2007)
Tzvetkov, P., Yan, X., Han, J.: TSP: Mining Top-k Closed Sequential Patterns. Knowledge and Information Systems 7(4), 438–457 (2005)
You, Y., Zhang, J., Yang, Z., Liu, G.: Mining Top-k Fault Tolerant Association Rules by Redundant Pattern Disambiguation in Data Streams. In: Proc. 2010 Intern. Conf. Intelligent Computing and Cognitive Informatics, pp. 470–473. IEEE Press (March 2010)
Cormen, T.H., Leiserson, C.E., Rivest, R., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)
Lucchese, C., Orlando, S., Perego, R.: Fast and Memory Efficient Mining of Frequent Closed Itemsets. IEEE Trans. Knowl. and Data Eng. 18(1), 21–36 (2006)
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
Fournier-Viger, P., Wu, CW., Tseng, V.S. (2012). Mining Top-K Association Rules. In: Kosseim, L., Inkpen, D. (eds) Advances in Artificial Intelligence. Canadian AI 2012. Lecture Notes in Computer Science(), vol 7310. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30353-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-30353-1_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30352-4
Online ISBN: 978-3-642-30353-1
eBook Packages: Computer ScienceComputer Science (R0)