信息熵的计算公式:
H(x)=−∑i=1np(i)log2p(i)H(x) = {\rm{ - }}\sum\limits_{i = 1}^{\rm{n}} {p(i)\log _2 p(i)}H(x)=−i=1∑np(i)log2p(i)
X
a1a_1a1
a2a_2a2
a3a_3a3
a4a_4a4
P(X)
12\frac{1}{2}21
14\frac{1}{4}41
18\frac{1}{8}81
18\frac{1}{8}81class test {
public static void main(String[] args) {
double []p = {1.0/2, 1.0/4, 1.0/8, 1.0/8};
double H = 0;
for(int i = 0; i < p.length; i++) {
H += -p[i] * (Math.log(p[i]) / Math.log(2));
}
System.out.println(H);
}
}
实战演练:
一字符串由大写字母、小写字母和数字组成,求该字符串的信息熵。(本人水平有限,精通《信息论》的朋友可以帮我修改一下题目。)
class test {
public static void main(String[] args) {
String str = "GWPm29shF56Ye"
int uppercase = 0;
int lowercase = 0;
int num = 0;
int len = str.length();//计算字符串总长度
for (int i = 0; i < len; i++) {
if(str.charAt(i) >= 'A' && str.charAt(i) <= 'Z') {
uppercase++; //统计大写字母个数
}else if(str.charAt(i) >= 'a' && str.charAt(i) <= 'z') {
lowercase++; //统计小写字母个数
}else {
num++; //统计小写字母个数
}
}
double p1 = 1.0*uppercase / len; //大写字母出现的概率p1
double p2 = 1.0*lowercase / len; //小写字母出现的概率p2
double p3 = 1.0*num / len; //数字出现的概率p3
double []p = {p1, p2, p3};
double H = 0;
for (int i = 0; i < p.length; i++) {
H += -p[i] * (Math.log(p[i]) / Math.log(2));
}
System.out.println(H);
}
}
标签:java,计算,int,String,信息熵,str,frac,1.0,log
来源: https://blog.csdn.net/tengfei0973/article/details/101038339