按年被提到
20012021 · 1 次2026
大模型与语言模型›检索增强与知识库·arXiv:cs/0111054 · cs.CC

The similarity metric

Ming Li, Xin Chen, Xin Li, Bin Ma, Paul Vitanyi · 2001
开始阅读 ↗PDFalphaXiv 讨论
被提及 · 2 人首次 2021-05-05 · 最近 2026-02-12
2不同的人
2活跃月份
2讨论串
7被引(OpenAlex)
arXiv 摘要(候选层不写导读)

A new class of distances appropriate for measuring similarity relations between sequences, say one type of similarity per distance, is studied. We propose a new ``normalized information distance'', based on the noncomputable notion of Kolmogorov complexity, and show that it is in this class and it minorizes every computable distance in the class (that is, it is universal in that it discovers all computable similarities). We demonstrate that it is a metric and call it the {\em similarity metric}. This theory forms the foundation for a new practical tool. To evidence generality and robustness we give two distinctive applications in widely divergent areas using standard compression programs like gzip and GenCompress. First, we compare whole mitochondrial genomes and infer their evolutionary history. This results in a first completely automatic computed whole mitochondrial phylogeny tree. Secondly, we fully automatically compute the language tree of 52 different languages.

候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。

HN 书评

推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及
评论sischoel · 2021-05

“Thanks, I had not seen that dissertation yet, it has much more information than that arxiv link - here is a a pdf of that dissertation that google gave me: https://www.illc.uva.nl/Research/Publications/Dissertations/DS-2007-01.text.pdf Although strictly speaking the idea with the evolutionary trees is a bit older, as far as I know it is from https://arxi…”

Kolmogorov Complexity: Extensions and Applications原评论 ↗
评论jackhurwitz · 2026-02

“I'm doing my PhD in compression-based machine learning, wanted to contribute a few clarifying points. The relationship between probabilistic modeling and lossless compression is very direct. A model that predicts the next symbol with probability p can on average losslessly compress that symbol with the help of an entropy coder (e.g. arithmetic coding) in…”

Text classification with Python 3.14's ZSTD module原评论 ↗