Skip to main content
SpringerLink
Log in

The Closed Keys Base of Frequent Itemsets

  • Conference paper
  • First Online:
Data Warehousing and Knowledge Discovery (DaWaK 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2454))

Included in the following conference series:

Abstract

In data mining, concise representations are useful and necessary to apprehending voluminous results of data processing. Recently many different concise representations of frequent itemsets have been investigated. In this paper, we present yet another concise representation of frequent itemsets, called the closed keys representation, with the following characteristics: (i) it allows to determine if an itemset is frequent, and if so, the support of the itemset is immediate, and (ii) basing on the closed keys representation, it is straightforward to determine all frequent key itemsets and all frequent closed itemsets. An efficient algorithm for computing the closed key representation is offered. We show that our approach has many advantages over the existing approaches, in terms of efficiency, conciseness and information inferences.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Agrawal, T. Imielinski, and A. Swami, “Mining Association Rules between Sets of Items in Large Databases”, in Proc. of the 1993 ACM SIGMOD Int’l Conf. on Management of Data, May 1993, pp. 207–216.

    Google Scholar 

  2. R. Agrawal, R. Srikant, “Fast Algorithms for Mining Association Rules in Large Databases”, Proc. of the 20th Int’l Conference on Very Large Data Bases (VLDB), juin 1994, pp. 478–499.

    Google Scholar 

  3. C. C. Aggarwal, P.S. Yu, “Online Generation of Association Rules”, in Proc. of the Int’l Conference on Data Engineering, Orlando, Florida, Feb. 1998.

    Google Scholar 

  4. Y. Bastide, R. Taouil, N. Pasquier, G. Stumme and L. Lakhal, “Mining frequent patterns with counting inference” ACM SIGKDD Explorations, vol. 2(2), December 2000, pp. 66–75.

    Article  Google Scholar 

  5. A. Bykowski and C. Rigotti, “A condensed representation to find frequent patterns”, in Proc. of the 12th ACM SIGACT-SIGMOD-SIGART PODS’01, May, 2001.

    Google Scholar 

  6. B. Ganter, R. Wille, “Formal concept Analysis: Mathematical Foundations”, Springer, 1999.

    Google Scholar 

  7. M. Kryszkiewics, “Closed set based discovery of representative association rules”, in Proc. of IDA’01, Springer, September 2001.

    Google Scholar 

  8. M. Kryszkiewics, “Concise Representation of Frequent Patterns based on Disjunction-free Generators”, in Proc. of the 2001 IEEE International Conference on Data Mining (ICDM’01), 29-Nov.–2-Dec. 2001, San Jose, California, USA, pp. 305–312.

    Google Scholar 

  9. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, “Discovering frequent closed itemsets for association rules”, Proc. of the 7th Int’l Conf. on Database Theory (ICDT), jan. 1999, pp. 398–416.

    Google Scholar 

  10. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, “Efficient mining of association rules using closed itemset lattices”, Information Systems, 24(1), 1999, pp. 25–46.

    Article  Google Scholar 

  11. J. Pei, J. Han, R. Mao, “CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets”, in Proc. Workshop on Reasearch Issues on Data Mining and Knowledge Discovery (DMKD), May 2000, p. 21–30.

    Google Scholar 

  12. V. Phan-Luong, “The Representative Basis for Association Rules”, in Proc. of the 2001 IEEE International Conference on Data Mining (ICDM’01), 29-Nov.–2-Dec. 2001, San Jose, California, USA, poster paper pp. 639–640.

    Google Scholar 

  13. V. Phan-Luong, “Reasoning on Association Rules”, 17e Journées Bases de Données Avancées (BDA’2001), Cépaduès Edition, pp. 299–310.

    Google Scholar 

  14. M.J Zaki, C.J. Hsiao, “CHARM: An efficient algorithm for closed association rules mining”, Technical report 99-10, Computer Science Dept., Rensselaer Polytechnic Institute, Oct. 1999.

    Google Scholar 

  15. M.J Zaki, “Generating non-redundant association rules”, proc. of the 6th ACM SIGMOD Int’l Conf. on Knowledge Discovery and Data Mining KDD 2000 Boston, MA, August 2000, pp. 34–43.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d’Informatique Fondamentale de Marseille, LIF-UMR CNRS 6166, C.M.I. de l’Université de Provence, 39, rue F. Joliot Curie, 13453, Cedex 13, France

    Viet Phan Luong

Authors
  1. Viet Phan Luong
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Graduate School of Informatics, Kyoto University, Yoshida-Honmachi, Sakyo-ku, 606-8501, Kyoto, Japan

    Yahiko Kambayashi

  2. Institute for Computer Science and Business Informatics, University of Vienna, Liebiggasse 4, 1010, Vienna, Austria

    Werner Winiwarter

  3. Center for Spatial Information Science (CSIS), University of Tokyo, 4-6-1, Komaba, Meguro-ku, 153-8904, Tokyo, Japan

    Masatoshi Arikawa

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Luong, V.P. (2002). The Closed Keys Base of Frequent Itemsets. In: Kambayashi, Y., Winiwarter, W., Arikawa, M. (eds) Data Warehousing and Knowledge Discovery. DaWaK 2002. Lecture Notes in Computer Science, vol 2454. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46145-0_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-46145-0_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44123-6

  • Online ISBN: 978-3-540-46145-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation