Timeline for Streaming k-means
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 30, 2021 at 17:59 | history | edited | kjetil b halvorsen♦ |
edited tags
|
|
| Apr 8, 2014 at 23:15 | answer | added | Eraldo P. | timeline score: 1 | |
| Apr 8, 2014 at 17:02 | answer | added | Has QUIT--Anony-Mousse | timeline score: 2 | |
| Apr 8, 2014 at 14:16 | comment | added | ttnphns | Something else. On each iteration, centroids might be recomputed a) after all N objects are assigned to their clusters or b) immediately after each object is assigned. So, in streaming situation, you ought to decide how "often" the cntroids recomputation pass takes place. | |
| Apr 8, 2014 at 12:13 | comment | added | mrgloom | @ttnphns I think they differ only in how to initialize centroids. Or something else? | |
| Apr 8, 2014 at 11:59 | comment | added | ttnphns |
What do you mean by original kmeans? There is several slightly different classic versions of K-means algorithm and they give different results.
|
|
| Apr 8, 2014 at 11:43 | history | asked | mrgloom | CC BY-SA 3.0 |