השוואת שיטות

	מחשוב גרנולרי (גרנולציה של מידע)	אשכול K-Means
תחום	מחשוב רך	למידת מכונה
משפחה	Machine learning	Machine learning
שנת המקור	1997	1967
הוגה השיטה	Lotfi A. Zadeh (information granulation); developed by Pedrycz, Skowron, Yao	MacQueen, J.
סוג	Framework for multi-granularity information processing	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.	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	K-Ortalamalar Kümeleme, k-ortalamalar kümeleme, k-means, centroid clustering
קשורות	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.	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.