Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Apriori-algoritmen× | Boosting× | |
|---|---|---|
| Ämnesområde | Maskininlärning | Maskininlärning |
| Familj | Machine learning | Machine learning |
| Ursprungsår≠ | 1994 | 1990–1997 |
| Upphovsperson≠ | Agrawal, R. & Srikant, R. | Schapire, R. E.; Freund, Y. |
| Typ≠ | Frequent itemset and association rule mining algorithm | Sequential ensemble (iterative reweighting) |
| Ursprungskälla≠ | Agrawal, R. & Srikant, R. (1994). Fast algorithms for mining association rules. Proceedings of the 20th International Conference on Very Large Data Bases (VLDB), 487–499. link ↗ | Freund, Y. & Schapire, R. E. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1), 119–139. DOI ↗ |
| Alias | Apriori, frequent itemset mining, ARL-Apriori, Apriori association mining | AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble |
| Närliggande≠ | 5 | 6 |
| Sammanfattning≠ | The Apriori algorithm, introduced by Agrawal and Srikant in 1994, is the foundational method for discovering frequent itemsets and association rules in transactional databases. It uses a breadth-first, level-wise search guided by the anti-monotone property of support to efficiently enumerate all item combinations that co-occur above a user-set minimum threshold, then extracts interpretable if-then rules from those patterns. | Boosting is a sequential ensemble technique that converts many simple, barely-better-than-chance learners into a single highly accurate model by repeatedly focusing training on the examples that previous learners got wrong, then combining all learners with weights proportional to their individual accuracy. |
| ScholarGateDatamängd ↗ |
|
|