Timeline for Optimality in Clustering algorithms and an Optimality guaranteed clustering algorithm
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 28, 2021 at 11:07 | comment | added | Erik | Thank you for your clear answers @Lewian | |
| Apr 28, 2021 at 10:12 | answer | added | gunes | timeline score: 1 | |
| Apr 28, 2021 at 10:02 | comment | added | Christian Hennig | To find the global optimum of a given objective function (such as the k-means one) is a different issue, see your other question. But for clustering in general there is no generally accepted best objective function. | |
| Apr 28, 2021 at 9:54 | comment | added | Christian Hennig | What do you mean by "the optimal solution"? Different methods imply different concepts of what a good clustering is, so they will find different solutions, which often all have their own merits. There is no such thing as a general definition of what an "optimal clustering" means. You may want to read this: arxiv.org/abs/1503.02059 | |
| Apr 27, 2021 at 6:33 | review | First posts | |||
| Apr 27, 2021 at 8:29 | |||||
| Apr 27, 2021 at 6:29 | history | asked | Erik | CC BY-SA 4.0 |