Baochen Fan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Baochen Fan has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Yan Kang
School of Software, Yunnan University, Kunming, China
4 shared publications - Bin Pu
Hunan University
1 shared publication - Hu Yuan
School of Software, Yunnan University, Kunming, Yunnan, China
1 shared publication - Jiajun Tang1 shared publication
- Jianjun Zhao
Yunnan Key Laboratory of Software Engineering, National Pilot School of Software, Yunnan University, Kunming, China
1 shared publication Jing Guo
National Pilot School of Software, Yunnan Key Laboratory of Software Engineering, Yunnan University, Kunming, China
1 shared publication
Latest Publications
- 11 February 2026
- Published by Elsevier in Neurocomputing
- Vol. 676
CDNE: Community deception from node and edge perspectives
- 11 February 2026
- Published by Elsevier in Neurocomputing
- Vol. 676
CDNE: Community deception from node and edge perspectives
- 7 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 12 (4) , 1845-1857
Transfer Learning for Dynamic Community Knowledge Detection Based on Dual-Population Cooperation and Competition
Extracting evolving communities in social networks has attracted much attention recently due to its usefulness in the area of social media. Most existing models assume that network structures evolve monotonically and fail to leverage the fluctuating variation in the real world. Moreover, it is difficult to extract valuable community knowledge from previous snapshots, leading to a negative transfer to the current snapshot. In this article, we design a novel transferring strategy for dynamic community detection based on dual-population cooperation and competition. The transfer strategy guides the search by leveraging the meaningful community structures among previous snapshots based on the similarity between the current and all previous ones. Furthermore, to avoid the problem of insufficient population diversity caused by previous single-population algorithms, this article utilizes dual-population cooperative competition for multiobjective optimization. An intercooperation method effectively interchanges information according to normalized mutual information of different individuals in dual-population. Each population optimizes according to different objectives with a role-oriented teaching–learning-based optimizer to compensate for defects such as many hyperparameters, declining diversity, and insufficient convergence. Top students integrate the fine-grained strategy to mutate boundary nodes depending on embedding-based node activity; Ordinary students fuse the coarse-grained method to separate loosely connected subcommunities, while the bottom students do normal learning. Experimental results indicate that our approach outperforms state-of-the-art methods with high consistency.
- 7 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 12 (4) , 1845-1857
Transfer Learning for Dynamic Community Knowledge Detection Based on Dual-Population Cooperation and Competition
Extracting evolving communities in social networks has attracted much attention recently due to its usefulness in the area of social media. Most existing models assume that network structures evolve monotonically and fail to leverage the fluctuating variation in the real world. Moreover, it is difficult to extract valuable community knowledge from previous snapshots, leading to a negative transfer to the current snapshot. In this article, we design a novel transferring strategy for dynamic community detection based on dual-population cooperation and competition. The transfer strategy guides the search by leveraging the meaningful community structures among previous snapshots based on the similarity between the current and all previous ones. Furthermore, to avoid the problem of insufficient population diversity caused by previous single-population algorithms, this article utilizes dual-population cooperative competition for multiobjective optimization. An intercooperation method effectively interchanges information according to normalized mutual information of different individuals in dual-population. Each population optimizes according to different objectives with a role-oriented teaching–learning-based optimizer to compensate for defects such as many hyperparameters, declining diversity, and insufficient convergence. Top students integrate the fine-grained strategy to mutate boundary nodes depending on embedding-based node activity; Ordinary students fuse the coarse-grained method to separate loosely connected subcommunities, while the bottom students do normal learning. Experimental results indicate that our approach outperforms state-of-the-art methods with high consistency.
- 11 December 2023
- Published by Springer Nature in Neural Computing and Applications
- Vol. 36 (8) , 4263-4280
A hybrid style transfer with whale optimization algorithm model for textual adversarial attack
- 11 December 2023
- Published by Springer Nature in Neural Computing and Applications
- Vol. 36 (8) , 4263-4280
A hybrid style transfer with whale optimization algorithm model for textual adversarial attack
- 28 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 70 (1) , 2447-2459
A Fast Hybrid Feature Selection Method Based on Dynamic Clustering and Improved Particle Swarm Optimization for High-Dimensional Health Care Data
The ubiquity and commoditization of wearable sensors have generated a deluge of user-generated health care data and played a key role in clinical utility, particularly when incorporated into personalized prediction models. The “curse of dimensionality” and enormous computational costs are still the main challenges faced by the existing algorithms as the number of wearable datasets exponentially increases. We propose a novel method by hybridizing a clustering method and a wrapper method to reduce the dimensionality of raw wearable datasets while preserving health care information. In the clustering stage, a dynamic correlation-guided feature clustering method reduces the search space by designing a dynamic threshold to filter unrelated high-dimensional features. In the wrapper stage, we obtain the optimal feature subset by improving the powerful search capability of the particle swarm optimization algorithm. A crossover operator based on normalized mutual information similarity is proposed to match particles, which effectively improves the diversity of the offspring swarm to prevent premature convergence. In addition, we propose a dynamic swarm strategy to mutate the duplicate particles in the swarm to enhance the efficiency of the particle search process. Our method is evaluated on ten real public datasets, and the experimental results demonstrate its superior performance.
- 28 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 70 (1) , 2447-2459
A Fast Hybrid Feature Selection Method Based on Dynamic Clustering and Improved Particle Swarm Optimization for High-Dimensional Health Care Data
The ubiquity and commoditization of wearable sensors have generated a deluge of user-generated health care data and played a key role in clinical utility, particularly when incorporated into personalized prediction models. The “curse of dimensionality” and enormous computational costs are still the main challenges faced by the existing algorithms as the number of wearable datasets exponentially increases. We propose a novel method by hybridizing a clustering method and a wrapper method to reduce the dimensionality of raw wearable datasets while preserving health care information. In the clustering stage, a dynamic correlation-guided feature clustering method reduces the search space by designing a dynamic threshold to filter unrelated high-dimensional features. In the wrapper stage, we obtain the optimal feature subset by improving the powerful search capability of the particle swarm optimization algorithm. A crossover operator based on normalized mutual information similarity is proposed to match particles, which effectively improves the diversity of the offspring swarm to prevent premature convergence. In addition, we propose a dynamic swarm strategy to mutate the duplicate particles in the swarm to enhance the efficiency of the particle search process. Our method is evaluated on ten real public datasets, and the experimental results demonstrate its superior performance.