Unverified50% confidenceFactExact time
Wasserstein distance bypasses the label permutation problem by representing clustering partitions as probability measures and solving an optimal transport problem, measuring the minimum total cost required to transport one partition into another.
1
Sources
50%
Confidence
Long-term
Relevance
10/12/2026
First Seen
Sources
Related Entities
Related Claims
Unverified分步推理本质上是将复杂条件概率分解为多个较简单条件概率的乘积，降低每步预测难度69% similarUnverified切片Wasserstein距离（SWD）通过将高维分布随机投影到大量一维方向上，在每个方向计算Wasserstein距离后取平均，从而降低计算复杂度69% similarUnverifiedWriting only one position or conditionally independent positions per step can theoretically match the distribution exactly, while writing more dependent positions causes errors to accumulate.68% similarUnverifiedProduct quantization converts distance computation from per-dimension floating-point operations into integer table-lookup accumulation using precomputed codebook distances, thereby improving batch retrieval throughput66% similarUnverifiedThe deconvolution problem can be formulated as a division operation in the frequency domain, and its difficulty depends on the decay rate of the characteristic function of the error distribution66% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1001420API
curl https://kongchang.com/api/v1/knowledge/claims/1001420MCP
get_claim(id=1001420)