Skip to main content
SpringerLink
Log in

Frequent Itemset Discovery

  • Reference work entry
Encyclopedia of GIS

  • 91 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

Institutional subscriptions

Recommended Reading

  1. Agrawal, R., Ramakrishnan, S.: Fast algorithms for mining association rules in large databases. Proceedings of the 20th International Conference on Very Large Data Bases, pp. 487–499, September 12–15 (1994)

    Google Scholar 

  2. Goethals, B., Muhonen, J., Toivonen, H.: Mining non‐derivable association rules. SIAM International Conference on Data Mining, 239–249, Newport Beach, California (2005)

    Google Scholar 

  3. Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Proceedings of the International Conference of Database Theory – ICDT '99. Lecture Notes in Computer Science vol. 1540, pp. 398–416 (1999)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. 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

Editor information

Editors and Affiliations

  1. Faculty of Computer Science and Engineering, University of Minnesota, Minneapolis, MN, 55455, USA

    Shashi Shekhar (McKnight Distinguished University Professor) (McKnight Distinguished University Professor)

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

    Hui Xiong (Assistant Professor) (Assistant Professor)

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Salmenkivi, M. (2008). Frequent Itemset Discovery. In: Shekhar, S., Xiong, H. (eds) Encyclopedia of GIS. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35973-1_432

Download citation

Publish with us

Policies and ethics

Search

Navigation