K-means++
In data mining, k-means++ is an algorithm for choosing the initial values (or "seeds") for the k-means clustering algorithm. It was proposed in 2007 by David Arthur and Sergei Vassilvitskii, as an approximation algorithm for the NP-hard k-means problem—a way of avoiding the sometimes poor clusterings found by the standard k-means algorithm. It is similar to the first of three seeding methods proposed, in independent work, in 2006 by Rafail Ostrovsky, Yuval Rabani, Leonard Schulman and Chaitanya Swamy. (The distribution of the first seed is different.)
Wikipage redirect
Link from a Wikipage to another Wikipage
primaryTopic
K-means++
In data mining, k-means++ is an algorithm for choosing the initial values (or "seeds") for the k-means clustering algorithm. It was proposed in 2007 by David Arthur and Sergei Vassilvitskii, as an approximation algorithm for the NP-hard k-means problem—a way of avoiding the sometimes poor clusterings found by the standard k-means algorithm. It is similar to the first of three seeding methods proposed, in independent work, in 2006 by Rafail Ostrovsky, Yuval Rabani, Leonard Schulman and Chaitanya Swamy. (The distribution of the first seed is different.)
has abstract
In data mining, k-means++ is a ...... the first seed is different.)
@en
Link from a Wikipage to an external page
Wikipage page ID
22,342,107
page length (characters) of wiki page
Wikipage revision ID
1,013,985,307
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
hypernym
type
comment
In data mining, k-means++ is a ...... the first seed is different.)
@en
label
K-means++
@en