Jämför metoder

	Associeringsregler	Semi-övervakad inlärning	Röstningsensemble
Ämnesområde	Maskininlärning	Maskininlärning	Maskininlärning
Familj	Machine learning	Machine learning	Machine learning
Ursprungsår	1993	1970s–2006 (formalized)	1990s–2004
Upphovsperson	Agrawal, R., Imielinski, T., & Swami, A.	Vapnik, V. N. and others (community of researchers, 1970s–2000s)	Lam & Suen; Kuncheva, L. I. (systematic treatment)
Typ	Unsupervised pattern discovery	Learning paradigm	Ensemble (combination of multiple classifiers by vote)
Ursprungskälla	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.	Chapelle, O., Scholkopf, B., & Zien, A. (Eds.) (2006). Semi-Supervised Learning. MIT Press. ISBN: 978-0-262-03358-9	Kuncheva, L. I. (2004). Combining Pattern Classifiers: Methods and Algorithms. Wiley-Interscience. ISBN: 978-0-471-21078-8
Alias	market basket analysis, association rule mining, frequent itemset mining, affinity analysis	SSL, semi-supervised machine learning, transductive learning, label-efficient learning	majority voting classifier, hard voting, soft voting ensemble, plurality voting ensemble
Närliggande	4	5	5
Sammanfattning	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.	Semi-supervised learning (SSL) is a machine learning paradigm that trains models using a small set of labeled examples together with a much larger pool of unlabeled data. By leveraging the structure inherent in unlabeled data, SSL achieves accuracy closer to fully supervised models while requiring far fewer costly manual labels — making it practical when labeling is expensive, slow, or resource-constrained.	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.