Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| Правила асоціацій× | Голосувальний ансамбль× | |
|---|---|---|
| Галузь | Машинне навчання | Машинне навчання |
| Родина | Machine learning | Machine learning |
| Рік появи≠ | 1993 | 1990s–2004 |
| Автор методу≠ | Agrawal, R., Imielinski, T., & Swami, A. | Lam & Suen; Kuncheva, L. I. (systematic treatment) |
| Тип≠ | Unsupervised pattern discovery | Ensemble (combination of multiple classifiers by vote) |
| Основоположне джерело≠ | Agrawal, R., Imielinski, T., & Swami, A. (1993). Mining association rules between sets of items in large databases. Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, 207–216. DOI ↗ | Kuncheva, L. I. (2004). Combining Pattern Classifiers: Methods and Algorithms. Wiley-Interscience. ISBN: 978-0-471-21078-8 |
| Інші назви | market basket analysis, association rule mining, frequent itemset mining, affinity analysis | majority voting classifier, hard voting, soft voting ensemble, plurality voting ensemble |
| Пов'язані≠ | 4 | 5 |
| Підсумок≠ | Association rule learning is an unsupervised technique that discovers co-occurrence patterns — 'if X then Y' implications — within large transactional datasets. Originally formalized by Agrawal, Imielinski, and Swami (1993) for supermarket basket analysis, it is now widely applied in e-commerce recommendation, health informatics, bioinformatics, and behavioral research. | 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. |
| ScholarGateНабір даних ↗ |
|
|