Abstract
In this article we extend the notion of closed itemsets of binary transaction databases to numerical transaction databases, and give an algorithm to mine them. We compare the computation time of our method and the case using scaling technique. We consider the case that information of closed itemsets of binarized database is given, and investigate how changes if algorithm utilize the information for mining by some experiments.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, pp. 207–216 (1993)
Han, J., Pei, J., Yin, Y., Mao, R.: Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Mining and Knowledge Discovery 8, 53–87 (2004)
Ganter, B., Wille, R.: Applications of combinatorics and graph theory to the biological and social sciences. The IMA Volumes in Mathematics and Its Applications, vol. 17, pp. 139–167 (1989)
Kaytoue, M., Kuznetsov, S.O., Napoli, A.: Revisiting numerical patterns with formal concept analysis. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence, pp. 1342–1347 (2011)
Chan, R., Yang, Q., Shen, Y.-D.: Mining high utility itemsets. In: Proceedings of the Third International Conference on Data Mining, pp. 19–26 (2003)
Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering Frequent Closed Itemsets for Association Rules. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS (LNAI), vol. 1540, pp. 398–416. Springer, Heidelberg (1998)
Uno, T., Asai, T., Uchida, Y., Arimura, H.: An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases. In: Suzuki, E., Arikawa, S. (eds.) DS 2004. LNCS (LNAI), vol. 3245, pp. 16–31. Springer, Heidelberg (2004)
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
Kameda, Y., Yamamoto, A. (2012). Mining Closed Weighted Itemsets for Numerical Transaction Databases. In: Okumura, M., Bekki, D., Satoh, K. (eds) New Frontiers in Artificial Intelligence. JSAI-isAI 2011. Lecture Notes in Computer Science(), vol 7258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32090-3_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-32090-3_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32089-7
Online ISBN: 978-3-642-32090-3
eBook Packages: Computer ScienceComputer Science (R0)