השוואת שיטות

	מחשוב גרנולרי (גרנולציה של מידע)	אשכול K-Means	אשכול ספקטרלי
תחום	מחשוב רך	למידת מכונה	למידת מכונה
משפחה	Machine learning	Machine learning	Machine learning
שנת המקור	1997	1967	2002
הוגה השיטה	Lotfi A. Zadeh (information granulation); developed by Pedrycz, Skowron, Yao	MacQueen, J.	Ng, A. Y.; Jordan, M. I.; Weiss, Y.
סוג	Framework for multi-granularity information processing	Partitional clustering (centroid-based)	Graph-based clustering (spectral method)
מקור מכונן	Zadeh, L. A. (1997). Toward a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic. Fuzzy Sets and Systems, 90(2), 111–127.	MacQueen, J. (1967). Some Methods for Classification and Analysis of Multivariate Observations. Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, 1, 281–297.	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.
כינויים	information granulation, computing with granules, three-way granular computing, tanecikli hesaplama	K-Ortalamalar Kümeleme, k-ortalamalar kümeleme, k-means, centroid clustering	NJW spectral clustering, graph Laplacian clustering, normalized spectral clustering, spectral graph clustering
קשורות	3	3	5
תקציר	Granular computing is a problem-solving paradigm that processes information in 'granules' — clumps of objects drawn together by indistinguishability, similarity, or functionality — rather than at the level of individual data points. Articulated by Lotfi Zadeh in 1997 as fuzzy information granulation and developed into a broad framework, it provides a unifying umbrella over fuzzy sets, rough sets, and interval methods, letting analysis move to whichever level of detail a problem actually requires.	K-Means Clustering is a centroid-based partitional clustering algorithm, traced to J. MacQueen in 1967, that splits data into k clusters by assigning each observation to its nearest cluster centre. It is widely used for marketing segmentation, customer grouping, and exploratory analysis.	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.