Advertisement

Mining Closed Weighted Itemsets for Numerical Transaction Databases

  • Yuichi Kameda
  • Akihiro Yamamoto
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7258)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)Google Scholar
  2. 2.
    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)MathSciNetCrossRefGoogle Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    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)CrossRefGoogle Scholar
  7. 7.
    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)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Yuichi Kameda
    • 1
  • Akihiro Yamamoto
    • 1
  1. 1.Graduate School of InformaticsKyoto UniversityJapan

Personalised recommendations