Abstract
In the area of knowledge discovery in databases, the generalized association rule mining is an extension from the traditional association rule mining by given a database and taxonomy over the items in database. More initiative and informative knowledge can be discovered. In this work, we propose a novel approach of generalized closed itemsets. A smaller set of generalized closed itemsets can be the representative of a larger set of generalized itemsets. We also present an algorithm, called cSET, to mine only a small set of generalized closed frequent itemsets following some constraints and conditional properties. By a number of experiments, the cSET algorithm outperforms the traditional approaches of mining generalized frequent itemsets by an order of magnitude when the database is dense, especially in real datasets, and the minimum support is low.
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., Imielinski, T., Swami, A.N.: Mining association rules between sets of items in large databases. In: Buneman, P., Jajodia, S. (eds.) Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, Washington, D. C., pp. 207–216 (1993)
Srikant, R., Agrawal, R.: Mining generalized association rules. Future Generation Computer Systems 13, 161–180 (1997)
Hipp, J., Myka, A., Wirth, R., Güntzer, U.: A new algorithm for faster mining of generalized association rules. In: Żytkow, J.M. (ed.) PKDD 1998. LNCS, vol. 1510, pp. 74–82. Springer, Heidelberg (1998)
Chung, F., Lui, C.: A post-analysis framework for mining generalized association rules with multiple minimum supports (2000) In: Workshop Notes of KDD 2000 Workshop on Post-Processing in Machine Learing and Data Mining
Han, J., Fu, Y.: Mining multiple-level association rules in large databases. Knowledge and Data Engineering 11, 798–804 (1999)
Lui, C.L., Chung, F.L.: Discovery of generalized association rules with multiple minimum supports. In: Zighed, D.A., Komorowski, J., Żytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol. 1910, pp. 510–515. Springer, Heidelberg (2000)
Shintani, T., Kitsuregawa, M.: Parallel mining algorithms for generalized association rules with classification hierarchy. In: Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, pp. 25–36 (1998)
Michail, A.: Data mining library reuse patterns using generalized association rules. In: International Conference on Software Engineering, pp. 167–176 (2000)
Hwang, S.Y., Lim, E.P.: A data mining approach to new library book recommendations. In: Lim, E.-p., Foo, S.S.-B., Khoo, C., Chen, H., Fox, E., Urs, S.R., Costantino, T. (eds.) ICADL 2002. LNCS, vol. 2555, pp. 229–240. Springer, Heidelberg (2002)
Sriphaew, K., Theeramunkong, T.: A new method for fiding generalized frequent itemsets in generalized association rule mining. In: Corradi, A., Daneshmand, M. (eds.) Proc. of the Seventh International Symposium on Computers and Communications, Taormina-Giardini Naxos, Italy, pp. 1040–1045 (2002)
Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 398–416. Springer, Heidelberg (1998)
Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Efficient mining of association rules using closed itemset lattices. Information Systems 24, 25–46 (1999)
Zaki, M.J., Hsiao, C.J.: CHARM: An efficient algorithm for closed itemset mining. In: Grossman, R., Han, J., Kumar, V., Mannila, H., Motwani, R. (eds.) Proceedings of the Second SIAM International Conference on Data Mining, Arlington VA (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sriphaew, K., Theeramunkong, T. (2003). Mining Generalized Closed Frequent Itemsets of Generalized Association Rules. In: Palade, V., Howlett, R.J., Jain, L. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2003. Lecture Notes in Computer Science(), vol 2773. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45224-9_66
Download citation
DOI: https://doi.org/10.1007/978-3-540-45224-9_66
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40803-1
Online ISBN: 978-3-540-45224-9
eBook Packages: Springer Book Archive