For constant k, online no-substitution k-means needs Θ(1) centers when n is known or order is random, Θ(log n) centers for random order with n unknown, and Θ(n) centers for adversarial order when k≥2.
Claim 12 F or any c > 1 there is an algorithm that obtains O(c)-approximation with O(logc n) centers, no matter what the order is and even if n is unknown
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Unexpected Effects of Online no-Substitution k-means Clustering
For constant k, online no-substitution k-means needs Θ(1) centers when n is known or order is random, Θ(log n) centers for random order with n unknown, and Θ(n) centers for adversarial order when k≥2.