source: branches/EfficientGlobalOptimization/HeuristicLab.Algorithms.EGO/InfillCriteria/NeighbourDistance.cs @ 15338

Last change on this file since 15338 was 15338, checked in by bwerth, 5 years ago

#2745 fixed bug concerning new Start and StartAsync methods; passed CancellationToken to sub algorithms

File size: 2.6 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2016 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 HeuristicLab.Algorithms.DataAnalysis;
26using HeuristicLab.Common;
27using HeuristicLab.Core;
28using HeuristicLab.Encodings.RealVectorEncoding;
29using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
30
31// ReSharper disable once CheckNamespace
32namespace HeuristicLab.Algorithms.EGO {
33
34  [StorableClass]
35  [Item("NeighbourDistance", "Exploration by maximizing the distance to the nearest neighbour")]
36  public class NeighbourDistance : InfillCriterionBase {
37
38    private VantagePointTree<IEnumerable<double>> Points;
39    #region Constructors, Serialization and Cloning
40    [StorableConstructor]
41    protected NeighbourDistance(bool deserializing) : base(deserializing) { }
42    protected NeighbourDistance(NeighbourDistance original, Cloner cloner) : base(original, cloner) { }
43    public NeighbourDistance() { }
44    public override IDeepCloneable Clone(Cloner cloner) { return new NeighbourDistance(this, cloner); }
45    #endregion
46
47    public override double Evaluate(RealVector vector) {
48      if (Points == null) Points = CreateTree();
49      IList<IEnumerable<double>> neighbours;
50      IList<double> distances;
51      Points.Search(vector, 1, out neighbours, out distances);
52      return distances[0];
53    }
54
55    public override void Initialize() {
56      Points = CreateTree();
57    }
58
59    private VantagePointTree<IEnumerable<double>> CreateTree() {
60      var data = RegressionSolution.ProblemData.Dataset;
61      var rows = RegressionSolution.ProblemData.AllIndices;
62      var cols = RegressionSolution.ProblemData.AllowedInputVariables;
63      return new VantagePointTree<IEnumerable<double>>(new EuclideanDistance(), rows.Select(r => cols.Select(c => data.GetDoubleValue(c, r)).ToArray()));
64    }
65  }
66}
Note: See TracBrowser for help on using the repository browser.