Porovnat metody

	Asociační pravidla	Algoritmus Apriori	Hlasovací ansámbl
Obor	Strojové učení	Strojové učení	Strojové učení
Rodina	Machine learning	Machine learning	Machine learning
Rok vzniku	1993	1994	1990s–2004
Tvůrce	Agrawal, R., Imielinski, T., & Swami, A.	Agrawal, R. & Srikant, R.	Lam & Suen; Kuncheva, L. I. (systematic treatment)
Typ	Unsupervised pattern discovery	Frequent itemset and association rule mining algorithm	Ensemble (combination of multiple classifiers by vote)
Původní zdroj	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.	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.	Kuncheva, L. I. (2004). Combining Pattern Classifiers: Methods and Algorithms. Wiley-Interscience. ISBN: 978-0-471-21078-8
Další názvy	market basket analysis, association rule mining, frequent itemset mining, affinity analysis	Apriori, frequent itemset mining, ARL-Apriori, Apriori association mining	majority voting classifier, hard voting, soft voting ensemble, plurality voting ensemble
Příbuzné	4	5	5
Shrnutí	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.	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.