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
|
package de.lmu.ifi.dbs.elki.result.outlier;
/*
This file is part of ELKI:
Environment for Developing KDD-Applications Supported by Index-Structures
Copyright (C) 2013
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/>.
*/
/**
* Class to signal a value-inverted outlier score, i.e. low values are outliers.
*
* @author Erich Schubert
*/
public class InvertedOutlierScoreMeta extends BasicOutlierScoreMeta {
/**
* Constructor with all values.
*
* @param actualMinimum Actual minimum in data
* @param actualMaximum Actual maximum in data
* @param theoreticalMinimum Theoretical minimum of algorithm
* @param theoreticalMaximum Theoretical maximum of algorithm
* @param theoreticalBaseline Theoretical Baseline
*/
public InvertedOutlierScoreMeta(double actualMinimum, double actualMaximum, double theoreticalMinimum, double theoreticalMaximum, double theoreticalBaseline) {
super(actualMinimum, actualMaximum, theoreticalMinimum, theoreticalMaximum, theoreticalBaseline);
}
/**
* Constructor with range values.
*
* @param actualMinimum Actual minimum in data
* @param actualMaximum Actual maximum in data
* @param theoreticalMinimum Theoretical minimum of algorithm
* @param theoreticalMaximum Theoretical maximum of algorithm
*/
public InvertedOutlierScoreMeta(double actualMinimum, double actualMaximum, double theoreticalMinimum, double theoreticalMaximum) {
super(actualMinimum, actualMaximum, theoreticalMinimum, theoreticalMaximum);
}
/**
* Constructor with actual range only.
*
* @param actualMinimum Actual minimum in data
* @param actualMaximum Actual maximum in data
*/
public InvertedOutlierScoreMeta(double actualMinimum, double actualMaximum) {
super(actualMinimum, actualMaximum);
}
@Override
public double normalizeScore(double value) {
double center = 0.0;
if (!Double.isNaN(theoreticalBaseline) && !Double.isInfinite(theoreticalBaseline)) {
center = theoreticalBaseline;
} else if (!Double.isNaN(theoreticalMaximum) && !Double.isInfinite(theoreticalMaximum)) {
center = theoreticalMaximum;
} else if (!Double.isNaN(actualMaximum) && !Double.isInfinite(actualMaximum)) {
center = actualMaximum;
}
if (value > center) {
return 0.0;
}
double min = Double.NaN;
if (!Double.isNaN(theoreticalMinimum) && !Double.isInfinite(theoreticalMinimum)) {
min = theoreticalMinimum;
}
else if (!Double.isNaN(actualMinimum) && !Double.isInfinite(actualMinimum)) {
min = actualMinimum;
}
if (!Double.isNaN(min) && !Double.isInfinite(min) && min != center) {
return (center - value) / (center - min);
}
return center - value;
}
}
|
