Timeline for Notion of cluster centers and cluster comparison in Density Based Algorithms
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 1, 2019 at 11:46 | vote | accept | MikEKOU | ||
| Jul 18, 2017 at 6:44 | comment | added | Has QUIT--Anony-Mousse | The medoid is similarly expensive to compute. | |
| Jul 17, 2017 at 20:00 | comment | added | MikEKOU | I see, that does sound computation heavy though. Anyway thanks for your answers regarding the topic. | |
| Jul 17, 2017 at 19:50 | comment | added | Has QUIT--Anony-Mousse | Compute all N x M distances, take the average. | |
| Jul 17, 2017 at 19:14 | comment | added | MikEKOU | Thank you for your answer, indeed after a bit of research medoid is what made the most sense for me. When you refer to pairwise comparison can you give me an example because it can be the case that the clusters don't have the same size. | |
| Jul 17, 2017 at 18:51 | history | answered | Has QUIT--Anony-Mousse | CC BY-SA 3.0 |