Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Problems.DataAnalysis/3.3/Evaluators/SimpleMSEEvaluator.cs @ 3294

Last change on this file since 3294 was 3294, checked in by gkronber, 14 years ago

Added first version of architecture altering operators for ADFs. #290 (Implement ADFs)

File size: 2.7 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2010 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
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
22using System;
23using System.Collections.Generic;
24using System.Linq;
25using System.Text;
26using HeuristicLab.Core;
27using HeuristicLab.Data;
28
29namespace HeuristicLab.Problems.DataAnalysis.Evaluators {
30  public class SimpleMSEEvaluator : SimpleEvaluator {
31
32    public SimpleMSEEvaluator()
33      : base() {
34      QualityParameter.ActualName = "MeanSquaredError";
35    }
36
37    protected override double Apply(DoubleMatrix values) {
38      return Calculate(values);
39    }
40
41    public static double Calculate(IEnumerable<double> original, IEnumerable<double> estimated) {
42      double sse = 0.0;
43      int cnt = 0;
44      var originalEnumerator = original.GetEnumerator();
45      var estimatedEnumerator = estimated.GetEnumerator();
46      while (originalEnumerator.MoveNext() & estimatedEnumerator.MoveNext()) {
47        double e = estimatedEnumerator.Current;
48        double o = originalEnumerator.Current;
49        if (!double.IsNaN(e) && !double.IsInfinity(e) &&
50            !double.IsNaN(o) && !double.IsInfinity(o)) {
51          double error = e - o;
52          sse += error * error;
53          cnt++;
54        }
55      }
56      if (estimatedEnumerator.MoveNext() || originalEnumerator.MoveNext()) {
57        throw new ArgumentException("Number of elements in original and estimated enumeration doesn't match.");
58      } else if (cnt == 0) {
59        throw new ArgumentException("Mean squared errors is not defined for input vectors of NaN or Inf");
60      } else {
61        double mse = sse / cnt;
62        return mse;
63      }
64    }
65
66    public static double Calculate(DoubleMatrix values) {
67      var original = from row in Enumerable.Range(0, values.Rows)
68                     select values[row, ORIGINAL_INDEX];
69      var estimated = from row in Enumerable.Range(0, values.Rows)
70                      select values[row, ORIGINAL_INDEX];
71      return Calculate(original, estimated);
72    }
73  }
74}
Note: See TracBrowser for help on using the repository browser.