1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2018 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 |
|
---|
22 | using System;
|
---|
23 | using System.Collections.Generic;
|
---|
24 | using System.Linq;
|
---|
25 | using HeuristicLab.Common;
|
---|
26 | using HeuristicLab.Core;
|
---|
27 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
28 |
|
---|
29 | namespace HeuristicLab.Algorithms.DataAnalysis {
|
---|
30 | [StorableClass]
|
---|
31 | [Item("EuclideanDistance", "A norm function that uses Euclidean distance")]
|
---|
32 | public class EuclideanDistance : DistanceBase<IEnumerable<double>> {
|
---|
33 | #region HLConstructors & Cloning
|
---|
34 | [StorableConstructor]
|
---|
35 | protected EuclideanDistance(bool deserializing) : base(deserializing) { }
|
---|
36 | protected EuclideanDistance(EuclideanDistance original, Cloner cloner) : base(original, cloner) { }
|
---|
37 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
38 | return new EuclideanDistance(this, cloner);
|
---|
39 | }
|
---|
40 | public EuclideanDistance() { }
|
---|
41 | #endregion
|
---|
42 |
|
---|
43 | public static double GetDistance(IEnumerable<double> point1, IEnumerable<double> point2) {
|
---|
44 | using (IEnumerator<double> p1Enum = point1.GetEnumerator(), p2Enum = point2.GetEnumerator()) {
|
---|
45 | var sum = 0.0;
|
---|
46 | while (p1Enum.MoveNext() & p2Enum.MoveNext()) {
|
---|
47 | var d = p1Enum.Current - p2Enum.Current;
|
---|
48 | sum += d * d;
|
---|
49 | }
|
---|
50 | if (p1Enum.MoveNext() || p2Enum.MoveNext()) throw new ArgumentException("Euclidean distance not defined on vectors of different length");
|
---|
51 | return Math.Sqrt(sum);
|
---|
52 | }
|
---|
53 | }
|
---|
54 |
|
---|
55 | public override double Get(IEnumerable<double> a, IEnumerable<double> b) {
|
---|
56 | return GetDistance(a, b);
|
---|
57 | }
|
---|
58 | }
|
---|
59 | } |
---|