Skip to main content
SpringerLink
Log in

Frequent Itemset Discovery

  • Reference work entry
  • First Online:
Encyclopedia of GIS

  • 94 Accesses

Synonyms

Market-basket analysis

Definition

Consider the set of all products sold by a supermarket. Assume that the owner of the supermarker is interested in finding out subsets of products that are often purchased together. Each customer transaction is stored in a transaction database, indicating the products that the customer purchased together. The database can be described as a table, whose columns are the products (items), and the rows are the transactions. The value of a specific entry, that is, (row, column)-pair, in the table is 1 if the corresponding product was purchased in the transaction, and 0 otherwise. The task is to find itemsets such that the items frequently occur in the same row (products purchased together). The most important interestingness measure in frequent itemset mining is support of an itemset. It is defined as the fraction of rows of the database that contain all the items x ∈ X. An itemset is frequent if its support exceeds a user-specified threshold value.

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 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  • Agrawal R, Ramakrishnan S (1994) Fast algorithms for mining association rules in large databases. In: Proceedings of the 20th international conference on very large data bases, Santiago, 12–15 Sept, pp 487–499

    Google Scholar 

  • Goethals B, Muhonen J, Toivonen H (2005) Mining nonderivable association rules. In: SIAM international conference on data mining, Newport Beach, pp 239–249

    Google Scholar 

  • Pasquier N, Bastide Y, Taouil R, Lakhal L (1999) Discovering frequent closed itemsets for association rules. In: Proceedings of the international conference of database theory – ICDT ’99, Jerusalem. Lecture notes in computer science, vol 1540, pp 398–416

    Google Scholar 

  • Zaki M (2000) Scalable algorithms for association mining. IEEE Trans Knowl Data Eng 12(3):372–390

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. HIIT Basic Research Unit, Department of Computer Science, University of Helsinki, Helsinki, Finland

    Marko Salmenkivi

Authors
  1. Marko Salmenkivi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marko Salmenkivi .

Editor information

Editors and Affiliations

  1. University of Minnesota, Minneapolis, MN, USA

    Shashi Shekhar

  2. Management Science and Information Systems Department, Rutgers Business School, Rutgers, The State University of New Jersey, Newark, NJ, USA

    Hui Xiong

  3. Department of Management Sciences, Tippie College of Business, University of Iowa, Iowa City, IA, USA

    Xun Zhou

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this entry

Cite this entry

Salmenkivi, M. (2017). Frequent Itemset Discovery. In: Shekhar, S., Xiong, H., Zhou, X. (eds) Encyclopedia of GIS. Springer, Cham. https://doi.org/10.1007/978-3-319-17885-1_432

Download citation

Publish with us

Policies and ethics

Search

Navigation