השוואת שיטות
סקרו את השיטות שבחרתם זו לצד זו; שורות שבהן יש הבדל מודגשות.
| אשכולות Fuzzy C-Means (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מערך נתונים ↗ |
|
|