From 2dba53b6564c3b2663afc52dcb759d883cd4d223 Mon Sep 17 00:00:00 2001 From: Beq Date: Sun, 10 Apr 2022 23:01:33 +0200 Subject: [PATCH 1/2] add standardised output in the console after algorithm executions --- .../ocd/algorithms/AntColonyOptimizationAlgorithm.java | 5 +++-- .../BinarySearchRandomWalkLabelPropagationAlgorithm.java | 4 +++- .../las2peer/services/ocd/algorithms/ClizzAlgorithm.java | 4 +++- .../CostFunctionOptimizationClusteringAlgorithm.java | 1 + .../DetectingOverlappingCommunitiesAlgorithm.java | 1 + .../algorithms/EvolutionaryAlgorithmBasedOnSimilarity.java | 1 + .../ExtendedSpeakerListenerLabelPropagationAlgorithm.java | 4 +++- .../algorithms/FuzzyCMeansSpectralClusteringAlgorithm.java | 4 ++-- .../services/ocd/algorithms/LinkCommunitiesAlgorithm.java | 4 +++- .../ocd/algorithms/LocalSpectralClusteringAlgorithm.java | 2 +- .../las2peer/services/ocd/algorithms/LouvainAlgorithm.java | 6 ++++-- .../MergingOfOverlappingCommunitiesAlgorithm.java | 4 +++- .../i5/las2peer/services/ocd/algorithms/NISEAlgorithm.java | 6 ++++-- .../algorithms/RandomWalkLabelPropagationAlgorithm.java | 4 +++- .../services/ocd/algorithms/SignedDMIDAlgorithm.java | 4 +++- .../algorithms/SignedProbabilisticMixtureAlgorithm.java | 1 + .../SpeakerListenerLabelPropagationAlgorithm.java | 4 +++- .../i5/las2peer/services/ocd/algorithms/SskAlgorithm.java | 4 +++- .../algorithms/WeakCliquePercolationMethodAlgorithm.java | 7 +++---- .../ocd/algorithms/WeightedLinkCommunitiesAlgorithm.java | 4 +++- .../ocd/algorithms/WordClusteringRefinementAlgorithm.java | 2 ++ 21 files changed, 53 insertions(+), 23 deletions(-) diff --git a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/AntColonyOptimizationAlgorithm.java b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/AntColonyOptimizationAlgorithm.java index 7f22b82c..b2ef555c 100644 --- a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/AntColonyOptimizationAlgorithm.java +++ b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/AntColonyOptimizationAlgorithm.java @@ -236,8 +236,9 @@ public Cover detectOverlappingCommunities(CustomGraph graph) throws OcdAlgorithm update(MCR, ants, nodeNr); } - - return decodeMaximalCliques(graph, nodeNr); + Cover c = decodeMaximalCliques(graph, nodeNr); + System.out.println("*** "+ this.getClass().getSimpleName() + " found " + c.communityCount() +" communities ***"); + return c; } diff --git a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/BinarySearchRandomWalkLabelPropagationAlgorithm.java b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/BinarySearchRandomWalkLabelPropagationAlgorithm.java index 35fbe00c..5070937c 100644 --- a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/BinarySearchRandomWalkLabelPropagationAlgorithm.java +++ b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/BinarySearchRandomWalkLabelPropagationAlgorithm.java @@ -110,7 +110,9 @@ public void setParameters(Map parameters) throws IllegalArgument public Cover detectOverlappingCommunities(CustomGraph graph) throws OcdAlgorithmException, InterruptedException { List leaders = randomWalkPhase(graph); - return labelPropagationPhase(graph, leaders); + Cover c = labelPropagationPhase(graph, leaders); + System.out.println("*** "+ this.getClass().getSimpleName() + " found " + c.communityCount() +" communities ***"); + return c; } /** diff --git a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/ClizzAlgorithm.java b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/ClizzAlgorithm.java index 37cb61eb..4fa38792 100644 --- a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/ClizzAlgorithm.java +++ b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/ClizzAlgorithm.java @@ -93,7 +93,9 @@ public Cover detectOverlappingCommunities(CustomGraph graph) Map leadershipValues = calculateLeadershipValues(graph, distances); Map leaders = determineCommunityLeaders(graph, distances, leadershipValues); Matrix memberships = calculateMemberships(graph, leaders); - return new Cover(graph, memberships); + Cover c = new Cover(graph, memberships); + System.out.println("*** "+ this.getClass().getSimpleName() + " found " + c.communityCount() +" communities ***"); + return c; } @Override diff --git a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/CostFunctionOptimizationClusteringAlgorithm.java b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/CostFunctionOptimizationClusteringAlgorithm.java index 8edd0000..2d9555f2 100644 --- a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/CostFunctionOptimizationClusteringAlgorithm.java +++ b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/CostFunctionOptimizationClusteringAlgorithm.java @@ -160,6 +160,7 @@ public Cover detectOverlappingCommunities(CustomGraph graph) throws OcdAlgorithm res.setSimCosts(opt.getCosts()); time.stop(); time.setCoverExecutionTime(res); + System.out.println("*** "+ this.getClass().getSimpleName() + " found " + res.communityCount() +" communities ***"); return res; } diff --git a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/DetectingOverlappingCommunitiesAlgorithm.java b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/DetectingOverlappingCommunitiesAlgorithm.java index 45297076..0823ee6e 100644 --- a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/DetectingOverlappingCommunitiesAlgorithm.java +++ b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/DetectingOverlappingCommunitiesAlgorithm.java @@ -104,6 +104,7 @@ public Cover detectOverlappingCommunities(CustomGraph graph) Matrix membershipMatrix = getMembershipMatrix(graph); Cover cover = new Cover(graph, membershipMatrix); + System.out.println("*** "+ this.getClass().getSimpleName() + " found " + cover.communityCount() +" communities ***"); return cover; } catch(InterruptedException e) { diff --git a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/EvolutionaryAlgorithmBasedOnSimilarity.java b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/EvolutionaryAlgorithmBasedOnSimilarity.java index bc256d13..84207cd9 100644 --- a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/EvolutionaryAlgorithmBasedOnSimilarity.java +++ b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/EvolutionaryAlgorithmBasedOnSimilarity.java @@ -127,6 +127,7 @@ public Cover detectOverlappingCommunities(CustomGraph graph) throws OcdAlgorithm int nodeCount = graph.nodeCount(); Matrix membershipMatrix = translateCommunityFile(LastResultPath, nodeCount); Cover cover = new Cover(graph, membershipMatrix); + System.out.println("*** "+ this.getClass().getSimpleName() + " found " + cover.communityCount() +" communities ***"); return cover; } catch (InterruptedException e) { throw e; diff --git a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/ExtendedSpeakerListenerLabelPropagationAlgorithm.java b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/ExtendedSpeakerListenerLabelPropagationAlgorithm.java index 704f31d1..ff766ddf 100644 --- a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/ExtendedSpeakerListenerLabelPropagationAlgorithm.java +++ b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/ExtendedSpeakerListenerLabelPropagationAlgorithm.java @@ -150,7 +150,9 @@ public Cover detectOverlappingCommunities( /* * Returns the cover based on the node memories. */ - return calculateMembershipDegrees(graph, memories); + Cover c = calculateMembershipDegrees(graph, memories); + System.out.println("*** "+ this.getClass().getSimpleName() + " found " + c.communityCount() +" communities ***"); + return c; } protected void initializeCommunityDetection(CustomGraph graph, List> memories, List nodeOrder) throws InterruptedException { diff --git a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/FuzzyCMeansSpectralClusteringAlgorithm.java b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/FuzzyCMeansSpectralClusteringAlgorithm.java index b691ba1c..bcf55786 100644 --- a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/FuzzyCMeansSpectralClusteringAlgorithm.java +++ b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/FuzzyCMeansSpectralClusteringAlgorithm.java @@ -327,10 +327,10 @@ public Cover detectOverlappingCommunities(CustomGraph graph) // build the cover using the input graph and the membership matrix built above resulting_cover = new Cover(graph,membership_matrix); - System.out.println("================== CHOSEN SOLUTION ====================="); + //System.out.println("================== CHOSEN SOLUTION ====================="); System.out.println("Optimal K is: " + optimal_K + " optimal modularity is: " + modularity); + System.out.println("*** "+ this.getClass().getSimpleName() + " found " + resulting_cover.communityCount() +" communities ***"); - return resulting_cover; } diff --git a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/LinkCommunitiesAlgorithm.java b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/LinkCommunitiesAlgorithm.java index fb216e70..75a2205d 100644 --- a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/LinkCommunitiesAlgorithm.java +++ b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/LinkCommunitiesAlgorithm.java @@ -130,7 +130,9 @@ public Cover detectOverlappingCommunities(CustomGraph graph) throws InterruptedE densestPartition = new ArrayList>(communityEdges); } } - return calculatePartitionCover(graph, densestPartition); + Cover c = calculatePartitionCover(graph, densestPartition); + System.out.println("*** "+ this.getClass().getSimpleName() + " found " + c.communityCount() +" communities ***"); + return c; } private Matrix calculateEdgeSimilarities(CustomGraph graph, List linkageDegrees) throws InterruptedException { diff --git a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/LocalSpectralClusteringAlgorithm.java b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/LocalSpectralClusteringAlgorithm.java index 348146c3..afb71ae9 100644 --- a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/LocalSpectralClusteringAlgorithm.java +++ b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/LocalSpectralClusteringAlgorithm.java @@ -300,7 +300,7 @@ public Cover detectOverlappingCommunities(CustomGraph graph) throws OcdAlgorithm // DEBUG: System.out.println("DETECTED FINAL:" + members.values().toString()); Cover c = new Cover(graph, coverMatrix); - + System.out.println("*** "+ this.getClass().getSimpleName() + " found " + c.communityCount() +" communities ***"); return c; } diff --git a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/LouvainAlgorithm.java b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/LouvainAlgorithm.java index 45d4362b..472e118c 100644 --- a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/LouvainAlgorithm.java +++ b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/LouvainAlgorithm.java @@ -97,8 +97,10 @@ public Cover detectOverlappingCommunities(CustomGraph graph) int[] communities = cluster(maxLayers); Matrix memberships = getMembershipMatrix(graph, communities); - - return new Cover(graph, memberships); + + Cover c = new Cover(graph, memberships); + System.out.println("*** "+ this.getClass().getSimpleName() + " found " + c.communityCount() +" communities ***"); + return c; } @Override diff --git a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/MergingOfOverlappingCommunitiesAlgorithm.java b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/MergingOfOverlappingCommunitiesAlgorithm.java index 95946eda..0950fe33 100644 --- a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/MergingOfOverlappingCommunitiesAlgorithm.java +++ b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/MergingOfOverlappingCommunitiesAlgorithm.java @@ -121,7 +121,9 @@ public Cover detectOverlappingCommunities(CustomGraph graph) throws InterruptedE } double resolutionAlpha = determineResolutionAlpha(graph, inclusionAlphas, deactivatedBy, mainCommunities); Matrix memberships = determineMembershipMatrix(graph, unactiveCommunities, deactivatedBy, inclusionAlphas, resolutionAlpha); - return new Cover(graph, memberships); + Cover c = new Cover(graph, memberships); + System.out.println("*** "+ this.getClass().getSimpleName() + " found " + c.communityCount() +" communities ***"); + return c; } /** diff --git a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/NISEAlgorithm.java b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/NISEAlgorithm.java index 564155ac..e2290af1 100644 --- a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/NISEAlgorithm.java +++ b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/NISEAlgorithm.java @@ -101,7 +101,9 @@ public Cover detectOverlappingCommunities(CustomGraph graph) NodeList seeds = seeding(biconnectedCore); NodeList[] lowConductanceSets = expansion(biconnectedCore, seeds); Matrix memberships = propagation(graph, lowConductanceSets, bridges, biconnectedCore); - return new Cover(graph, memberships); + Cover c = new Cover(graph, memberships); + System.out.println("*** "+ this.getClass().getSimpleName() + " found " + c.communityCount() +" communities ***"); + return c; } @Override @@ -233,7 +235,7 @@ private NodeList seeding(Graph biconnectedCore) { /** * Algorithm Spread Hubs chooses an independent set of k (= seedCount) seeds by * looking at the vertices in order of decreasing degree - * @param biconnected core + * @param biconnectedCore * @return list of the seed nodes */ private NodeList spreadHubs(Graph biconnectedCore) { diff --git a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/RandomWalkLabelPropagationAlgorithm.java b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/RandomWalkLabelPropagationAlgorithm.java index 9876e2fc..5f15940b 100644 --- a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/RandomWalkLabelPropagationAlgorithm.java +++ b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/RandomWalkLabelPropagationAlgorithm.java @@ -125,7 +125,9 @@ public Set compatibleGraphTypes() { public Cover detectOverlappingCommunities(CustomGraph graph) throws OcdAlgorithmException, InterruptedException { List leaders = randomWalkPhase(graph); - return labelPropagationPhase(graph, leaders); + Cover c = labelPropagationPhase(graph, leaders); + System.out.println("*** "+ this.getClass().getSimpleName() + " found " + c.communityCount() +" communities ***"); + return c; } /** diff --git a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/SignedDMIDAlgorithm.java b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/SignedDMIDAlgorithm.java index c09d8883..cbfc1de2 100644 --- a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/SignedDMIDAlgorithm.java +++ b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/SignedDMIDAlgorithm.java @@ -104,7 +104,9 @@ public Set compatibleGraphTypes() { public Cover detectOverlappingCommunities(CustomGraph graph) throws OcdAlgorithmException, InterruptedException { Vector leadershipVector = getLeadershipVector(graph); List leaders = leaderFindingPhase(graph, leadershipVector); - return labelPropagationPhase(graph, leaders, leadershipVector); + Cover c = labelPropagationPhase(graph, leaders, leadershipVector); + System.out.println("*** "+ this.getClass().getSimpleName() + " found " + c.communityCount() +" communities ***"); + return c; } /** diff --git a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/SignedProbabilisticMixtureAlgorithm.java b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/SignedProbabilisticMixtureAlgorithm.java index 839bd051..ffe8aff5 100644 --- a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/SignedProbabilisticMixtureAlgorithm.java +++ b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/SignedProbabilisticMixtureAlgorithm.java @@ -181,6 +181,7 @@ public Cover detectOverlappingCommunities(CustomGraph graph) throws OcdAlgorithm Matrix membershipMatrix = getMembershipMatrix(graph); Cover cover = new Cover(graph, membershipMatrix); + System.out.println("*** "+ this.getClass().getSimpleName() + " found " + cover.communityCount() +" communities ***"); return cover; } catch (InterruptedException e) { throw e; diff --git a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/SpeakerListenerLabelPropagationAlgorithm.java b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/SpeakerListenerLabelPropagationAlgorithm.java index 46e9d1db..5bb6446c 100644 --- a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/SpeakerListenerLabelPropagationAlgorithm.java +++ b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/SpeakerListenerLabelPropagationAlgorithm.java @@ -144,7 +144,9 @@ public Cover detectOverlappingCommunities( /* * Returns the cover based on the node memories. */ - return calculateMembershipDegrees(graph, memories); + Cover c = calculateMembershipDegrees(graph, memories); + System.out.println("*** "+ this.getClass().getSimpleName() + " found " + c.communityCount() +" communities ***"); + return c; } protected void initializeCommunityDetection(CustomGraph graph, List> memories, List nodeOrder) { diff --git a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/SskAlgorithm.java b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/SskAlgorithm.java index 147e237e..fd43d671 100644 --- a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/SskAlgorithm.java +++ b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/SskAlgorithm.java @@ -144,7 +144,9 @@ public Cover detectOverlappingCommunities(CustomGraph graph) throws InterruptedE Vector totalInfluences = executeRandomWalk(transitionMatrix); Map leaders = determineGlobalLeaders(graph, transitionMatrix, totalInfluences); Matrix memberships = calculateMemberships(graph, leaders); - return new Cover(graph, memberships); + Cover c = new Cover(graph, memberships); + System.out.println("*** "+ this.getClass().getSimpleName() + " found " + c.communityCount() +" communities ***"); + return c; } /** diff --git a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/WeakCliquePercolationMethodAlgorithm.java b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/WeakCliquePercolationMethodAlgorithm.java index 90140ec9..35a9a6ab 100644 --- a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/WeakCliquePercolationMethodAlgorithm.java +++ b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/WeakCliquePercolationMethodAlgorithm.java @@ -89,10 +89,9 @@ public Cover detectOverlappingCommunities(CustomGraph graph) // build a community matrix with a row for each node Matrix community_matrix = buildCoverMatrix(identified_communities, adjacency_matrix.rows()); - Cover resulting_cover = new Cover(graph, community_matrix); - - System.out.println("****** Number of found communities: " + identified_communities.size() + " ******"); - return resulting_cover; + Cover c = new Cover(graph, community_matrix); + System.out.println("*** "+ this.getClass().getSimpleName() + " found " + c.communityCount() +" communities ***"); + return c; } diff --git a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/WeightedLinkCommunitiesAlgorithm.java b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/WeightedLinkCommunitiesAlgorithm.java index 66b6b3c2..1622f406 100644 --- a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/WeightedLinkCommunitiesAlgorithm.java +++ b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/WeightedLinkCommunitiesAlgorithm.java @@ -131,7 +131,9 @@ public Cover detectOverlappingCommunities(CustomGraph graph) throws InterruptedE densestPartition = new ArrayList>(communityEdges); } } - return calculatePartitionCover(graph, densestPartition); + Cover c = calculatePartitionCover(graph, densestPartition); + System.out.println("*** "+ this.getClass().getSimpleName() + " found " + c.communityCount() +" communities ***"); + return c; } /** diff --git a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/WordClusteringRefinementAlgorithm.java b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/WordClusteringRefinementAlgorithm.java index 7472e403..90e651b7 100644 --- a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/WordClusteringRefinementAlgorithm.java +++ b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/WordClusteringRefinementAlgorithm.java @@ -136,6 +136,8 @@ public Cover detectOverlappingCommunities(CustomGraph graph) throws OcdAlgorithm Cover res = new Cover(graph,membershipMatrix); time.stop(); time.setCoverExecutionTime(res); + + System.out.println("*** "+ this.getClass().getSimpleName() + " found " + res.communityCount() +" communities ***"); return res; } From 8c799c96a037918988d85910641b772b5692c1b0 Mon Sep 17 00:00:00 2001 From: Beq Date: Sun, 10 Apr 2022 23:04:32 +0200 Subject: [PATCH 2/2] remove extra console output of MEA algorithm --- .../java/i5/las2peer/services/ocd/algorithms/mea/Parameter.java | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/mea/Parameter.java b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/mea/Parameter.java index ae883792..c9ffef0d 100644 --- a/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/mea/Parameter.java +++ b/rest_ocd_services/src/main/java/i5/las2peer/services/ocd/algorithms/mea/Parameter.java @@ -5,7 +5,7 @@ public class Parameter { public static int popsize = 100; public static int T = 20; public static int generation = 50; - public static int verbose = 2; + public static int verbose = 0; public static double alpha = 1.0; public static double pc = 0.7; public static double pm = 1.0;