방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 퍼지 C-평균 군집화 (FCM)× | K-평균 군집화× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 1981 | 1967 |
| 창시자≠ | Joseph Dunn; James Bezdek | MacQueen, J. |
| 유형≠ | Soft (fuzzy) partitional clustering | Partitional clustering (centroid-based) |
| 원전≠ | 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 ↗ | 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. link ↗ |
| 별칭 | FCM, fuzzy clustering, soft k-means, bulanık c-ortalama kümeleme | K-Ortalamalar Kümeleme, k-ortalamalar kümeleme, k-means, centroid clustering |
| 관련 | 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. | 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. |
| ScholarGate데이터셋 ↗ |
|
|