更改

:<math>H(Y|X=x)

:<math>H(Y|X=x)

= -\sum_{y\in\mathcal Y} {\Pr(Y = y|X=x) \log_2{\Pr(Y = y|X=x)}}.</math>

= -\sum_{y\in\mathcal Y} {\Pr(Y = y|X=x) \log_2{\Pr(Y = y|X=x)}}.</math>

Note that <math>\Eta(Y|X)</math> is the result of averaging <math>\Eta(Y|X=x)</math> over all possible values <math>x</math> that <math>X</math> may take. Also, if the above sum is taken over a sample <math>y_1, \dots, y_n</math>, the expected value <math>E_X[ \Eta(y_1, \dots, y_n \mid X = x)]</math> is known in some domains as '''equivocation'''.<ref>{{cite journal|author1=Hellman, M.|author2=Raviv, J.|year=1970|title=Probability of error, equivocation, and the Chernoff bound|journal=IEEE Transactions on Information Theory|volume=16|issue=4|pp=368-372}}</ref>

 

 

Note that H（Y ǀ X） is the result of averaging H（Y ǀ X = x） over all possible values <math>x</math> that <math>X</math> may take. Also, if the above sum is taken over a sample <math>y_1, \dots, y_n</math>, the expected value <math>E_X[ \Eta(y_1, \dots, y_n \mid X = x)]</math> is known in some domains as '''equivocation'''.<ref>{{cite journal|author1=Hellman, M.|author2=Raviv, J.|year=1970|title=Probability of error, equivocation, and the Chernoff bound|journal=IEEE Transactions on Information Theory|volume=16|issue=4|pp=368-372}}</ref>

注意，H（Y ǀ X）是在<math>X</math>可能取的所有可能值<math>x</math>上对H（Y ǀ X = x）求平均值的结果。同样，如果将上述总和接管到样本<math>y_1, \dots, y_n</math>上，则预期值<math>E_X[ \Eta(y_1, \dots, y_n \mid X = x)]</math>在某些领域中会变得不那么明确。<ref>{{cite journal|author1=Hellman, M.|author2=Raviv, J.|year=1970|title=Probability of error, equivocation, and the Chernoff bound|journal=IEEE Transactions on Information Theory|volume=16|issue=4|pp=368-372}}</ref>

注意，H（Y ǀ X）是在<math>X</math>可能取的所有可能值<math>x</math>上对H（Y ǀ X = x）求平均值的结果。同样，如果将上述总和接管到样本<math>y_1, \dots, y_n</math>上，则预期值<math>E_X[ \Eta(y_1, \dots, y_n \mid X = x)]</math>在某些领域中会变得不那么明确。<ref>{{cite journal|author1=Hellman, M.|author2=Raviv, J.|year=1970|title=Probability of error, equivocation, and the Chernoff bound|journal=IEEE Transactions on Information Theory|volume=16|issue=4|pp=368-372}}</ref>