手法を比較

	粒計算（情報粒化）	スペクトラルクラスタリング
分野	ソフトコンピューティング	機械学習
系統	Machine learning	Machine learning
提唱年	1997	2002
提唱者	Lotfi A. Zadeh (information granulation); developed by Pedrycz, Skowron, Yao	Ng, A. Y.; Jordan, M. I.; Weiss, Y.
種類	Framework for multi-granularity information processing	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.	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	NJW spectral clustering, graph Laplacian clustering, normalized spectral clustering, spectral graph clustering
関連	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.	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.