Search Results for author:
Found 4 papers, 1 papers with code
Analyzing Modularity Maximization in Approximation, Heuristic, and Graph Neural Network Algorithms for Community Detection
Our findings reveal that the average modularity-based heuristic yields optimal partitions in only 43. 9% of the 104 networks analyzed.
NL4Opt Competition: Formulating Optimization Problems Based on Their Natural Language Descriptions
The Natural Language for Optimization (NL4Opt) Competition was created to investigate methods of extracting the meaning and formulation of an optimization problem based on its text description.
Heuristic Modularity Maximization Algorithms for Community Detection Rarely Return an Optimal Partition or Anything Similar
Additionally, results on adjusted mutual information reveal substantial dissimilarity between the sub-optimal partitions and any optimal partition of the networks in our experiments.
The Bayan Algorithm: Detecting Communities in Networks Through Exact and Approximate Optimization of Modularity
Community detection is a classic problem in network science with extensive applications in various fields.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
