Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Optimization.Operators/3.3/SolutionSimilarityCalculator.cs @ 12075

Last change on this file since 12075 was 12070, checked in by jkarder, 10 years ago

#2332: added SolutionSimilarityCalculator.IsCommutative

File size: 4.2 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2015 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.Linq;
24using HeuristicLab.Common;
25using HeuristicLab.Core;
26using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
27
28namespace HeuristicLab.Optimization.Operators {
29  /// <summary>
30  /// A base class for items that perform similarity calculation between two solutions.
31  /// </summary>
32  [Item("SimilarityCalculator", "A base class for items that perform similarity calculation between two solutions.")]
33  [StorableClass]
34  public abstract class SolutionSimilarityCalculator : Item, ISolutionSimilarityCalculator {
35    protected abstract bool IsCommutative { get; }
36
37    [StorableConstructor]
38    protected SolutionSimilarityCalculator(bool deserializing) : base(deserializing) { }
39    protected SolutionSimilarityCalculator(SolutionSimilarityCalculator original, Cloner cloner) : base(original, cloner) { }
40    protected SolutionSimilarityCalculator() : base() { }
41
42    public double[][] CalculateSolutionCrowdSimilarity(IScope leftSolutionCrowd, IScope rightSolutionCrowd) {
43      if (leftSolutionCrowd == null || rightSolutionCrowd == null)
44        throw new ArgumentException("Cannot calculate similarity because one of the provided crowds or both are null.");
45
46      var leftIndividuals = leftSolutionCrowd.SubScopes;
47      var rightIndividuals = rightSolutionCrowd.SubScopes;
48
49      if (!leftIndividuals.Any() || !rightIndividuals.Any())
50        throw new ArgumentException("Cannot calculate similarity because one of the provided crowds or both are empty.");
51
52      var similarityMatrix = new double[leftIndividuals.Count][];
53      for (int i = 0; i < leftIndividuals.Count; i++) {
54        similarityMatrix[i] = new double[rightIndividuals.Count];
55        for (int j = 0; j < rightIndividuals.Count; j++) {
56          similarityMatrix[i][j] = CalculateSolutionSimilarity(leftIndividuals[i], rightIndividuals[j]);
57        }
58      }
59
60      return similarityMatrix;
61    }
62
63    public double[][] CalculateSolutionCrowdSimilarity(IScope solutionCrowd) {
64      if (solutionCrowd == null)
65        throw new ArgumentException("Cannot calculate similarity because the provided crowd is null.");
66
67      var individuals = solutionCrowd.SubScopes;
68
69      if (!individuals.Any())
70        throw new ArgumentException("Cannot calculate similarity because the provided crowd is empty.");
71
72      var similarityMatrix = new double[individuals.Count][];
73      for (int i = 0; i < individuals.Count; i++) similarityMatrix[i] = new double[individuals.Count];
74
75      if (IsCommutative) {
76        for (int i = 0; i < individuals.Count; i++) {
77          for (int j = i; j < individuals.Count; j++) {
78            similarityMatrix[i][j] = similarityMatrix[j][i] = CalculateSolutionSimilarity(individuals[i], individuals[j]);
79          }
80        }
81      } else {
82        for (int i = 0; i < individuals.Count; i++) {
83          for (int j = i; j < individuals.Count; j++) {
84            similarityMatrix[i][j] = CalculateSolutionSimilarity(individuals[i], individuals[j]);
85            if (i == j) continue;
86            similarityMatrix[j][i] = CalculateSolutionSimilarity(individuals[j], individuals[i]);
87          }
88        }
89      }
90
91      return similarityMatrix;
92    }
93
94    public abstract double CalculateSolutionSimilarity(IScope leftSolution, IScope rightSolution);
95    public abstract bool Equals(IScope x, IScope y);
96    public abstract int GetHashCode(IScope obj);
97  }
98}
Note: See TracBrowser for help on using the repository browser.