Information gain and entropy
摘要:Suppose X can have one of m values… V1, V2, … VmP(X=V1) = p1, .... , P(X=Vm) = pmWhat’s the smallest possible number of bits, on average, per symbol, needed to transmit a stream of symbols drawn from X’s distribution?It’s“High Entropy” means X is from a uniform (boring) distribution“Low Entropy” mea
阅读全文
posted @ 2012-05-08 16:03
浙公网安备 33010602011771号