手法を比較
選択した手法を並べて確認できます。異なる行はハイライト表示されます。
| ファジィC平均クラスタリング (FCM)× | 粒計算（情報粒化）× | |
|---|---|---|
| 分野≠ | 機械学習 | ソフトコンピューティング |
| 系統 | Machine learning | Machine learning |
| 提唱年≠ | 1981 | 1997 |
| 提唱者≠ | Joseph Dunn; James Bezdek | Lotfi A. Zadeh (information granulation); developed by Pedrycz, Skowron, Yao |
| 種類≠ | Soft (fuzzy) partitional clustering | Framework for multi-granularity information processing |
| 原典≠ | Dunn, J. C. (1973). A fuzzy relative of the ISODATA process and its use in detecting compact well-separated clusters. Journal of Cybernetics, 3(3), 32–57. DOI ↗ | 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. DOI ↗ |
| 別名 | FCM, fuzzy clustering, soft k-means, bulanık c-ortalama kümeleme | information granulation, computing with granules, three-way granular computing, tanecikli hesaplama |
| 関連 | 3 | 3 |
| 概要≠ | Fuzzy C-Means is a soft clustering algorithm in which every data point belongs to every cluster with a graded membership between 0 and 1, rather than being assigned to exactly one cluster. Originated by Joseph Dunn in 1973 and generalized by James Bezdek in 1981, it minimizes a fuzzy-weighted within-cluster variance, making it well suited to data whose groups overlap or have no sharp boundaries. | 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. |
| ScholarGateデータセット ↗ |
|
|