Static and Dynamic Community Detection Methods That Optimize a Specific Objective Function: A Survey and Experimental Evaluation

Abstract

Most current survey papers classify community detection methods into broad categories and do not draw clear boundaries between the specific techniques employed by these methods. We survey in this paper all fine-grained community detection categories, the clustering methods that fall under these categories, and the techniques employed by these methods for optimizing each objective function. We provide methodology-based taxonomies that classify static and dynamic community detection methods into hierarchically nested, fine-grained, and specific classes. We classify the methods into the objective function they optimize. Each objective function class is classified into clustering categories. Each category is further classified into clustering methods. Methods are further classified into sub-methods and so on. Thus, the lowest subclass in a hierarchy is a fine-grained and specific method. For each method, we survey the different techniques in literature employed by the method. We empirically and experimentally compare and rank the different methods that fall under each clustering category. We also empirically and experimentally compare and rank the different categories that optimize a same objective function. In summary, the blockbased, top-down divisive-based, random walk-based, and matrix eigenvector-based methods achieved good results. Finally, we provide fitness metrics for each objective function.

A Multiagent Memetic Optimization Algorithm Based on Temporal Asymptotic Surprise in Complex Networks to Reveal the Structure of the Dynamic Community

“…An evolutionary algorithm based on clustering in dynamic networks has been proposed by Chen et al [55]. Other algorithms for detecting dynamic communities have also been proposed in [56][57][58][59].…”

Communities Detection for Advertising by Futuristic Greedy Method with Clustering Approach

“…8 We can consider influence maximization for goal function in optimization-based methods. 31 Influence maximization is an optimization problem to discover a group of nodes in a social network that has a maximum influence considering a propagation model. Kempe and colleagues have illustrated that this problem is an NP-hard problem.…”

Optimizing Edge Sets in Networks to Produce Ground Truth Communities Based on Modularity

“…Community detection has been a problem of interest in network analysis for many years, with many different methods [1]. One such method, modularity maximization, has been particularly well studied [6].…”

“…In this network, weight is added to the colored edges in Figure 3c. In the first iteration, a unit of weight is added to the red edge, (1,5), causing nodes 1 and 5 to be clustered together. The second iteration adds the blue edge, (2,4).…”

“…Typically, this measure would give preference to partitions where there are a large number of edges within each cluster, but a small number of edges between the clusters. This problem has applications in many domains, including biological networks [1], social networks [1], and illicit network analysis [2].…”