Chuang Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Chuang Liu has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Haojie Wang
School of Information Engineering, Shenyang University, Shenyang 110044, China
4 shared publications Yingkui Du
School of Information Engineering, Shenyang University, Shenyang, Liaoning 110044, P. R. China
3 shared publications- Zhonghu Yuan
School of Information Engineering, Shenyang University, Shenyang 110044, China
3 shared publications Le Zhang
School of Information Engineering, Shenyang University, Shenyang, Liaoning 110044, P. R. China
2 shared publicationsLinan Fan
Shenyang University
2 shared publicationsWanghui Shen
School of Information Engineering, Shenyang University, Shenyang, Liaoning 110044, P. R. China
2 shared publications
Latest Publications
- Open Access
- 21 May 2026
- Published by MDPI AG in Biomimetics
- Vol. 11 (5) , 359
SE-SNN: Squeeze-and-Excitation-Enhanced Spiking Neural Networks with Learnable Neuron Dynamics for Event-Based Vision
Spiking neural networks (SNNs) have emerged as a promising paradigm for energy-efficient neuromorphic computing, particularly when processing asynchronous event streams from dynamic vision sensors (DVSs). However, SNNs often suffer from limited representational capacity and suboptimal feature recalibration compared to their artificial counterparts. To address these challenges, we propose SE-SNN, a novel architecture that integrates Squeeze-and-Excitation (SE) blocks into deep residual SNNs, enabling channel-wise attention without spike generation. Furthermore, we introduce a Robust Parametric Leaky Integrate-and-Fire (RobustPLIF) neuron model with learnable membrane time constant () and firing threshold (), allowing adaptive temporal dynamics in each layer. Our model is trained on the CIFAR10-DVS dataset.The experimental results demonstrate that SE-SNN achieves an accuracy of % on CIFAR10-DVS with 16 time steps, outperforming baseline SNNs while maintaining biological plausibility and hardware efficiency. Ablation studies confirm the individual contributions of the SE blocks and learnable neuron parameters to the performance gains.- 21 May 2026
- Published by MDPI AG in Biomimetics
- Vol. 11 (5) , 359
Open AccessSE-SNN: Squeeze-and-Excitation-Enhanced Spiking Neural Networks with Learnable Neuron Dynamics for Event-Based Vision
Spiking neural networks (SNNs) have emerged as a promising paradigm for energy-efficient neuromorphic computing, particularly when processing asynchronous event streams from dynamic vision sensors (DVSs). However, SNNs often suffer from limited representational capacity and suboptimal feature recalibration compared to their artificial counterparts. To address these challenges, we propose SE-SNN, a novel architecture that integrates Squeeze-and-Excitation (SE) blocks into deep residual SNNs, enabling channel-wise attention without spike generation. Furthermore, we introduce a Robust Parametric Leaky Integrate-and-Fire (RobustPLIF) neuron model with learnable membrane time constant () and firing threshold (), allowing adaptive temporal dynamics in each layer. Our model is trained on the CIFAR10-DVS dataset.The experimental results demonstrate that SE-SNN achieves an accuracy of % on CIFAR10-DVS with 16 time steps, outperforming baseline SNNs while maintaining biological plausibility and hardware efficiency. Ablation studies confirm the individual contributions of the SE blocks and learnable neuron parameters to the performance gains. - Open Access
- 27 March 2026
- Published by MDPI AG in Preprints.org
SE-SNN: Squeeze-and-Excitation Enhanced Spiking Neural Networks with Learnable Neuron Dynamics for Event-Based Vision
Spiking Neural Networks (SNNs) have emerged as a promising paradigm for energy-efficient neuromorphic computing, particularly when processing asynchronous event streams from dynamic vision sensors (DVS). However, SNNs often suffer from limited representational capacity and suboptimal feature recalibration compared to their artificial counterparts. To address these challenges, we propose SE-SNN, a novel architecture that integrates Squeeze-and-Excitation (SE) blocks into deep residual SNNs, enabling channel-wise attention without spike generation in the gating mechanism. Furthermore, we introduce a Robust Parametric Leaky Integrate-and-Fire (RobustPLIF) neuron model with learnable membrane time constant (τ) and firing threshold (Vth), allowing adaptive temporal dynamics per layer. Our model is trained on the CIFAR10-DVS dataset.Experimental results demonstrate that SE-SNN achieves state-of-the-art accuracy of 78.8 % on CIFAR10-DVS with only 16 time steps, significantly outperforming baseline SNNs while maintaining biological plausibility and hardware efficiency. Ablation studies confirm the individual contributions of SE blocks and learnable neuron parameters to performance gains.
- 27 March 2026
- Published by MDPI AG in Preprints.org
Open AccessSE-SNN: Squeeze-and-Excitation Enhanced Spiking Neural Networks with Learnable Neuron Dynamics for Event-Based Vision
Spiking Neural Networks (SNNs) have emerged as a promising paradigm for energy-efficient neuromorphic computing, particularly when processing asynchronous event streams from dynamic vision sensors (DVS). However, SNNs often suffer from limited representational capacity and suboptimal feature recalibration compared to their artificial counterparts. To address these challenges, we propose SE-SNN, a novel architecture that integrates Squeeze-and-Excitation (SE) blocks into deep residual SNNs, enabling channel-wise attention without spike generation in the gating mechanism. Furthermore, we introduce a Robust Parametric Leaky Integrate-and-Fire (RobustPLIF) neuron model with learnable membrane time constant (τ) and firing threshold (Vth), allowing adaptive temporal dynamics per layer. Our model is trained on the CIFAR10-DVS dataset.Experimental results demonstrate that SE-SNN achieves state-of-the-art accuracy of 78.8 % on CIFAR10-DVS with only 16 time steps, significantly outperforming baseline SNNs while maintaining biological plausibility and hardware efficiency. Ablation studies confirm the individual contributions of SE blocks and learnable neuron parameters to performance gains.
- Open Access
- 6 August 2025
- Published by MDPI AG in Biomimetics
- Vol. 10 (8) , 514
Auto Deep Spiking Neural Network Design Based on an Evolutionary Membrane Algorithm
In scientific research and engineering practice, the design of deep spiking neural network (DSNN) architectures remains a complex task that heavily relies on the expertise and experience of professionals. These architectures often require repeated adjustments and modifications based on factors such as the DSNN’s performance, resulting in significant consumption of human and hardware resources. To address these challenges, this paper proposes an innovative evolutionary membrane algorithm for optimizing DSNN architectures. This algorithm automates the construction and design of promising network models, thereby reducing reliance on manual tuning. More specifically, the architecture of DSNN is transformed into the search space of the proposed evolutionary membrane algorithm. The proposed algorithm thoroughly explores the impact of hyperparameters, such as the candidate operation blocks of DSNN, to identify optimal configurations. Additionally, an early stopping strategy is adopted in the performance evaluation phase to mitigate the time loss caused by objective evaluations, further enhancing efficiency. The optimal models identified by the proposed algorithm were evaluated on the CIFAR-10 and CIFAR-100 datasets. The experimental results demonstrate the effectiveness of the proposed algorithm, showing significant improvements in accuracy compared to the existing state-of-the-art methods. This work highlights the potential of evolutionary membrane algorithms to streamline the design and optimization of DSNN architectures, offering a novel and efficient approach to address the challenges in the applications of automated parameter optimization for DSNN.
- 6 August 2025
- Published by MDPI AG in Biomimetics
- Vol. 10 (8) , 514
Open AccessAuto Deep Spiking Neural Network Design Based on an Evolutionary Membrane Algorithm
In scientific research and engineering practice, the design of deep spiking neural network (DSNN) architectures remains a complex task that heavily relies on the expertise and experience of professionals. These architectures often require repeated adjustments and modifications based on factors such as the DSNN’s performance, resulting in significant consumption of human and hardware resources. To address these challenges, this paper proposes an innovative evolutionary membrane algorithm for optimizing DSNN architectures. This algorithm automates the construction and design of promising network models, thereby reducing reliance on manual tuning. More specifically, the architecture of DSNN is transformed into the search space of the proposed evolutionary membrane algorithm. The proposed algorithm thoroughly explores the impact of hyperparameters, such as the candidate operation blocks of DSNN, to identify optimal configurations. Additionally, an early stopping strategy is adopted in the performance evaluation phase to mitigate the time loss caused by objective evaluations, further enhancing efficiency. The optimal models identified by the proposed algorithm were evaluated on the CIFAR-10 and CIFAR-100 datasets. The experimental results demonstrate the effectiveness of the proposed algorithm, showing significant improvements in accuracy compared to the existing state-of-the-art methods. This work highlights the potential of evolutionary membrane algorithms to streamline the design and optimization of DSNN architectures, offering a novel and efficient approach to address the challenges in the applications of automated parameter optimization for DSNN.
- Open Access
- 11 October 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (20) , 3737
A Method for Predicting the Academic Performances of College Students Based on Education System Data
With the development of university campus informatization, effective information mined from fragmented data can greatly improve the management levels of universities and the quality of student training. Academic performances are important in campus life and learning and are important indicators reflecting school administration, teaching level, and learning abilities. As the number of college students increases each year, the quality of teaching in colleges and universities is receiving widespread attention. Academic performances measure the learning ‘effects’ of college students and evaluate the educational levels of colleges and universities. Existing studies related to academic performance prediction often only use a single data source, and their prediction accuracies are often not ideal. In this research, the academic performances of students will be predicted using a feedforward spike neural network trained on data collected from an educational administration system and an online learning platform. Finally, the performance of the proposed prediction model was validated by predicting student achievements on a real dataset (involving a university in Shenyang). The experimental results show that the proposed model can effectively improve the prediction accuracies of student achievements, and its prediction accuracy could reach 70.8%. Using artificial intelligence technology to deeply analyze the behavioral patterns of students and clarify the deep-level impact mechanisms of the academic performances of students can help college educators manage students in a timely and targeted manner, and formulate effective learning supervision plans.
- 11 October 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (20) , 3737
Open AccessA Method for Predicting the Academic Performances of College Students Based on Education System Data
With the development of university campus informatization, effective information mined from fragmented data can greatly improve the management levels of universities and the quality of student training. Academic performances are important in campus life and learning and are important indicators reflecting school administration, teaching level, and learning abilities. As the number of college students increases each year, the quality of teaching in colleges and universities is receiving widespread attention. Academic performances measure the learning ‘effects’ of college students and evaluate the educational levels of colleges and universities. Existing studies related to academic performance prediction often only use a single data source, and their prediction accuracies are often not ideal. In this research, the academic performances of students will be predicted using a feedforward spike neural network trained on data collected from an educational administration system and an online learning platform. Finally, the performance of the proposed prediction model was validated by predicting student achievements on a real dataset (involving a university in Shenyang). The experimental results show that the proposed model can effectively improve the prediction accuracies of student achievements, and its prediction accuracy could reach 70.8%. Using artificial intelligence technology to deeply analyze the behavioral patterns of students and clarify the deep-level impact mechanisms of the academic performances of students can help college educators manage students in a timely and targeted manner, and formulate effective learning supervision plans.
- Open Access
- 27 May 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (11) , 1844
Optimizing the Neural Structure and Hyperparameters of Liquid State Machines Based on Evolutionary Membrane Algorithm
As one of the important artificial intelligence fields, brain-like computing attempts to give machines a higher intelligence level by studying and simulating the cognitive principles of the human brain. A spiking neural network (SNN) is one of the research directions of brain-like computing, characterized by better biogenesis and stronger computing power than the traditional neural network. A liquid state machine (LSM) is a neural computing model with a recurrent network structure based on SNN. In this paper, a learning algorithm based on an evolutionary membrane algorithm is proposed to optimize the neural structure and hyperparameters of an LSM. First, the object of the proposed algorithm is designed according to the neural structure and hyperparameters of the LSM. Second, the reaction rules of the proposed algorithm are employed to discover the best neural structure and hyperparameters of the LSM. Third, the membrane structure is that the skin membrane contains several elementary membranes to speed up the search of the proposed algorithm. In the simulation experiment, effectiveness verification is carried out on the MNIST and KTH datasets. In terms of the MNIST datasets, the best test results of the proposed algorithm with 500, 1000 and 2000 spiking neurons are 86.8%, 90.6% and 90.8%, respectively. The best test results of the proposed algorithm on KTH with 500, 1000 and 2000 spiking neurons are 82.9%, 85.3% and 86.3%, respectively. The simulation results show that the proposed algorithm has a more competitive advantage than other experimental algorithms.
- 27 May 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (11) , 1844
Open AccessOptimizing the Neural Structure and Hyperparameters of Liquid State Machines Based on Evolutionary Membrane Algorithm
As one of the important artificial intelligence fields, brain-like computing attempts to give machines a higher intelligence level by studying and simulating the cognitive principles of the human brain. A spiking neural network (SNN) is one of the research directions of brain-like computing, characterized by better biogenesis and stronger computing power than the traditional neural network. A liquid state machine (LSM) is a neural computing model with a recurrent network structure based on SNN. In this paper, a learning algorithm based on an evolutionary membrane algorithm is proposed to optimize the neural structure and hyperparameters of an LSM. First, the object of the proposed algorithm is designed according to the neural structure and hyperparameters of the LSM. Second, the reaction rules of the proposed algorithm are employed to discover the best neural structure and hyperparameters of the LSM. Third, the membrane structure is that the skin membrane contains several elementary membranes to speed up the search of the proposed algorithm. In the simulation experiment, effectiveness verification is carried out on the MNIST and KTH datasets. In terms of the MNIST datasets, the best test results of the proposed algorithm with 500, 1000 and 2000 spiking neurons are 86.8%, 90.6% and 90.8%, respectively. The best test results of the proposed algorithm on KTH with 500, 1000 and 2000 spiking neurons are 82.9%, 85.3% and 86.3%, respectively. The simulation results show that the proposed algorithm has a more competitive advantage than other experimental algorithms.
- Open Access
- 11 April 2022
- Published by MDPI AG in Applied Sciences
- Vol. 12 (8) , 3841
A Predictive Model for Student Achievement Using Spiking Neural Networks Based on Educational Data
Student achievement prediction is one of the most important research directions in educational data mining. Student achievement directly reflects students’ course mastery and lecturers’ teaching level. Especially for the achievement prediction of college students, it not only plays an early warning and timely correction role for students and teachers, but also provides a method for university decision-makers to evaluate the quality of courses. Based on the existing research and experimental results, this paper proposes a student achievement prediction model based on evolutionary spiking neural network. On the basis of fully analyzing the relationship between course attributes and student attributes, a student achievement prediction model based on spiking neural network is established. The evolutionary membrane algorithm is introduced to learn hyperparameters of the model, so as to improve the accuracy of the model in predicting student achievement. Finally, the proposed model is used to predict student achievement on two benchmark student datasets, and the performance of the prediction model proposed in this paper is analyzed by comparing with other experimental algorithms. The experimental results show that the model based on spiking neural network can effectively improve the prediction accuracy of student achievement.
- 11 April 2022
- Published by MDPI AG in Applied Sciences
- Vol. 12 (8) , 3841
Open AccessA Predictive Model for Student Achievement Using Spiking Neural Networks Based on Educational Data
Student achievement prediction is one of the most important research directions in educational data mining. Student achievement directly reflects students’ course mastery and lecturers’ teaching level. Especially for the achievement prediction of college students, it not only plays an early warning and timely correction role for students and teachers, but also provides a method for university decision-makers to evaluate the quality of courses. Based on the existing research and experimental results, this paper proposes a student achievement prediction model based on evolutionary spiking neural network. On the basis of fully analyzing the relationship between course attributes and student attributes, a student achievement prediction model based on spiking neural network is established. The evolutionary membrane algorithm is introduced to learn hyperparameters of the model, so as to improve the accuracy of the model in predicting student achievement. Finally, the proposed model is used to predict student achievement on two benchmark student datasets, and the performance of the prediction model proposed in this paper is analyzed by comparing with other experimental algorithms. The experimental results show that the model based on spiking neural network can effectively improve the prediction accuracy of student achievement.
- 16 February 2021
- Published by World Scientific Pub Co Pte Ltd in International Journal of Pattern Recognition and Artificial Intelligence
- Vol. 35 (07)
Improved Membrane Algorithm Under the Framework of P Systems to Solve Multimodal Multiobjective Problems
Multimodal multiobjective problems (MMOPs) exist in scientific research and practical projects, and their Pareto solution sets correspond to the same Pareto front. Existing evolutionary algorithms often fall into local optima when solving such problems, which usually leads to insufficient search solutions and their uneven distribution in the Pareto front. In this work, an improved membrane algorithm is proposed for solving MMOPs, which is based on the framework of P system. More specifically, the proposed algorithm employs three elements from P system: object, reaction rule, and membrane structure. The object is implemented by real number coding and represents a candidate solution to the optimization problem to be solved. The function of the reaction rule of the proposed algorithm is similar to the evolution operation of the evolutionary algorithm. It can evolve the object to obtain a better candidate solution set. The membrane structure is the evolutionary logic of the proposed algorithm. It consists of several membranes, each of which is an independent evolutionary unit. This structure is used to maintain the diversity of objects, so that it provides multiple Pareto sets as output. The effectiveness verification study was carried out in simulation experiments. The simulation results show that compared with other experimental algorithms, the proposed algorithm has a competitive advantage in solving all 22 multimodal benchmark test problems in CEC2019.
- 16 February 2021
- Published by World Scientific Pub Co Pte Ltd in International Journal of Pattern Recognition and Artificial Intelligence
- Vol. 35 (07)
Improved Membrane Algorithm Under the Framework of P Systems to Solve Multimodal Multiobjective Problems
Multimodal multiobjective problems (MMOPs) exist in scientific research and practical projects, and their Pareto solution sets correspond to the same Pareto front. Existing evolutionary algorithms often fall into local optima when solving such problems, which usually leads to insufficient search solutions and their uneven distribution in the Pareto front. In this work, an improved membrane algorithm is proposed for solving MMOPs, which is based on the framework of P system. More specifically, the proposed algorithm employs three elements from P system: object, reaction rule, and membrane structure. The object is implemented by real number coding and represents a candidate solution to the optimization problem to be solved. The function of the reaction rule of the proposed algorithm is similar to the evolution operation of the evolutionary algorithm. It can evolve the object to obtain a better candidate solution set. The membrane structure is the evolutionary logic of the proposed algorithm. It consists of several membranes, each of which is an independent evolutionary unit. This structure is used to maintain the diversity of objects, so that it provides multiple Pareto sets as output. The effectiveness verification study was carried out in simulation experiments. The simulation results show that compared with other experimental algorithms, the proposed algorithm has a competitive advantage in solving all 22 multimodal benchmark test problems in CEC2019.
- Open Access
- 21 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 17071-17082
Spike Neural Network Learning Algorithm Based on an Evolutionary Membrane Algorithm
As one of the important artificial intelligence fields, brain-like computing attempts to give machines a higher intelligence level by studying and simulating the cognitive principles of the human brain. Compared with the traditional neural network, the spiking neural network (SNN) has better biogenesis and stronger computing power. In this paper, an SNN learning model based on an evolutionary membrane algorithm is proposed to solve the problem of supervised classification. The proposed algorithm uses the P system’s object, reaction rules, and membrane structure to solve these problems. Specifically, the proposed algorithm can automatically adjust the learning parameters of the network by adjusting the synaptic weight in the learning stage of the spiking neural model according to different application data, providing a better solution model for balance exploration and exploitation. In the simulation experiment, effectiveness verification research is carried out. The simulation results show that compared with other experimental algorithms, the proposed algorithm has a competitive advantage in solving twelve supervised classification benchmark problems through learning curves and quantified classification results.
- 21 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 17071-17082
Open AccessSpike Neural Network Learning Algorithm Based on an Evolutionary Membrane Algorithm
As one of the important artificial intelligence fields, brain-like computing attempts to give machines a higher intelligence level by studying and simulating the cognitive principles of the human brain. Compared with the traditional neural network, the spiking neural network (SNN) has better biogenesis and stronger computing power. In this paper, an SNN learning model based on an evolutionary membrane algorithm is proposed to solve the problem of supervised classification. The proposed algorithm uses the P system’s object, reaction rules, and membrane structure to solve these problems. Specifically, the proposed algorithm can automatically adjust the learning parameters of the network by adjusting the synaptic weight in the learning stage of the spiking neural model according to different application data, providing a better solution model for balance exploration and exploitation. In the simulation experiment, effectiveness verification research is carried out. The simulation results show that compared with other experimental algorithms, the proposed algorithm has a competitive advantage in solving twelve supervised classification benchmark problems through learning curves and quantified classification results.
- Open Access
- 10 September 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 6020-6031
Evolutionary Multi-Objective Membrane Algorithm
Recent advances in evolutionary algorithms based on membrane computing have shown that the mechanism of membrane computing is an effective way to solve optimization problems. In this work, we propose a new evolutionary multi-objective algorithm that uses membrane systems to solve multi-objective optimization problems. Based on the mechanism of living cell structure and function, the algorithm introduces three factors, including membrane structure, multiset and reaction rules. The membrane structure of the proposed algorithm is inspired by the structure of the membrane system, which has multiple layers and nested structures in the skin membrane. Two special symbol-objects are designed to improve the search efficiency of the algorithm. In addition, some reaction rules are used to evolve the symbol-objects of multiset in the inner region of the membrane. In addition, the proposed method combines external archive to maintain the diversity of non-dominated solutions and enhance the search capabilities of the solutions. Our proposed method is compared to five state-of-the-art multi-objective heuristic algorithms. For comparison, six different criteria were used: the quality of the resulting approximate set, the diversity of candidate solutions, and the rate of convergence to the Pareto front. Experimental results show that the proposed method is competitive in performance in qualitative and quantitative measurements of selected test functions. Therefore, the algorithm is feasible and effective for solving multi-objective optimization problems.
- 10 September 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 6020-6031
Open AccessEvolutionary Multi-Objective Membrane Algorithm
Recent advances in evolutionary algorithms based on membrane computing have shown that the mechanism of membrane computing is an effective way to solve optimization problems. In this work, we propose a new evolutionary multi-objective algorithm that uses membrane systems to solve multi-objective optimization problems. Based on the mechanism of living cell structure and function, the algorithm introduces three factors, including membrane structure, multiset and reaction rules. The membrane structure of the proposed algorithm is inspired by the structure of the membrane system, which has multiple layers and nested structures in the skin membrane. Two special symbol-objects are designed to improve the search efficiency of the algorithm. In addition, some reaction rules are used to evolve the symbol-objects of multiset in the inner region of the membrane. In addition, the proposed method combines external archive to maintain the diversity of non-dominated solutions and enhance the search capabilities of the solutions. Our proposed method is compared to five state-of-the-art multi-objective heuristic algorithms. For comparison, six different criteria were used: the quality of the resulting approximate set, the diversity of candidate solutions, and the rate of convergence to the Pareto front. Experimental results show that the proposed method is competitive in performance in qualitative and quantitative measurements of selected test functions. Therefore, the algorithm is feasible and effective for solving multi-objective optimization problems.
- Open Access
A SOM-Based Membrane Optimization Algorithm for Community Detection
The real world is full of rich and valuable complex networks. Community structure is an important feature in complex networks, which makes possible the discovery of some structure or hidden related information for an in-depth study of complex network structures and functional characteristics. Aimed at community detection in complex networks, this paper proposed a membrane algorithm based on a self-organizing map (SOM) network. Firstly, community detection was transformed as discrete optimization problems by selecting the optimization function. Secondly, three elements of the membrane algorithm, objects, reaction rules, and membrane structure were designed to analyze the properties and characteristics of the community structure. Thirdly, a SOM was employed to determine the number of membranes by learning and mining the structure of the current objects in the decision space, which is beneficial to guiding the local and global search of the proposed algorithm by constructing the neighborhood relationship. Finally, the simulation experiment was carried out on both synthetic benchmark networks and four real-world networks. The experiment proved that the proposed algorithm had higher accuracy, stability, and execution efficiency, compared with the results of other experimental algorithms.
Open AccessA SOM-Based Membrane Optimization Algorithm for Community Detection
The real world is full of rich and valuable complex networks. Community structure is an important feature in complex networks, which makes possible the discovery of some structure or hidden related information for an in-depth study of complex network structures and functional characteristics. Aimed at community detection in complex networks, this paper proposed a membrane algorithm based on a self-organizing map (SOM) network. Firstly, community detection was transformed as discrete optimization problems by selecting the optimization function. Secondly, three elements of the membrane algorithm, objects, reaction rules, and membrane structure were designed to analyze the properties and characteristics of the community structure. Thirdly, a SOM was employed to determine the number of membranes by learning and mining the structure of the current objects in the decision space, which is beneficial to guiding the local and global search of the proposed algorithm by constructing the neighborhood relationship. Finally, the simulation experiment was carried out on both synthetic benchmark networks and four real-world networks. The experiment proved that the proposed algorithm had higher accuracy, stability, and execution efficiency, compared with the results of other experimental algorithms.