قارن الطرق

	الغابات العشوائية	التجميع الطيفي (Spectral Clustering)
المجال	تعلم الآلة	تعلم الآلة
العائلة	Machine learning	Machine learning
سنة النشأة	2001	2002
صاحب الطريقة	Breiman, L.	Ng, A. Y.; Jordan, M. I.; Weiss, Y.
النوع	Ensemble (bagging of decision trees)	Graph-based clustering (spectral method)
المصدر التأسيسي	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.	Ng, A. Y., Jordan, M. I., & Weiss, Y. (2002). On Spectral Clustering: Analysis and an Algorithm. Advances in Neural Information Processing Systems, 14, 849–856.
الأسماء البديلة	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble	NJW spectral clustering, graph Laplacian clustering, normalized spectral clustering, spectral graph clustering
ذات صلة	4	5
الملخص	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.	Spectral Clustering is a graph-based unsupervised learning algorithm, formalized by Ng, Jordan, and Weiss in 2002, that maps data points into a low-dimensional eigenspace derived from the similarity graph's Laplacian before applying k-means. This spectral embedding makes it possible to recover clusters of arbitrary shape — rings, crescents, interleaved spirals — that Euclidean distance-based methods consistently fail to separate.