Finally, applications of the proposed method on a variety of synthetic benchmark graphs and real-life attributed graphs are demonstrated to verify the systematic performance.
Ultimately, the TrackMaven founder believes that the platform is off to a good start by allowing digital marketing teams at big brands to discover key tactics and more easily build benchmarks, graphs, and reports on the data therein.
COPRA and MOSES are more efficient to detect overlapping communities in LFR benchmark graphs than the popular Clique Percolation Method (CPM) [19], which is the reason why we do not use the CPM here.
The results on benchmark graphs led to the abstract construction of a worst-case input graph, which was a consequence of identifying The Problem of Ties.
Experimental evaluations on a wide collection of benchmark graphs show that the proposed approach not only competes very favorably with the two well-known partitioning packages METIS and CHACO, but also improves more than two thirds of the best balanced partitions ever reported in the literature.
After introducing the method, we test its performance on artificial benchmark graphs, comparing it with the performances of the best algorithms currently available.
The neural system has been tested on random and benchmark graphs, showing good performance with respect to the same heuristic for the same problems.
For 31 benchmark graphs of various types, the proposed harmony search algorithm is compared with a newly developed genetic algorithm and another genetic algorithm taken from the recent literature are presented.
It is worth to note, that the benchmark graphs used [21] have been developed for the comparison of not overlapping modularization methods, which may – in part – explain why the two overlapping methods did not perform extremely well on them.
The application of the ModuLand method on the benchmark graphs of Lancichinetti et al. [21] generated over a range of parameter settings showed (Figure S1.13.
