https://machinelearningmastery.com/what-is-information-entropy/ A Gentle Introduction to Information Entropy 「A foundational concept from information is the quantification of the amount of information in things like events, random variables, and distributions.」 Calculate the Information for an Event Quantifying information is the foundation of the field of information theory. The intuition behind quantifying information is the idea of measuring how much surprise there is in an event. Those events that are rare (low probability) are more surprising and therefore have more information than those events that are common (high probability). Low Probability Event: High Information (surprising). High Probability Event: Low Information (unsurprising). The basic intuition behind information theory is that learning that an unlikely event has occurred is more informative than learning that a likely event has occurred. Rare events are more uncertain or more surprising and require more information to represent them than common events. We can calculate the amount of information there is in an event using the probability of the event. This is called “Shannon information,” “self-information,” or simply the “information,” and can be calculated for a discrete event x as follows: information(x) = -log( p(x) ) Where log() is the base-2 logarithm and p(x) is the probability of the event x. The choice of the base-2 logarithm means that the units of the information measu re is in bits (binary digits). This can be directly interpreted in the informati on processing sense as the number of bits required to represent the event. h(x) = -log( p(x) ) The negative sign ensures that the result is always positive or zero. Information will be zero when the probability of an event is 1.0 or a certainty, e.g. there is no surprise. Calculate the Entropy for a Random Variable We can also quantify how much information there is in a random variable. For example, if we wanted to calculate the information for a random variable X with probability distribution p, this might be written as a function H(); for example: H(X) In effect, calculating the information for a random variable is the same as calculating the information for the probability distribution of the events for the random variable. Calculating the information for a random variable is called “information entropy,” “Shannon entropy,” or simply “entropy“. It is related to the idea of entropy from physics by analogy, in that both are concerned with uncertainty. The intuition for entropy is that it is the average number of bits required to represent or transmit an event drawn from the probability distribution for the random variable. … the Shannon entropy of a distribution is the expected amount of information in an event drawn from that distribution. It gives a lower bound on the number of bits […] needed on average to encode symbols drawn from a distribution P. — Page 74, Deep Learning, 2016. 最後一次回槓精了 你們要繼續跳針請便 ----- Sent from JPTT on my iPhone --

※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 111.235.192.33 (臺灣) ※ 文章網址: https://webptt.com/m.aspx?n=bbs/DummyHistory/M.1695701266.A.F18.html ※ 編輯: innominate (59.124.23.93 臺灣), 09/26/2023 12:14:10