Detecting community structure in complex networks using genetic algorithm based on object migrating automata

A New Method of Inland Water Ship Trajectory Prediction Based on Long Short-Term Memory Network Optimized by Genetic Algorithm

Ship position prediction plays a key role in the early warning and safety of inland waters and maritime navigation. Ship pilots must have in-depth knowledge of the future position of their ship and target ship in a specific time period when maneuvering the ship to effectively avoid collisions. However, prediction accuracy and computing efficiency are crucial issues that need to be worked out at present. To solve these problems, in this paper, the deep long short-term memory network framework (LSTM) and genetic algorithm (GA) are introduced to predict the ship trajectory of inland water. Firstly, the collected actual automatic identification system (AIS) data are preprocessed and a series of typical trajectories are extracted from them; then, the LSTM network is used to predict the typical trajectories in real time. Considering that the hyperparameters of the LSTM network have difficulty obtaining the optimal solution manually, the GA is used to optimize hyperparameters of LSTM; finally, the GA-LSTM trajectory prediction model is constructed with the optimal network parameters and compared with the traditional support vector machine (SVM) model and LSTM model. The experimental results show that the GA-LSTM model effectively improves the accuracy and speed of trajectory prediction, with outstanding performance and good generalization, which possess certain reference values for the development of collision avoidance of unmanned ships.

DMFO-CD: A Discrete Moth-Flame Optimization Algorithm for Community Detection

In this paper, a discrete moth–flame optimization algorithm for community detection (DMFO-CD) is proposed. The representation of solution vectors, initialization, and movement strategy of the continuous moth–flame optimization are purposely adapted in DMFO-CD such that it can solve the discrete community detection. In this adaptation, locus-based adjacency representation is used to represent the position of moths and flames, and the initialization process is performed by considering the community structure and the relation between nodes without the need of any knowledge about the number of communities. Solution vectors are updated by the adapted movement strategy using a single-point crossover to distance imitating, a two-point crossover to calculate the movement, and a single-point neighbor-based mutation that can enhance the exploration and balance exploration and exploitation. The fitness function is also defined based on modularity. The performance of DMFO-CD was evaluated on eleven real-world networks, and the obtained results were compared with five well-known algorithms in community detection, including GA-Net, DPSO-PDM, GACD, EGACD, and DECS in terms of modularity, NMI, and the number of detected communities. Additionally, the obtained results were statistically analyzed by the Wilcoxon signed-rank and Friedman tests. In the comparison with other comparative algorithms, the results show that the proposed DMFO-CD is competitive to detect the correct number of communities with high modularity.

Detecting community structure in signed and unsigned social networks by using weighted label propagation

Detecting community structure is one of the most important problems in analyzing complex networks such as technological, informational, biological, and social networks and has great importance in understanding the operation and organization of these networks. One of the significant properties of social networks is the communication intensity between the users, which has not received much attention so far. Most of the proposed methods for detecting community structure in social networks have only considered communications between users. In this paper, using MinHash and label propagation, an algorithm called weighted label propagation algorithm (WLPA) has been proposed to detect community structure in signed and unsigned social networks. WLPA takes into account the intensity of communications in addition to the communications. In WLPA, first, the similarity of all adjacent nodes is estimated by using MinHash. Then, each edge is assigned a weight equal to the estimated similarity of its end nodes. The weights assigned to the edges somehow indicate the intensity of communication between users. Finally, the community structure of the network is determined through the weighted label propagation. Experiments on the benchmark networks indicate that WLPA is efficient and effective for detecting community structure in both signed and unsigned social networks.