Comparer des méthodes
Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.
| Regroupement flou par centroïdes (Fuzzy C-Means, FCM)× | Regroupement par K-moyennes× | |
|---|---|---|
| Domaine | Apprentissage automatique | Apprentissage automatique |
| Famille | Machine learning | Machine learning |
| Année d'origine≠ | 1981 | 1967 |
| Auteur d'origine≠ | Joseph Dunn; James Bezdek | MacQueen, J. |
| Type≠ | Soft (fuzzy) partitional clustering | Partitional clustering (centroid-based) |
| Source fondatrice≠ | 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 ↗ |
| Alias | FCM, fuzzy clustering, soft k-means, bulanık c-ortalama kümeleme | K-Ortalamalar Kümeleme, k-ortalamalar kümeleme, k-means, centroid clustering |
| Apparentées | 3 | 3 |
| Résumé≠ | 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. |
| ScholarGateJeu de données ↗ |
|
|