The beetle antennae search (BAS) algorithm is an outstanding representative of swarm intelligence algorithms. However, the BAS algorithm still suffers from the deficiency of not being able to handle high-dimensional variables. A quantum-based beetle swarm optimization algorithm (QBSO) is proposed herein to address this deficiency. In order to maintain population diversity and improve the avoidance of falling into local optimal solutions, a novel quantum representation-based position updating strategy is designed. The current best solution is regarded as a linear superposition of two probabilistic states: positive and deceptive. An increase in or reset of the probability of the positive state is performed through a quantum rotation gate to maintain the local and global search ability. Finally, a variable search step strategy is adopted to speed up the ability of the convergence. The QBSO algorithm is verified against several swarm intelligence optimization algorithms, and the results show that the QBSO algorithm still has satisfactory performance at a very small population size.

Community structure is a very interesting attribute and feature in complex networks, which has attracted scholars’ attention and research on community detection. Many single-objective optimization algorithms have been migrated and modified to serve community detection problems. Due to the limitation of resolution, the final algorithm implementation effect is not ideal. In this paper, a multi-objective community detection method based on a pigeon-inspired optimization algorithm, MOPIO-Net, is proposed. Firstly, the PIO algorithm is discretized in terms of the solution space representation, position, and velocity-updating strategies to adapt to discrete community detection scenarios. Secondly, by minimizing the two objective functions of community score and community fitness at the same time, the community structure with a tight interior and sparse exterior is obtained. Finally, for the misclassification caused by boundary nodes, a mutation strategy is added to improve the accuracy of the final community recognition. Experiments on synthetic and real networks verify that the proposed algorithm is more accurate in community recognition compared to 11 benchmark algorithms, confirming the effectiveness of the proposed method.

With respect to the fuzzy boundaries of military heterogeneous entities, this paper improves the entity annotation mechanism for entity with fuzzy boundaries based on related research works. This paper applies a BERT-BiLSTM-CRF model fusing deep learning and machine learning to recognize military entities, and thus, we can construct a smart military knowledge base with these entities. Furthermore, we can explore many military AI applications with the knowledge base and military Internet of Things (MIoT). To verify the performance of the model, we design multiple types of experiments. Experimental results show that the recognition performance of the model keeps improving with the increasing size of the corpus in the multidata source scenario, with the -score increasing from 73.56% to 84.53%. Experimental results of cross-corpus cross-validation show that the more types of entities covered in the training corpus and the richer the representation type, the stronger the generalization ability of the trained model, in which the recall rate of the model trained with the novel random type corpus reaches 74.33% and the -score reaches 76.98%. The results of the multimodel comparison experiments show that the BERT-BiLSTM-CRF model applied in this paper performs well for the recognition of military entities. The longitudinal comparison experimental results show that the -score of the BERT-BiLSTM-CRF model is 18.72%, 11.24%, 9.24%, and 5.07% higher than the four models CRF, LSTM-CRF, BiLSTM-CR, and BERT-CRF, respectively. The cross-sectional comparison experimental results show that the -score of the BERT-BiLSTM-CRF model improved by 6.63%, 7.95%, 3.72%, and 1.81% compared to the Lattice-LSTM-CRF, CNN-BiLSTM-CRF, BERT-BiGRU-CRF, and BERT-IDCNN-CRF models, respectively.

There are many evolving dynamic networks in the real world, and community detection in dynamic networks is crucial in many complex network analysis applications. In this paper, a consensus community-based discrete spider wasp optimization (SWO) approach is proposed for the dynamic network community detection problem. First, the coding, initialization, and updating strategies of the spider wasp optimization algorithm are discretized to adapt to the community detection problem. Second, the concept of intra-population and inter-population consensus community is proposed. Consensus community is the knowledge formed by the swarm summarizing the current state as well as the past history. By maintaining certain inter-population consensus community during the evolutionary process, the population in the current time window can evolve in a similar direction to those in the previous time step. Experimental results on many artificial and real dynamic networks show that the proposed method produces more accurate and robust results than current methods.

Document-level event extraction (DEE) aims at extracting event records from given documents. Existing DEE methods handle troublesome challenges by using multiple encoders and casting the task into a multi-step paradigm. However, most of the previous approaches ignore a missing feature by using mean pooling or max pooling operations in different encoding stages and have not explicitly modeled the interdependency features between input tokens, and thus the long-distance problem cannot be solved effectively. In this study, we propose Document-level Event Extraction Model Incorporating Dependency Paths (DEEDP), which introduces a novel multi-granularity encoder framework to tackle the aforementioned problems. Specifically, we first designed a Transformer-based encoder, Transformer-M, by adding a Syntactic Feature Attention mechanism to the Transformer, which can capture more interdependency information between input tokens and help enhance the semantics for sentence-level representations of entities. We then stacked Transformer-M and Transformer to integrate sentence-level and document-level features; we thus obtained semantic enhanced document-aware representations for each entity and model long-distance dependencies between arguments. Experimental results on the benchmarks MUC-4 and ChFinAnn demonstrate that DEEDP achieves superior performance over the baselines, proving the effectiveness of our proposed methods.

Community detection is of great significance to complex network. In response to community detection in complex network which has unknown number of communities, this paper proposed a new community detection approach with integration based on Beetle Swarm Optimization (BSO) and been named BSOI (Beetle Swarm Optimization with Integration). In the initialization of community division, community flag adapting node is adopted, which means the community flag of every node is initialized by its neighbor node. BSO is applied to optimize the community division. Then, we merge communities by the maximum module density increment. Experiments show that it can get a stable and effective result of community division quickly on both artificial and real-world social networks.