From 54ebf1d7b53ba93a2b8143267f69b81bceca3cd7 Mon Sep 17 00:00:00 2001
From: Marcel Kronfeld
For the accuracy evaluation, multiple thresholds may be used. The solutions are then clustered using a distance +of 0.1 times the respective accuracy threshold and a Nelder-Mead-Simplex search is initialized in close vicinity. +As soon as the NMS search fails to produce an improved solution at a distance larger than the accuracy threshold +from the original positions, the solution is considered to be accurate by that threshold.
+Besides the accuracy, a refinement can be performed using several local search methods. After the refinement, +the set is clustered again to filter out solutions which converged on the same optimum during the local search.
The results of the post processing are displayed in the text window (and/or stats output file) and show a coarse diff --git a/src/eva2/server/go/GOStandaloneVersion.java b/src/eva2/server/go/GOStandaloneVersion.java index 2e4469d1..30a907db 100644 --- a/src/eva2/server/go/GOStandaloneVersion.java +++ b/src/eva2/server/go/GOStandaloneVersion.java @@ -411,7 +411,7 @@ public class GOStandaloneVersion implements InterfaceGOStandalone, InterfacePopu if (Thread.interrupted()) throw new InterruptedException(); // write header to file - this.writeToFile(" FitnessCalls\t Best\t Mean\t Worst \t" + BeanInspector.toString(this.m_GO.getProblem().getAdditionalDataHeader(), '\t', false)); + this.writeToFile(" FitnessCalls\t Best\t Mean\t Worst \t" + BeanInspector.toString(this.m_GO.getProblem().getAdditionalDataHeader(), '\t', false, "")); if ((this.m_ContinueFlag) && (this.m_Backup != null)) { this.m_RecentFC += this.m_Backup.getFunctionCalls(); this.m_GO.getOptimizer().getProblem().initProblem();