Porovnat metody
Prohlédněte si vybrané metody vedle sebe; řádky, které se liší, jsou zvýrazněny.
| Algoritmus Apriori× | Hlasovací ansámbl× | |
|---|---|---|
| Obor | Strojové učení | Strojové učení |
| Rodina | Machine learning | Machine learning |
| Rok vzniku≠ | 1994 | 1990s–2004 |
| Tvůrce≠ | Agrawal, R. & Srikant, R. | Lam & Suen; Kuncheva, L. I. (systematic treatment) |
| Typ≠ | Frequent itemset and association rule mining algorithm | Ensemble (combination of multiple classifiers by vote) |
| Původní zdroj≠ | 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 ↗ | Kuncheva, L. I. (2004). Combining Pattern Classifiers: Methods and Algorithms. Wiley-Interscience. ISBN: 978-0-471-21078-8 |
| Další názvy | Apriori, frequent itemset mining, ARL-Apriori, Apriori association mining | majority voting classifier, hard voting, soft voting ensemble, plurality voting ensemble |
| Příbuzné | 5 | 5 |
| Shrnutí≠ | 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. | A voting ensemble trains several diverse classifiers independently and combines their predictions by a vote: hard voting picks the class chosen by the most models, while soft voting averages their class-probability estimates, optionally with per-model weights. The combination usually outperforms any individual member, and requires no additional training after the base models are fitted. |
| ScholarGateDatová sada ↗ |
|
|