Unverified50% confidenceCautionExact time
K-means依赖欧氏距离，在处理高基数类别特征时因维度灾难导致距离度量失效
1
Sources
50%
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
Unverified对高基数类别特征进行独热编码会导致特征空间急剧膨胀，造成维度灾难，使欧氏距离在高维稀疏空间中区分能力急剧下降70% similarUnverified是否将未铺装的越野小径（track）纳入可达范围会显著影响难抵极点的计算结果67% similarUnverified正的最大李雅普诺夫指数意味着相邻轨迹以指数速率发散，使预测时域受到根本性的物理限制64% similarUnverified总变差距离定义为TV(P,Q) = sup_A |P(A) - Q(A)|，相比KL散度具有对称性且取值在0到1之间，与假设检验最优错误率通过Neyman-Pearson引理直接挂钩63% similarUnverifiedThe core loss functions of contrastive learning (such as InfoNCE and NT-Xent) essentially pull the representations of similar samples closer together while pushing the representations of dissimilar samples further apart.62% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/485787API
curl https://kongchang.com/api/v1/knowledge/claims/485787MCP
get_claim(id=485787)