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

	के-मीन्स क्लस्टरिंग	रैंडम फ़ॉरेस्ट
क्षेत्र	मशीन अधिगम	मशीन अधिगम
परिवार	Machine learning	Machine learning
उद्भव वर्ष	1967 (formalized 1982)	2001
प्रवर्तक	MacQueen, J. B.; Lloyd, S. P.	Breiman, L.
प्रकार	Partitional clustering	Ensemble (bagging of decision trees)
मौलिक स्रोत	Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129–137.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
उपनाम	k-means clustering, Lloyd's algorithm, k-means partitioning, hard k-means	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
संबंधित	4	4
सारांश	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.	Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree.