Unverified50% confidenceFactExact time
K-means is an unsupervised learning algorithm that iteratively initializes centroids, assigns data points to the nearest centroid, and recomputes the group mean as the new centroid, until the centroids no longer move significantly.
1
Sources
50%
Confidence
Long-term
Relevance
10/12/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedK-means对初始簇中心敏感，K-means++通过概率化初始化缓解这一问题74% similarUnverifiedThe K-means clustering algorithm is essentially a specific instance of coordinate descent68% similarUnverifiedLISCO (Learned Iterative Solver for Constrained Optimization) learns to predict primal-dual step sizes to iteratively approach a solution satisfying KKT optimality conditions, rather than directly predicting the final control output.66% similarUnverified前向KL散度D(p||q)倾向于让q覆盖p的所有可能性（mode-covering），是变分推断和监督学习中最常用的形式66% similarUnverifiedThe k-partition probing mechanism randomly divides committed token positions into k non-overlapping subsets, re-masking one subset at a time and performing one forward inference pass.66% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1003183API
curl https://kongchang.com/api/v1/knowledge/claims/1003183MCP
get_claim(id=1003183)