Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Problems.DataAnalysis/3.3/Evaluators/OnlineMeanAndVarianceCalculator.cs @ 4068

Last change on this file since 4068 was 4068, checked in by swagner, 14 years ago

Sorted usings and removed unused usings in entire solution (#1094)

File size: 2.0 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;
23
24namespace HeuristicLab.Problems.DataAnalysis.Evaluators {
25  public class OnlineMeanAndVarianceCalculator {
26
27    private double m_oldM, m_newM, m_oldS, m_newS;
28    private int n;
29
30    public double Variance {
31      get {
32        return (n > 1) ? m_newS / (n - 1) : 0.0;
33      }
34    }
35
36    public double Mean {
37      get {
38        return (n > 0) ? m_newM : 0.0;
39      }
40    }
41
42    public int Count {
43      get { return n; }
44    }
45
46    public OnlineMeanAndVarianceCalculator() {
47      Reset();
48    }
49
50    public void Reset() {
51      n = 0;
52    }
53
54    public void Add(double x) {
55      if (double.IsNaN(x) || double.IsInfinity(x)) {
56        throw new ArgumentException("Mean and variance are not defined for NaN or infinity elements");
57      } else {
58        n++;
59        // See Knuth TAOCP vol 2, 3rd edition, page 232
60        if (n == 1) {
61          m_oldM = m_newM = x;
62          m_oldS = 0.0;
63        } else {
64          m_newM = m_oldM + (x - m_oldM) / n;
65          m_newS = m_oldS + (x - m_oldM) * (x - m_newM);
66
67          // set up for next iteration
68          m_oldM = m_newM;
69          m_oldS = m_newS;
70        }
71      }
72    }
73  }
74}
Note: See TracBrowser for help on using the repository browser.