قارن الطرق

	خوارزمية أبْريوري	التعلم شبه المُشرف	التصويت التجميعي
المجال	تعلم الآلة	تعلم الآلة	تعلم الآلة
العائلة	Machine learning	Machine learning	Machine learning
سنة النشأة	1994	1970s–2006 (formalized)	1990s–2004
صاحب الطريقة	Agrawal, R. & Srikant, R.	Vapnik, V. N. and others (community of researchers, 1970s–2000s)	Lam & Suen; Kuncheva, L. I. (systematic treatment)
النوع	Frequent itemset and association rule mining algorithm	Learning paradigm	Ensemble (combination of multiple classifiers by vote)
المصدر التأسيسي	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.	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
الأسماء البديلة	Apriori, frequent itemset mining, ARL-Apriori, Apriori association mining	SSL, semi-supervised machine learning, transductive learning, label-efficient learning	majority voting classifier, hard voting, soft voting ensemble, plurality voting ensemble
ذات صلة	5	5	5
الملخص	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.	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.