Unverified60% confidenceFactExact time
K-means assumes clusters are convex and isotropic, performs poorly on non-spherical distributions, and is extremely sensitive to outliers.
2
Sources
60%
Confidence
Long-term
Relevance
7/11/2026
First Seen
Sources
K-means vs Random Forest: How to Choose the Right Algorithm from First Principles
redditr/learnmachinelearning7/10/2026
Related Claims
UnverifiedDue to its asymmetry, KL divergence does not satisfy the triangle inequality of a distance metric and is strictly referred to as a divergence rather than a distance.66% similarUnverifiedEach hexagonal cell in H3 has 6 neighboring cells, and the neighborhood relationship is more uniform than rectangular latitude-longitude queries.55% similarUnverified分形是一类具有自相似性、非整数分形维数的复杂几何对象，其分形维数（Hausdorff维数）可以取非整数值55% similarUnverifiedThe vast majority of embedding models are anisotropic—their vectors are not uniformly distributed across a hypersphere but are instead clustered within a narrow cone, causing the cosine similarity of unrelated texts to be inflated.54% similarUnverifiedGJK determines intersection by iteratively computing the Minkowski difference of two convex shapes, with the cost of each iteration positively correlated with the number of vertices in the shapes.54% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/480314API
curl https://kongchang.com/api/v1/knowledge/claims/480314MCP
get_claim(id=480314)