방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 퍼지 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데이터셋 ↗ |
|
|