blob: 2916be9be6d22f9d541a8e235f76e8481480e930 (
plain)
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
|
package de.lmu.ifi.dbs.elki.utilities.ensemble;
/*
This file is part of ELKI:
Environment for Developing KDD-Applications Supported by Index-Structures
Copyright (C) 2015
Ludwig-Maximilians-Universität München
Lehr- und Forschungseinheit für Datenbanksysteme
ELKI Development Team
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU Affero General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Affero General Public License for more details.
You should have received a copy of the GNU Affero General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
/**
* Simple combination rule, by taking the minimum.
*
* @author Erich Schubert
* @since 0.5.0
*/
public class EnsembleVotingMin implements EnsembleVoting {
/**
* Constructor.
*/
public EnsembleVotingMin() {
// empty
}
@Override
public double combine(double[] scores) {
return combine(scores, scores.length);
}
@Override
public double combine(double[] scores, int count) {
double min = scores[0];
for (int i = 1; i < count; i++) {
if (scores[i] < min) {
min = scores[i];
}
}
return min;
}
}
|
