“It does indeed sound like it’s written the wrong way around. Random information = high entropy. A common word is therefore low entropy. Here’s a good analogy I found: > Informally, the amount of information in an email is proportional to the amount of “surprise” its reading causes. For example, if an email is simply a repeat of an earlier email, then i…”
按年被提到
20142021 · 3 次2026
Understanding Shannon's Entropy metric for Information
Sriram Vajapeyam · 2014
被提及 · 3 人首次 2021-01-27 · 最近 2021-10-07
3不同的人
2活跃月份
2讨论串
51被引(OpenAlex)
arXiv 摘要(候选层不写导读)
Shannon's metric of "Entropy" of information is a foundational concept of information theory. This article is a primer for novices that presents an intuitive way of understanding, remembering, and/or reconstructing Shannon's Entropy metric for information.
候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。
HN 书评
推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及评论refactor_master · 2021-01
评论dswilkerson · 2021-10
“I read your arxiv.org article on Shannon Entropy: https://arxiv.org/abs/1405.2061 What I am amazed at is that arxiv accepted this. I submitted exactly the same argument to them on 27 Jan 2009. They rejected it. Here it is on my home page: http://dsw.users.sonic.net/entropy.html Entropy is (1) the expected value of (2) the information of an event. You …”
被提交为 story · 1 次
- Understanding Shannon's Entropy metric for Information [pdf] ↗micouay · 2021-10-07 · 98 分