পদ্ধতির তুলনা করুন

	স্পেকট্রাল ক্লাস্টারিং	ডিবিস্ক্যান
ক্ষেত্র	যন্ত্র শিখন	যন্ত্র শিখন
পরিবার	Machine learning	Machine learning
উদ্ভবের বছর	2002	1996
প্রবর্তক	Ng, A. Y.; Jordan, M. I.; Weiss, Y.	Ester, M., Kriegel, H.-P., Sander, J. & Xu, X.
ধরন	Graph-based clustering (spectral method)	Density-based clustering algorithm
মৌলিক উৎস	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.	Ester, M., Kriegel, H.-P., Sander, J. & Xu, X. (1996). A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. Proceedings of the 2nd KDD, 226–231.
অপর নাম	NJW spectral clustering, graph Laplacian clustering, normalized spectral clustering, spectral graph clustering	DBSCAN Kümeleme, density-based clustering, density-based spatial clustering
সম্পর্কিত	5	3
সারসংক্ষেপ	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.	DBSCAN is a density-based clustering algorithm, introduced by Ester, Kriegel, Sander and Xu in 1996, that groups together points lying in dense regions and flags points in sparse regions as noise. It is effective on noisy data and on clusters of irregular, non-spherical shapes.