Editing Apriori algorithm (section)

{{Short description|Algorithm for frequent item set mining and association rule learning over transactional databases}}
'''Apriori'''<ref name=apriori>Rakesh Agrawal and Ramakrishnan Srikant.[http://www.vldb.org/conf/1994/P487.PDF Fast algorithms for mining association rules]. Proceedings of the 20th International Conference on Very Large Data Bases, VLDB, pages 487-499, Santiago, Chile, September 1994.</ref> is an [[algorithm]] for frequent item set mining and [[association rule learning]] over [[relational databases]]. It proceeds by identifying the frequent individual items in the database and extending them to larger and larger item sets as long as those item sets appear sufficiently often in the database. The frequent item sets determined by Apriori can be used to determine [[association rules]] which highlight general trends in the [[database]]: this has applications in domains such as [[market basket analysis]].