Abstract
The wide existence of taxonomic structures among the attributes of database makes mining generalized association rules an important task. Determining how to utilize the characteristics of the taxonomic structures to improve performance of mining generalized association rules is challenging work. This paper proposes a new algorithm called AFOPT-tax for mining generalized association rules. It projects the transaction database to a compact structure - ascending frequency ordered prefix tree (AFOPT) with a series of optimization, which reduces the high cost of database scan and frequent itemsets generation greatly. The experiments with synthetic datasets show that our method significantly outperforms both the classic Apriori based algorithms and the current FP-Growth based algorithms.
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., Srikant, R.: Fast Algorithms for mining association rules. In: Proceedings of the 20th VLDB Conference, Santiago, Chile (September 1994); Expanded version available as IBM Research Report RJ 9839 (June 1994)
Srikant, R., Agrawal, R.: Mining generalized association rules. In: Proceedings of the 21st VLDB Conference, Zurich, Switzerland (1995)
Zaki, M.J.: Scalable algorithms for association mining. IEEE Transactions of Knowledge and Data Engineering 12(3), 372–373 (2000)
Hipp, J., Myka, A., Wirth, R., Guntzer, U.: A new algorithm for faster mining of generalized association rules. In: Proceedings of the 2nd European symposium on principles of data mining and knowledge discovery, Nantes, France, pp. 74–82 (1998)
Sriphaew, K., Theeramunkong, T.: A New Method for Finding Generalized Frequent Itemsets in Generalized Association Rule Mining. In: Proceeding of the 7th International Symposium on Computers and Communications, Taormina, Giardini Naxos, Italy, pp. 1040–1045 (2002)
Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of the SIGMOD Conference, Dallas, Texas, USA, pp. 1–12 (2000)
Wang, K., Tang, L., Han, J., Liu, J.: Top down FP-Growth for association rule mining. In: Proceedings of the 6th Pacific Area Conference on Knowledge Discovery and Data Mining, pp. 334–340 (2002)
Pramudiono, I., Kitsuregawa, M.: FP-tax: Tree Structure Based Generalized Association Rule Mining. In: Proceedings of the 9th SIGMOD workshop on Research issues in data mining and knowledge discovery, pp. 60–63 (2004)
Liu, G.M., Lu, H.J., Lou, W.W., Xu, Y.B., Yu, J.X.: Efficient Mining of Frequent Patterns Using Ascending Frequency Ordered Prefix-Tree. DMKD 9, 249–274 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mao, Y.X., Le Shi, B. (2010). AFOPT-Tax: An Efficient Method for Mining Generalized Frequent Itemsets. In: Nguyen, N.T., Le, M.T., Świątek, J. (eds) Intelligent Information and Database Systems. ACIIDS 2010. Lecture Notes in Computer Science(), vol 5990. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12145-6_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-12145-6_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12144-9
Online ISBN: 978-3-642-12145-6
eBook Packages: Computer ScienceComputer Science (R0)