1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
|
@Data
public class SilhouetteCoefficient {
private Set<Cluster> clusters;
private List<Point> points = new ArrayList<>();
private List<Point> members = new ArrayList<>();
public SilhouetteCoefficient(Set<Cluster> clusters) {
this.clusters = clusters;
}
public double getEuclideanDis(Point point1, Point point2) {
float[] novelInfo1 = point1.getNovelInfo();
float[] novelInfo2 = point2.getNovelInfo();
double dist_temp = 0;
for (int i = 0; i < novelInfo1.length; i++) {
dist_temp += Math.pow(novelInfo1[i] - novelInfo2[i], 2);
}
return Math.sqrt(dist_temp);
}
public double run() {
int index = clusters.size();
Cluster[] clu = new Cluster[index];
for (Cluster cluster : clusters) {
int clusterId = cluster.getId();
members = cluster.getMembers();
for (Point member : members) {
points.add(member);
}
clu[clusterId] = cluster;
}
double sum = 0.0;
for (int i = 0; i < index; i++) {
double inDis = 0.0;
for (int j = 0; j < clu[i].getMembers().size(); j++) {
inDis = 0;
double[] other = new double[index];
for (int y = 0; y < points.size(); y++) {
double dis = getEuclideanDis(clu[i].getMembers().get(j), points.get(y));
if (i == points.get(y).getClusterId()) {
inDis += dis;
continue;
}
for (int k = 0; k < index; k++) {
if (points.get(y).getClusterId() == k) {
other[k] += dis;
break;
}
}
}
for (int v = 0; v < index; v++) {
int size = clu[v].getMembers().size();
double avg_tmp = other[v] / size;
other[v] = avg_tmp;
}
double compute_b;
double temp;
for (int b = 0; b < index - 1; b++) {
for (int c = 0; c < index - 1 - b; c++) {
if (other[c] > other[c + 1]) {
temp = other[c];
other[c] = other[c + 1];
other[c + 1] = temp;
}
}
}
compute_b = other[1];
int tag = clu[i].getMembers().size();
if (tag == 1) {
tag = 2;
}
double compute_a = inDis / ( tag - 1);
double s = (compute_b - compute_a) / Math.max(compute_a, compute_b);
sum += s;
}
}
return sum / points.size();
}
}
|
