Skip to main content
. 2017 Sep 28;17(10):2225. doi: 10.3390/s17102225
Algorithm 1 Entropy Value Method
STEP 1. Select n samples attributes, then xij shall be the value of the i-th sample’s the j-th attribute (i = 1, 2, …, n; j = 1, 2, …, m).
STEP 2. Normalize the index and make the homogeneity data a homogeneity.
Make
xij=|xij|
xij=xijmin{xij,,xnj}max{x1j,jxnj}min{xij,,xnj}
then xij shall be the value of the i-th sample’s j-th attribute (i = 1, 2, …, n; j = 1, 2, …, m).
STEP 3. Calculate the proportion of the i-th sample in j-th attribute.
pij=xiji=1nxij (i =1, , n; j =1, , m)
STEP 4. Calculate the entropy value of the j-th attribute.
ej=ki=1npijln(pij)
k=1ln(n)>0, ej0
STEP 5. Calculate the information gain.
dj=1ej
STEP 6. Calculate the weights of each index.
wj=djj=1mdj
STEP 7. Calculate the comprehensive score of each sample.
si=j=1mwjpij
where,
s is the comprehensive score of each sample when it comes to form a thermocline.
w is the important degree of each attribute for the formation of thermocline.