विधियों की तुलना करें

	Apriori Algorithm	के-मीन्स क्लस्टरिंग	मतदान एनसेंबल
क्षेत्र	मशीन अधिगम	मशीन अधिगम	मशीन अधिगम
परिवार	Machine learning	Machine learning	Machine learning
उद्भव वर्ष	1994	1967 (formalized 1982)	1990s–2004
प्रवर्तक	Agrawal, R. & Srikant, R.	MacQueen, J. B.; Lloyd, S. P.	Lam & Suen; Kuncheva, L. I. (systematic treatment)
प्रकार	Frequent itemset and association rule mining algorithm	Partitional clustering	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.	Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129–137.	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	k-means clustering, Lloyd's algorithm, k-means partitioning, hard k-means	majority voting classifier, hard voting, soft voting ensemble, plurality voting ensemble
संबंधित	5	4	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.	K-means is a classic unsupervised partitional clustering algorithm that divides a dataset into K non-overlapping groups by iteratively assigning each observation to its nearest centroid and updating centroids as the mean of their assigned points. It is one of the most widely used exploratory tools in machine learning and data analysis.	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.