A maximal clique based multiobjective evolutionary algorithm for overlapping community detection

Detecting community structure has become one im-portant technique for studying complex networks. Although many community detection algorithms have been proposed, most of them focus on separated communities, where each node can be-long to only one community. However, in many real-world net-works, communities are often overlapped with each other. De-veloping overlapping community detection algorithms thus be-comes necessary. Along this avenue, this paper proposes a maxi-mal clique based multiobjective evolutionary algorithm for over-lapping community detection. In this algorithm, a new represen-tation scheme based on the introduced maximal-clique graph is presented. Since the maximal-clique graph is defined by using a set of maximal cliques of original graph as nodes and two maximal cliques are allowed to share the same nodes of the original graph, overlap is an intrinsic property of the maximal-clique graph. Attributing to this property, the new representation scheme al-lows multiobjective evolutionary algorithms to handle the over-lapping community detection problem in a way similar to that of the separated community detection, such that the optimization problems are simplified. As a result, the proposed algorithm could detect overlapping community structure with higher partition accuracy and lower computational cost when compared with the existing ones. The experiments on both synthetic and real-world networks validate the effectiveness and efficiency of the proposed algorithm

Constrained K-means and Genetic Algorithm-based Approaches for Optimal Placement of Wireless Structural Health Monitoring Sensors

Optimal placement of wireless structural health monitoring (SHM) sensors has to consider modal identification accuracy and power efficiency. In this study, two-tier wireless sensor network (WSN)-based SHM systems with clusters of sensors are investigated to overcome this difficulty. Each cluster contains a number of sensor nodes and a cluster head (CH). The lower tier is composed of sensors communicating with their associated CHs, and the upper tier is composed of the network of CHs. The first step is the optimal placement of sensors in the lower tier via the effective independence method by considering the modal identification accuracy. The second step is the optimal placement of CHs in the upper tier by considering power efficiency. The sensors in the lower tier are partitioned into clusters before determining the optimal locations of CHs in the upper tier. Two approaches, a constrained K-means clustering approach and a genetic algorithm (GA)-based clustering approach, are proposed in this study to cluster sensors in the lower tier by considering two constraints: (1) the maximum data transmission distance of each sensor; (2) the maximum number of sensors in each cluster. Given that each CH can only manage a limited number of sensors, these constraints should be considered in practice to avoid overload of CHs. The CHs in the upper tier are located at the centers of the clusters determined after clustering sensors in the lower tier. The two proposed approaches aim to construct a balanced size of clusters by minimizing the number of clusters (or CHs) and the total sum of the squared distance between each sensor and its associated CH under the two constraints. Accordingly, the energy consumption in each cluster is decreased and balanced, and the network lifetime is extended. A numerical example is studied to demonstrate the feasibility of using the two proposed clustering approaches for sensor clustering in WSN-based SHM systems. In this example, the performances of the two proposed clustering approaches and the K-means clustering method are also compared. The two proposed clustering approaches outperform the K-means clustering method in terms of constructing balanced size of clusters for a small number of clusters. Doi: 10.28991/CEJ-2022-08-12-01 Full Text: PD