Free cookie consent management tool by TermsFeed Policy Generator

source: branches/2701_MemPRAlgorithm/HeuristicLab.Encodings.LinearLinkageEncoding/3.4/SimilarityCalculators/HammingSimilarityCalculator.cs @ 17717

Last change on this file since 17717 was 14496, checked in by abeham, 8 years ago

#2701:

  • Reusing similiarty calculator in BinaryMemPR
  • Fixing distance calculation for linear linkage and LinearLinkageMemPR
  • Small changes to base algorithm
  • Added biased model trainer for permutation (rank and fitness)
  • Fixing best known quality calculation for GCP
File size: 2.5 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 HeuristicLab.Common;
24using HeuristicLab.Core;
25using HeuristicLab.Optimization.Operators;
26using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
27
28namespace HeuristicLab.Encodings.LinearLinkageEncoding {
29  [Item("Hamming Similarity Calculator for LinearLinkage", "Calculates the hamming similarity for two linear linkage encoded solutions.")]
30  [StorableClass]
31  public sealed class HammingSimilarityCalculator : SingleObjectiveSolutionSimilarityCalculator {
32
33    protected override bool IsCommutative {
34      get { return true; }
35    }
36
37    [StorableConstructor]
38    private HammingSimilarityCalculator(bool deserializing) : base(deserializing) { }
39    private HammingSimilarityCalculator(HammingSimilarityCalculator original, Cloner cloner) : base(original, cloner) { }
40    public HammingSimilarityCalculator() { }
41
42    public override IDeepCloneable Clone(Cloner cloner) {
43      return new HammingSimilarityCalculator(this, cloner);
44    }
45
46    public static double CalculateSimilarity(LinearLinkage left, LinearLinkage right) {
47      if (left.Length != right.Length) throw new ArgumentException("Comparing encodings of unequal length");
48      var similarity = 0;
49      for (var i = 0; i < left.Length; i++) {
50        if (left[i] == right[i]) similarity++;
51      }
52      return similarity / (double)left.Length;
53    }
54
55    public override double CalculateSolutionSimilarity(IScope leftSolution, IScope rightSolution) {
56      var left = leftSolution.Variables[SolutionVariableName].Value as LinearLinkage;
57      var right = rightSolution.Variables[SolutionVariableName].Value as LinearLinkage;
58
59      return CalculateSimilarity(left, right);
60    }
61  }
62}
Note: See TracBrowser for help on using the repository browser.