-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathevaluation.hpp
More file actions
74 lines (67 loc) · 2.33 KB
/
Copy pathevaluation.hpp
File metadata and controls
74 lines (67 loc) · 2.33 KB
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
/*
* Copyright 2024 IntelliStream team (https://github.com/intellistream)
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#ifndef PDSC_EVALUATION_HPP
#define PDSC_EVALUATION_HPP
#include "point.hpp"
#include <map>
std::vector<int> points_to_labels(const std::vector<Point> &points) {
std::vector<int> labels(points.size());
for (int i = 0; i < points.size(); i++) {
labels[i] = points[i].true_clu_id;
}
return labels;
}
std::vector<int> group_by_centers(const std::vector<Point> &points,
const std::vector<Point> ¢ers) {
std::vector<int> predicts(points.size());
for (int i = 0; i < points.size(); i++) {
double min_dist = std::numeric_limits<double>::max();
for (int j = 0; j < centers.size(); j++) {
double dist = points[i].l2_dist(centers[j]);
if (dist < min_dist) {
min_dist = dist;
predicts[i] = j + 1;
}
}
}
return predicts;
}
double evaluate_purity(const std::vector<int> &labels,
const std::vector<int> &predicts, u32 num_true_clusters,
u32 num_pred_clusters) {
if (num_true_clusters > num_pred_clusters) {
return evaluate_purity(predicts, labels, num_pred_clusters,
num_true_clusters);
}
std::vector<std::vector<int>> confusion_matrix(
num_true_clusters + 1, std::vector<int>(num_pred_clusters + 1, 0));
for (int i = 0; i < labels.size(); i++) {
confusion_matrix[labels[i]][predicts[i]]++;
}
double total = 0.0;
for (int i = 1; i <= num_true_clusters; i++) {
double max = 0.0;
for (int j = 1; j < num_pred_clusters; j++) {
if (confusion_matrix[i][j] > max) {
max = confusion_matrix[i][j];
}
}
total += max;
}
// std::cout << "Total Purity: " << total << std::endl;
return total / (double)predicts.size();
}
#endif