Content deleted Content added
→Merge proposal: oppose |
|||
Line 165:
However, there seems to be some other variant (not so much for clustering?) of Lloyd discussed in that other article, too. --[[User:Chire|Chire]] ([[User talk:Chire|talk]]) 14:28, 26 August 2013 (UTC)
:'''Oppose'''. Lloyd's algorithm is also used for constructing [[Centroidal Voronoi tessellation]]s and for smoothing finite element meshes. Since it has such varied applications, not all of which have anything to do with clustering, I feel that it deserves to be a separate article. And in addition, there are other algorithms than Lloyd for K-means, so the two subjects are not the same even in that context. —[[User:David Eppstein|David Eppstein]] ([[User talk:David Eppstein|talk]]) 16:09, 26 August 2013 (UTC)
:'''Oppose'''. This was proposed in 2007, see the [[Lloyd's algorithm]] talk page for the old discussion. I feel the important distinction is that k-means (at least the k-means article) is an exclusively discrete treatment while Lloyd's algorithm has importance in a continuous setting. The [[Lloyd's algorithm]] article probably needs improvement to better reflect this: the third paragraph of that page discusses the discrete variant while the subsequent description is more of the continuous language. [[User:RuppertsAlgorithm|RuppertsAlgorithm]] ([[User talk:RuppertsAlgorithm|talk]]) 14:03, 27 August 2013 (UTC)
| |||