[5649] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[15583] | 3 | * Copyright (C) 2002-2018 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[5649] | 4 | *
|
---|
| 5 | * This file is part of HeuristicLab.
|
---|
| 6 | *
|
---|
| 7 | * HeuristicLab is free software: you can redistribute it and/or modify
|
---|
| 8 | * it under the terms of the GNU General Public License as published by
|
---|
| 9 | * the Free Software Foundation, either version 3 of the License, or
|
---|
| 10 | * (at your option) any later version.
|
---|
| 11 | *
|
---|
| 12 | * HeuristicLab is distributed in the hope that it will be useful,
|
---|
| 13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
---|
| 14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
---|
| 15 | * GNU General Public License for more details.
|
---|
| 16 | *
|
---|
| 17 | * You should have received a copy of the GNU General Public License
|
---|
| 18 | * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
|
---|
| 19 | */
|
---|
| 20 | #endregion
|
---|
| 21 |
|
---|
| 22 | using System;
|
---|
[5942] | 23 | using System.Collections.Generic;
|
---|
[5649] | 24 | using HeuristicLab.Common;
|
---|
| 25 |
|
---|
| 26 | namespace HeuristicLab.Problems.DataAnalysis {
|
---|
[14372] | 27 | public class OnlineAccuracyCalculator : DeepCloneable, IOnlineCalculator {
|
---|
[5649] | 28 |
|
---|
| 29 | private int correctlyClassified;
|
---|
| 30 | private int n;
|
---|
[15831] | 31 | public double Accuracy
|
---|
| 32 | {
|
---|
| 33 | get
|
---|
| 34 | {
|
---|
[5894] | 35 | return correctlyClassified / (double)n;
|
---|
[5649] | 36 | }
|
---|
| 37 | }
|
---|
| 38 |
|
---|
[5942] | 39 | public OnlineAccuracyCalculator() {
|
---|
[5649] | 40 | Reset();
|
---|
| 41 | }
|
---|
| 42 |
|
---|
[14372] | 43 | protected OnlineAccuracyCalculator(OnlineAccuracyCalculator original, Cloner cloner)
|
---|
| 44 | : base(original, cloner) {
|
---|
| 45 | correctlyClassified = original.correctlyClassified;
|
---|
| 46 | n = original.n;
|
---|
| 47 | errorState = original.errorState;
|
---|
[14293] | 48 | }
|
---|
| 49 |
|
---|
[14372] | 50 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 51 | return new OnlineAccuracyCalculator(this, cloner);
|
---|
| 52 | }
|
---|
| 53 |
|
---|
| 54 |
|
---|
[5942] | 55 | #region IOnlineCalculator Members
|
---|
| 56 | private OnlineCalculatorError errorState;
|
---|
[15831] | 57 | public OnlineCalculatorError ErrorState
|
---|
| 58 | {
|
---|
[5894] | 59 | get { return errorState; }
|
---|
| 60 | }
|
---|
[15831] | 61 | public double Value
|
---|
| 62 | {
|
---|
[5649] | 63 | get { return Accuracy; }
|
---|
| 64 | }
|
---|
| 65 | public void Reset() {
|
---|
| 66 | n = 0;
|
---|
| 67 | correctlyClassified = 0;
|
---|
[5942] | 68 | errorState = OnlineCalculatorError.InsufficientElementsAdded;
|
---|
[5649] | 69 | }
|
---|
| 70 |
|
---|
| 71 | public void Add(double original, double estimated) {
|
---|
[5894] | 72 | // ignore cases where original is NaN completly
|
---|
| 73 | if (!double.IsNaN(original)) {
|
---|
| 74 | // increment number of observed samples
|
---|
[5649] | 75 | n++;
|
---|
[5894] | 76 | if (original.IsAlmost(estimated)) {
|
---|
| 77 | // original = estimated = +Inf counts as correctly classified
|
---|
| 78 | // original = estimated = -Inf counts as correctly classified
|
---|
| 79 | correctlyClassified++;
|
---|
| 80 | }
|
---|
[5942] | 81 | errorState = OnlineCalculatorError.None; // number of (non-NaN) samples >= 1
|
---|
[5649] | 82 | }
|
---|
| 83 | }
|
---|
| 84 | #endregion
|
---|
| 85 |
|
---|
[6961] | 86 | public static double Calculate(IEnumerable<double> originalValues, IEnumerable<double> estimatedValues, out OnlineCalculatorError errorState) {
|
---|
| 87 | IEnumerator<double> originalEnumerator = originalValues.GetEnumerator();
|
---|
| 88 | IEnumerator<double> estimatedEnumerator = estimatedValues.GetEnumerator();
|
---|
[5942] | 89 | OnlineAccuracyCalculator accuracyCalculator = new OnlineAccuracyCalculator();
|
---|
[5649] | 90 |
|
---|
| 91 | // always move forward both enumerators (do not use short-circuit evaluation!)
|
---|
[6961] | 92 | while (originalEnumerator.MoveNext() & estimatedEnumerator.MoveNext()) {
|
---|
| 93 | double original = originalEnumerator.Current;
|
---|
| 94 | double estimated = estimatedEnumerator.Current;
|
---|
[5942] | 95 | accuracyCalculator.Add(original, estimated);
|
---|
[5945] | 96 | if (accuracyCalculator.ErrorState != OnlineCalculatorError.None) break;
|
---|
[5649] | 97 | }
|
---|
| 98 |
|
---|
| 99 | // check if both enumerators are at the end to make sure both enumerations have the same length
|
---|
[5945] | 100 | if (accuracyCalculator.ErrorState == OnlineCalculatorError.None &&
|
---|
[6961] | 101 | (estimatedEnumerator.MoveNext() || originalEnumerator.MoveNext())) {
|
---|
[6964] | 102 | throw new ArgumentException("Number of elements in originalValues and estimatedValues enumerations doesn't match.");
|
---|
[5649] | 103 | } else {
|
---|
[5942] | 104 | errorState = accuracyCalculator.ErrorState;
|
---|
| 105 | return accuracyCalculator.Accuracy;
|
---|
[5649] | 106 | }
|
---|
| 107 | }
|
---|
[14293] | 108 |
|
---|
[15831] | 109 | public double CalculateValue(IEnumerable<double> originalValues, IEnumerable<double> estimatedValues, out OnlineCalculatorError errorState) {
|
---|
| 110 | return Calculate(originalValues, estimatedValues, out errorState);
|
---|
| 111 | }
|
---|
[5649] | 112 | }
|
---|
| 113 | }
|
---|