Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of Database Systems pp 1–5Cite as

Apriori Property and Breadth-First Search Algorithms

  • Living reference work entry
  • First Online:

  • 51 Accesses

Synonyms

Downward closure property; Levelwise search; Monotonicity property

Definition

Given a large database of sets of items, called transactions, the goal of frequent itemset mining is to find all subsets of items, called itemsets, occurring frequently in the database, i.e., occurring in a given minimum number of transactions.

The search space of all itemsets is exponential in the number of different items occurring in the database. Hence, the naive approach to generate and count the frequency of all itemsets over the database can not be achieved within reasonable time. Also, the given databases could be massive, containing millions of transactions, making frequency counting a tough problem in itself.

Therefore, numerous solutions have been proposed to perform a more directed search through the search space, almost all relying on the well known Apriori-property. These solutions can be divided into breadth-first search and depth-first search, of which the first is discussed here.

Hist...

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

Recommended Reading

  1. Agrawal R, Mannila H, Srikant R, Toivonen H, Verkamo A. Fast discovery of association rules. In: Fayyad U, Piatetsky-Shapiro G, Smyth P, Uthurusamy R, editors. Advances in knowledge discovery and data mining. Cambridge, MA: MIT; 1996. p. 307–28.

    Google Scholar 

  2. Bayardo J, Roberto J. Efficiently mining long patterns from databases. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1998. p. 85–93.

    Google Scholar 

  3. Bodon F. A fast apriori implementation. In: Proceedings of the ICDM Workshop on Frequent Itemset Mining Implementations, vol. 90 of CEUR Workshp Proceedings; 2003.

    Google Scholar 

  4. Borgelt C, Kruse R. Induction of association rules: apriori implementation. In: Proceedings of the 15th Conference on Computational Statistics; 2002. p. 395–400.

    Google Scholar 

  5. Boulicaut JF, Bykowski A, Rigotti C. Free-sets: a condensed representation of boolean data for the approximation of frequency queries. Data Min Knowl Discov. 2003;7(1):5–22.

    Article  MathSciNet  Google Scholar 

  6. Bykowski A, Rigitti C. A condensed representation to find frequent patterns. In: Proceedings of the 20th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems; 2001. p. 267–73.

    Google Scholar 

  7. Calders T, Goethals B. Mining all non-derivable frequent itemsets. In: Principles of Data Mining and Knowledge Discovery, 6th European Conference; 2002. p. 74–85.

    Google Scholar 

  8. Calders T, Goethals B. Minimal k-free representations of frequent sets. In: Principles of Data Mining and Knowledge Discovery, 7th European Conference; 2003. p. 71–82.

    Google Scholar 

  9. Gunopulos D, Khardon R, Mannila H, Saluja S, Toivonen H, Sharma R. Discovering all most specific sentences. ACM Trans Database Syst. 2003;28(2):140–74.

    Article  Google Scholar 

  10. Mannila H. Inductive databases and condensed representations for data mining. In: Proceedings of the 14th International Conference on Logic Programming; 1997. p. 21–30.

    Google Scholar 

  11. Pasquier N, Bastide Y, Taouil R, Lakhal L. Discovering frequent closed itemsets for association rules. In: Proceedings of the 7th International Conference on Database Theory; 1999. p. 398–416.

    Google Scholar 

  12. Savasere A, Omiecinski E, Navathe S. An efficient algorithm for mining association rules in large databases. In: Proceedings of the 21th International Conference on Very Large Data Bases; 1995. p. 432–44.

    Google Scholar 

  13. Toivonen H. Sampling large databases for association rules. In: Proceedings of the 22th International Conference on Very Large Data Bases; 1996. p. 134–45.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Antwerp, Antwerp, Belgium

    Bart Goethals

Authors
  1. Bart Goethals
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bart Goethals .

Editor information

Editors and Affiliations

  1. Georgia Institute of Technology College of Computing, Atlanta, Georgia, USA

    Ling Liu

  2. University of Waterloo School of Computer Science, Waterloo, Ontario, Canada

    M. Tamer Özsu

Section Editor information

  1. School of Computing Science, Simon Fraser Univ., 8888 Univ. Drive, V5A 1S6, Burnaby, British Columbia, Canada

    Jian Pei

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Science+Business Media LLC

About this entry

Cite this entry

Goethals, B. (2017). Apriori Property and Breadth-First Search Algorithms. In: Liu, L., Özsu, M. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4899-7993-3_23-2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4899-7993-3_23-2

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4899-7993-3

  • Online ISBN: 978-1-4899-7993-3

  • eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering

Publish with us

Policies and ethics

Search

Navigation