Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/HeuristicLab.Algorithms.DataAnalysis/3.4/TSNE/Distances/EuclideanDistance.cs @ 17313

Last change on this file since 17313 was 17180, checked in by swagner, 5 years ago

#2875: Removed years in copyrights

File size: 2.3 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 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 HeuristicLab.Common;
25using HeuristicLab.Core;
26using HEAL.Attic;
27
28namespace HeuristicLab.Algorithms.DataAnalysis {
29  [StorableType("1D3FE1D5-E524-4DEC-B845-34C940F5BA61")]
30  [Item("EuclideanDistance", "A norm function that uses Euclidean distance")]
31  public class EuclideanDistance : DistanceBase<IEnumerable<double>> {
32    #region HLConstructors & Cloning
33    [StorableConstructor]
34    protected EuclideanDistance(StorableConstructorFlag _) : base(_) { }
35    protected EuclideanDistance(EuclideanDistance original, Cloner cloner) : base(original, cloner) { }
36    public override IDeepCloneable Clone(Cloner cloner) {
37      return new EuclideanDistance(this, cloner);
38    }
39    public EuclideanDistance() { }
40    #endregion
41
42    public static double GetDistance(IEnumerable<double> point1, IEnumerable<double> point2) {
43      using (IEnumerator<double> p1Enum = point1.GetEnumerator(), p2Enum = point2.GetEnumerator()) {
44        var sum = 0.0;
45        while (p1Enum.MoveNext() & p2Enum.MoveNext()) {
46          var d = p1Enum.Current - p2Enum.Current;
47          sum += d * d;
48        }
49        if (p1Enum.MoveNext() || p2Enum.MoveNext()) throw new ArgumentException("Euclidean distance not defined on vectors of different length");
50        return Math.Sqrt(sum);
51      }
52    }
53
54    public override double Get(IEnumerable<double> a, IEnumerable<double> b) {
55      return GetDistance(a, b);
56    }
57  }
58}
Note: See TracBrowser for help on using the repository browser.