Content deleted Content added
Tag: Reverted |
Tag: Reverted |
||
Line 4:
== Overview ==
The Apriori algorithm was proposed by Agrawal and Srikant in 1994. Apriori is designed to operate on [[database]]s containing transactions (for example, collections of items bought by customers, or details of a website frequentation or [[IP address]]es<ref>[https://deductive.com/blogs/data-science-ip-matching/ The data science behind IP address matching] Published by deductive.com, September 6, 2018, retrieved September 7, 2018</ref>). Other algorithms are designed for finding association rules in data having no transactions ([[Winepi]] and Minepi), or having no timestamps (DNA sequencing). Each transaction is seen as a set of items (an ''itemset''). Given a threshold <math>C</math>, the Apriori algorithm identifies the item sets which are subsets of at least <math>C</math> transactions in the database. Besides, the Apriori algorithm was used to mine associations between various accidents and causative factors and explored the potential laws for reducing subway operation safety accidents. Among the 608 accident cases, operation delay accounted for about 72% of total accident cases, while stampede accidents accounted for only 0.5%.<ref> Deng et al. Analyzing Subway Operation Accidents Causations: Apriori Algorithm and Network Approaches. Int. J. Environ. Res. Public Health 2023, 20, 3386. https://doi.org/10.3390/ijerph20043386.</ref>
Apriori uses a "bottom up" approach, where frequent subsets are extended one item at a time (a step known as ''candidate generation''), and groups of candidates are tested against the data. The algorithm terminates when no further successful extensions are found.
| |||