Shuqin Li
Shuqin Li has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Binbin Han
College of Engineering, Huazhong Agricultural University, Wuhan 430070, China
2 shared publications - Xiaopeng Li
College of Information Engineering, Northwest A&F University, Xianyang 712100, China
2 shared publications - Hongguang Sun
College of Information Engineering, Northwest AF University, Yangling, China
1 shared publication - Hongming Zhang
College of Information Engineering, Northwest A&F University, Yangling 712100, China
1 shared publication - Jiarun Zhang1 shared publication
Ruixin Zhang
1 shared publication
Latest Publications
- 14 November 2026
- Published by Elsevier in Information Sciences
NPR-IC: Self-supervised non-rigid point cloud registration via intrinsic consistency of semantic anchors
- 14 November 2026
- Published by Elsevier in Information Sciences
NPR-IC: Self-supervised non-rigid point cloud registration via intrinsic consistency of semantic anchors
- 18 January 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 270
Shapewarp: A “global-to-local” non-rigid sheep point cloud posture rectification method
- 18 January 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 270
Shapewarp: A “global-to-local” non-rigid sheep point cloud posture rectification method
- Open Access
- 15 September 2023
- Published by Association for Computing Machinery (ACM)
- p. 126-131
Y-index: An effective method to measure the importance of nodes in a directed weighted network
This paper proposes Y-index as the basic index of directed weighted network to measure the importance of nodes in the network. Considering the large number of nodes in most real networks, in order to improve the computing speed, we introduce the Y-index of synchronous iteration and asynchronous iteration. It is proved that the iterative Y-index sequence is convergent and converges to the same value. The experimental results of Facebook network and Adolescent health network show that, compared with other H-type index, Y-index can well measure the importance of nodes in directed weighted network, which shows that Y-index is effective.
- 15 September 2023
- Published by Association for Computing Machinery (ACM)
- p. 126-131
Open AccessY-index: An effective method to measure the importance of nodes in a directed weighted network
This paper proposes Y-index as the basic index of directed weighted network to measure the importance of nodes in the network. Considering the large number of nodes in most real networks, in order to improve the computing speed, we introduce the Y-index of synchronous iteration and asynchronous iteration. It is proved that the iterative Y-index sequence is convergent and converges to the same value. The experimental results of Facebook network and Adolescent health network show that, compared with other H-type index, Y-index can well measure the importance of nodes in directed weighted network, which shows that Y-index is effective.
- Open Access
- 15 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 387-390
Multi-Surrogate Assisted PSO with Multiple Exemplars for Expensive Multimodal Multi-Objective Optimization
Expensive multimodal multi-objective problems widely exit in real-world applications, in which multiple Pareto solutions correspond to the same objective values. To tackle the above-mentioned problems, traditional particle swarm optimization algorithms always select a Pareto solution from the archive based on preferences as an exemplar. However, this exemplar may not be the best exemplar for each particle. Therefore, a multi-surrogate assisted particle swarm optimization with multiple exemplars is proposed. Firstly, a multi-surrogate model based on clustering is constructed to fit the many-to-one mapping relationship. Secondly, a surrogate assisted optimization strategy based on multiple exemplars is developed. In this strategy, each particle performs optimization under the guidance of multiple exemplars in the archive, and the optimal exemplar is selected based on the evaluations of the surrogate models. Finally, an archive update strategy based on crowding distance is proposed to balance the diversity both in the decision and objective spaces. The experimental results show that the proposed algorithm is significantly superior to eight state-of-the-art evolutionary algorithms on chosen benchmark problems.
- 15 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 387-390
Open AccessMulti-Surrogate Assisted PSO with Multiple Exemplars for Expensive Multimodal Multi-Objective Optimization
Expensive multimodal multi-objective problems widely exit in real-world applications, in which multiple Pareto solutions correspond to the same objective values. To tackle the above-mentioned problems, traditional particle swarm optimization algorithms always select a Pareto solution from the archive based on preferences as an exemplar. However, this exemplar may not be the best exemplar for each particle. Therefore, a multi-surrogate assisted particle swarm optimization with multiple exemplars is proposed. Firstly, a multi-surrogate model based on clustering is constructed to fit the many-to-one mapping relationship. Secondly, a surrogate assisted optimization strategy based on multiple exemplars is developed. In this strategy, each particle performs optimization under the guidance of multiple exemplars in the archive, and the optimal exemplar is selected based on the evaluations of the surrogate models. Finally, an archive update strategy based on crowding distance is proposed to balance the diversity both in the decision and objective spaces. The experimental results show that the proposed algorithm is significantly superior to eight state-of-the-art evolutionary algorithms on chosen benchmark problems.