[3452] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[5445] | 3 | * Copyright (C) 2002-2011 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[3452] | 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;
|
---|
[2428] | 23 | using System.Collections.Generic;
|
---|
| 24 | using System.Linq;
|
---|
[4722] | 25 | using HeuristicLab.Common;
|
---|
[2428] | 26 | using HeuristicLab.Core;
|
---|
| 27 | using HeuristicLab.Data;
|
---|
[3452] | 28 | using HeuristicLab.Parameters;
|
---|
[4722] | 29 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
[2428] | 30 |
|
---|
[3452] | 31 | namespace HeuristicLab.Problems.DataAnalysis.Evaluators {
|
---|
| 32 | public class SimpleRSquaredEvaluator : SimpleEvaluator {
|
---|
| 33 | public ILookupParameter<DoubleValue> RSquaredParameter {
|
---|
| 34 | get { return (ILookupParameter<DoubleValue>)Parameters["RSquared"]; }
|
---|
| 35 | }
|
---|
[4722] | 36 | [StorableConstructor]
|
---|
| 37 | protected SimpleRSquaredEvaluator(bool deserializing) : base(deserializing) { }
|
---|
| 38 | protected SimpleRSquaredEvaluator(SimpleRSquaredEvaluator original, Cloner cloner)
|
---|
| 39 | : base(original, cloner) {
|
---|
| 40 | }
|
---|
| 41 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 42 | return new SimpleRSquaredEvaluator(this, cloner);
|
---|
| 43 | }
|
---|
[3452] | 44 | public SimpleRSquaredEvaluator() {
|
---|
| 45 | Parameters.Add(new LookupParameter<DoubleValue>("RSquared", "The squared Pearson's Product Moment Correlation (R²) of estimated values and original values."));
|
---|
[2428] | 46 | }
|
---|
| 47 |
|
---|
[3452] | 48 | protected override void Apply(DoubleMatrix values) {
|
---|
| 49 | var original = from i in Enumerable.Range(0, values.Rows)
|
---|
| 50 | select values[i, ORIGINAL_INDEX];
|
---|
| 51 | var estimated = from i in Enumerable.Range(0, values.Rows)
|
---|
| 52 | select values[i, ESTIMATION_INDEX];
|
---|
| 53 | RSquaredParameter.ActualValue = new DoubleValue(Calculate(original, estimated));
|
---|
[2428] | 54 | }
|
---|
| 55 |
|
---|
[3452] | 56 |
|
---|
| 57 | public static double Calculate(IEnumerable<double> original, IEnumerable<double> estimated) {
|
---|
[3996] | 58 | var onlinePearsonRSquaredEvaluator = new OnlinePearsonsRSquaredEvaluator();
|
---|
[3452] | 59 | var originalEnumerator = original.GetEnumerator();
|
---|
| 60 | var estimatedEnumerator = estimated.GetEnumerator();
|
---|
| 61 |
|
---|
| 62 | while (originalEnumerator.MoveNext() & estimatedEnumerator.MoveNext()) {
|
---|
[3996] | 63 | double e = estimatedEnumerator.Current;
|
---|
| 64 | double o = originalEnumerator.Current;
|
---|
| 65 | onlinePearsonRSquaredEvaluator.Add(o, e);
|
---|
[2428] | 66 | }
|
---|
[3452] | 67 | if (estimatedEnumerator.MoveNext() || originalEnumerator.MoveNext()) {
|
---|
| 68 | throw new ArgumentException("Number of elements in original and estimated enumeration doesn't match.");
|
---|
| 69 | } else {
|
---|
[3996] | 70 | return onlinePearsonRSquaredEvaluator.RSquared;
|
---|
[2844] | 71 | }
|
---|
[2428] | 72 | }
|
---|
| 73 | }
|
---|
| 74 | }
|
---|