手法を比較

	粒計算（情報粒化）	形式概念分析 (FCA)	K平均法クラスタリング
分野	ソフトコンピューティング	ソフトコンピューティング	機械学習
系統	Machine learning	Machine learning	Machine learning
提唱年	1997	1982	1967
提唱者	Lotfi A. Zadeh (information granulation); developed by Pedrycz, Skowron, Yao	Rudolf Wille & Bernhard Ganter	MacQueen, J.
種類	Framework for multi-granularity information processing	Lattice-based knowledge representation / concept mining	Partitional clustering (centroid-based)
原典	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.	Wille, R. (1982). Restructuring lattice theory: an approach based on hierarchies of concepts. In I. Rival (Ed.), Ordered Sets (pp. 445–470). Reidel.	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.
別名	information granulation, computing with granules, three-way granular computing, tanecikli hesaplama	FCA, concept lattice analysis, Galois lattice, biçimsel kavram analizi	K-Ortalamalar Kümeleme, k-ortalamalar kümeleme, k-means, centroid clustering
関連	3	3	3
概要	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.	Formal concept analysis derives a hierarchy of concepts from a simple table of which objects have which attributes. Founded by Rudolf Wille in 1982 on lattice theory, it pairs each set of objects with the attributes they all share to form 'formal concepts', then organizes these into a concept lattice — a mathematically grounded, interpretable hierarchy used for knowledge discovery, ontology building, and explainable analysis of categorical data.	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.