Jiguang Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jiguang Li has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- Jichun Li
Newcastle University
8 shared publications - Yu Zhou
School of Electrical Engineering, North China University of Water Resources and Electric Power, Zhengzhou, China
6 shared publications - Lei Bai
School of Electrical Engineering, North China University of Water Resources and Electric Power, Zhengzhou 450045, China
5 shared publications - Jiajie Luo
School of Computing, Newcastle University, Newcastle upon Tyne, U.K.
4 shared publications - Jiaqing Li3 shared publications
- Shuo Zhao3 shared publications
Latest Publications
- Open Access
- 5 September 2026
- Published by Elsevier in SSRN Electronic Journal
Fusing Structural Similarity and Angular Information for Boundary Point Detection in Diverse Data
Existing boundary point detection methods struggle to generalize across diverse data distributions due to their reliance on parameter sensitive, single-perspective (density or geometry) measures. To overcome the limitations of existing approaches—which often struggle to generalize across diverse data distributions and rely heavily on parameter‑ or threshold‑sensitive density‑ and geometry‑based measures—this paper introduces a fusing structural similarity and angular information for boundary point detection in diverse data (FSABD). For each data point, the algorithm first constructs a k-nearest neighbor local structure. It then defines a charge based on structural similarity and employs a Coulomb force model to simulate forces among neighboring points, thereby computing a structural boundary factor that incorporates both the magnitude and directional consistency of the resultant force. Next, depending on the dimensionality of the data, the algorithm applies one of two angular‑analysis strategies to derive an angular boundary score that captures the concentration characteristics of the neighbors’ angular distribution. The structural and angular components are subsequently fused through an adaptive weighting mechanism to form a comprehensive boundary factor. A threshold is automatically determined from the mean and standard deviation of this factor, and points exceeding the threshold are identified as boundary points. On 20 diverse benchmark datasets (UCI, image, text, scRNA-seq), FSABD consistently outperforms nine state-of-the-art methods. When integrated with k-means clustering, it improves average accuracy (ACC) by 10.09%, Adjusted Rand Index (ARI) by 11.32%, and Normalized Mutual Information (NMI) by 7.26%. In 3D point cloud hole detection, FSABD achieves >99% accuracy, demonstrating strong cross-task generalization.
- 5 September 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessFusing Structural Similarity and Angular Information for Boundary Point Detection in Diverse Data
Existing boundary point detection methods struggle to generalize across diverse data distributions due to their reliance on parameter sensitive, single-perspective (density or geometry) measures. To overcome the limitations of existing approaches—which often struggle to generalize across diverse data distributions and rely heavily on parameter‑ or threshold‑sensitive density‑ and geometry‑based measures—this paper introduces a fusing structural similarity and angular information for boundary point detection in diverse data (FSABD). For each data point, the algorithm first constructs a k-nearest neighbor local structure. It then defines a charge based on structural similarity and employs a Coulomb force model to simulate forces among neighboring points, thereby computing a structural boundary factor that incorporates both the magnitude and directional consistency of the resultant force. Next, depending on the dimensionality of the data, the algorithm applies one of two angular‑analysis strategies to derive an angular boundary score that captures the concentration characteristics of the neighbors’ angular distribution. The structural and angular components are subsequently fused through an adaptive weighting mechanism to form a comprehensive boundary factor. A threshold is automatically determined from the mean and standard deviation of this factor, and points exceeding the threshold are identified as boundary points. On 20 diverse benchmark datasets (UCI, image, text, scRNA-seq), FSABD consistently outperforms nine state-of-the-art methods. When integrated with k-means clustering, it improves average accuracy (ACC) by 10.09%, Adjusted Rand Index (ARI) by 11.32%, and Normalized Mutual Information (NMI) by 7.26%. In 3D point cloud hole detection, FSABD achieves >99% accuracy, demonstrating strong cross-task generalization.
- 27 July 2026
- Published by Elsevier in Information Sciences
- Vol. 757
A physics-inspired instance selection method based on Coulomb force modeling
- 27 July 2026
- Published by Elsevier in Information Sciences
- Vol. 757
A physics-inspired instance selection method based on Coulomb force modeling
- Open Access
- 21 April 2026
- Published by Elsevier in SSRN Electronic Journal
A Physics-Inspired Instance Selection Method Based on Coulomb Force Modeling
Instance selection is an important preprocessing step in data mining and machine learning, particularly for large-scale datasets where instance redundancy and noise can degrade computational efficiency and generalization performance. Motivated by physical interaction principles, this paper proposes a Local Coulomb Force-based Instance Selection method (LCFIS). In the proposed framework, each data point is modeled as a charged particle, with its local density—estimated by combining reverse nearest neighbors and Gaussian kernel density estimation—serving as the charge magnitude. Neighborhood interactions are explicitly captured through the resultant Coulomb force acting on each point. We show that, as the neighborhood size increases, the rate of change of the resultant force differs significantly among boundary and core points. Utilizing this character, LCFIS effectively identifies boundary instances. A compact and representative training set is constructed by combining selected boundary points with randomly sampled instances to preserve data diversity. Extensive experiments on multiple public benchmark datasets using two standard classifiers demonstrate that LCFIS achieves a favorable trade-off between compression and classification performance, outperforming nine representative instance selection methods across accuracy, reduction rate, effectiveness, and computational cost.
- 21 April 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessA Physics-Inspired Instance Selection Method Based on Coulomb Force Modeling
Instance selection is an important preprocessing step in data mining and machine learning, particularly for large-scale datasets where instance redundancy and noise can degrade computational efficiency and generalization performance. Motivated by physical interaction principles, this paper proposes a Local Coulomb Force-based Instance Selection method (LCFIS). In the proposed framework, each data point is modeled as a charged particle, with its local density—estimated by combining reverse nearest neighbors and Gaussian kernel density estimation—serving as the charge magnitude. Neighborhood interactions are explicitly captured through the resultant Coulomb force acting on each point. We show that, as the neighborhood size increases, the rate of change of the resultant force differs significantly among boundary and core points. Utilizing this character, LCFIS effectively identifies boundary instances. A compact and representative training set is constructed by combining selected boundary points with randomly sampled instances to preserve data diversity. Extensive experiments on multiple public benchmark datasets using two standard classifiers demonstrate that LCFIS achieves a favorable trade-off between compression and classification performance, outperforming nine representative instance selection methods across accuracy, reduction rate, effectiveness, and computational cost.
- Open Access
- 16 March 2026
- Published by Elsevier in SSRN Electronic Journal
A Physics-Inspired Instance Selection Method Based on Coulomb Force Modeling
Instance selection is an important preprocessing step in data mining and machine learning, particularly for large-scale datasets where instance redundancy and noise can degrade computational efficiency and generalization performance. Motivated by physical interaction principles, this paper proposes a Local Coulomb Force-based Instance Selection method (LCFIS). In the proposed framework, each data point is modeled as a charged particle, with its local density—estimated by combining reverse nearest neighbors and Gaussian kernel density estimation—serving as the charge magnitude. Neighborhood interactions are explicitly captured through the resultant Coulomb force acting on each point. We show that, as the neighborhood size increases, the rate of change of the resultant force differs significantly among boundary and core points. Utilizing this character, LCFIS effectively identifies boundary instances. A compact and representative training set is constructed by combining selected boundary points with randomly sampled instances to preserve data diversity. Extensive experiments on multiple public benchmark datasets using two standard classifiers demonstrate that LCFIS achieves a favorable trade-off between compression and classification performance, outperforming nine representative instance selection methods across accuracy, reduction rate, effectiveness, and computational cost.
- 16 March 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessA Physics-Inspired Instance Selection Method Based on Coulomb Force Modeling
Instance selection is an important preprocessing step in data mining and machine learning, particularly for large-scale datasets where instance redundancy and noise can degrade computational efficiency and generalization performance. Motivated by physical interaction principles, this paper proposes a Local Coulomb Force-based Instance Selection method (LCFIS). In the proposed framework, each data point is modeled as a charged particle, with its local density—estimated by combining reverse nearest neighbors and Gaussian kernel density estimation—serving as the charge magnitude. Neighborhood interactions are explicitly captured through the resultant Coulomb force acting on each point. We show that, as the neighborhood size increases, the rate of change of the resultant force differs significantly among boundary and core points. Utilizing this character, LCFIS effectively identifies boundary instances. A compact and representative training set is constructed by combining selected boundary points with randomly sampled instances to preserve data diversity. Extensive experiments on multiple public benchmark datasets using two standard classifiers demonstrate that LCFIS achieves a favorable trade-off between compression and classification performance, outperforming nine representative instance selection methods across accuracy, reduction rate, effectiveness, and computational cost.
- 26 February 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 339
A novel adaptive hyperspherical oversampling method based on extended natural neighborhood for imbalanced classification
- 26 February 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 339
A novel adaptive hyperspherical oversampling method based on extended natural neighborhood for imbalanced classification
- Open Access
- 2 February 2026
- Published by Elsevier in SSRN Electronic Journal
Solar Activity Optimization Algorithm for Multi-UAV Path Planning
Multi-UAV collaborative path planning is a core challenge in autonomous navigation, involving the search for optimal or near-optimal paths under multiple constraints. this paper proposes a novel meta-heuristic algorithm, termed the Solar Activity Optimizer (SAO), SAO models three types of solar activities: (1) adaptive exploration, achieved through a random screening strategy guided by the periodic variation of sunspots to balance global search ; (2) energy outburst, realized via a flare-triggered directional mutation mechanism that enhances the ability to escape local optima; (3) local exploitation, implemented using a logarithmic spiral trajectory to improve local search accuracy. A center-offset experiment further confirms that the observed performance improvements arise from the intrinsic algorithmic design rather than benchmark-specific characteristics. multi-UAV path planning experiments involving five UAVs are conducted across four complex scenarios constructed from digital elevation model (DEM) data of two real mountainous regions. The results show SAO can generate safe, smooth flight paths with reduced collision risk, validating its effectiveness and practical applicability in complex multi-UAV path planning tasks, ablation studies based on migrating SAO’s core strategies into PSO confirm both the random screening strategy and the partial individual mutation strategy play critical roles in improving the safety and robustness of path planning.
- 2 February 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessSolar Activity Optimization Algorithm for Multi-UAV Path Planning
Multi-UAV collaborative path planning is a core challenge in autonomous navigation, involving the search for optimal or near-optimal paths under multiple constraints. this paper proposes a novel meta-heuristic algorithm, termed the Solar Activity Optimizer (SAO), SAO models three types of solar activities: (1) adaptive exploration, achieved through a random screening strategy guided by the periodic variation of sunspots to balance global search ; (2) energy outburst, realized via a flare-triggered directional mutation mechanism that enhances the ability to escape local optima; (3) local exploitation, implemented using a logarithmic spiral trajectory to improve local search accuracy. A center-offset experiment further confirms that the observed performance improvements arise from the intrinsic algorithmic design rather than benchmark-specific characteristics. multi-UAV path planning experiments involving five UAVs are conducted across four complex scenarios constructed from digital elevation model (DEM) data of two real mountainous regions. The results show SAO can generate safe, smooth flight paths with reduced collision risk, validating its effectiveness and practical applicability in complex multi-UAV path planning tasks, ablation studies based on migrating SAO’s core strategies into PSO confirm both the random screening strategy and the partial individual mutation strategy play critical roles in improving the safety and robustness of path planning.
- 18 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (9) , 18120-18128
TransHAR: Toward Intent-Aware Transformer-Based Human Activity Recognition in Intelligent IoT Communication Systems
Human activity recognition (HAR) has emerged as a critical component in intent-aware, AI-driven Internet of Things (IoT) Communication systems, enabling context-aware responses in smart environments. Recently, Wi-Fi-based HAR has gained significant attention due to its nonintrusive nature, low deployment cost, and ability to preserve privacy. However, they face a major challenge across domains. To address this limitation, we propose a novel cross-domain HAR framework (called TransHAR) by introducing a lightweight and efficient transformer model. On the one hand, we design a feature representation block that processes the Wi-Fi channel frequency response (CFR) phase data to estimate Doppler shifts, capturing motion-related dynamics while remaining invariant to static, environment-specific structures, enhancing generalization across domains. On the other hand, we propose a lightweight transformer architecture, termed ResDyTFormer, which minimizes reliance on normalization layers by incorporating a novel residual dynamic Tanh (DyT) function. This function dynamically learns to balance between traditional normalization and the DyT operation, thereby maintaining training stability and avoiding gradient vanishing issues often encountered when using DyT alone. Extensive experiments on two benchmark datasets demonstrate that the proposed TransHAR framework achieves the state-of-the-art performance in both in-domain and cross-domain HAR tasks with only 0.17 M parameters. On the SHARP dataset, it attains an impressive 99.04% F1-score and 98.94% accuracy. On the 3DO dataset, it achieves 86.10% accuracy and 84.95% F1-score. These results highlight the potential of TransHAR as an efficient and scalable framework for real-world Wi-Fi-based human activity sensing.
- 18 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (9) , 18120-18128
TransHAR: Toward Intent-Aware Transformer-Based Human Activity Recognition in Intelligent IoT Communication Systems
Human activity recognition (HAR) has emerged as a critical component in intent-aware, AI-driven Internet of Things (IoT) Communication systems, enabling context-aware responses in smart environments. Recently, Wi-Fi-based HAR has gained significant attention due to its nonintrusive nature, low deployment cost, and ability to preserve privacy. However, they face a major challenge across domains. To address this limitation, we propose a novel cross-domain HAR framework (called TransHAR) by introducing a lightweight and efficient transformer model. On the one hand, we design a feature representation block that processes the Wi-Fi channel frequency response (CFR) phase data to estimate Doppler shifts, capturing motion-related dynamics while remaining invariant to static, environment-specific structures, enhancing generalization across domains. On the other hand, we propose a lightweight transformer architecture, termed ResDyTFormer, which minimizes reliance on normalization layers by incorporating a novel residual dynamic Tanh (DyT) function. This function dynamically learns to balance between traditional normalization and the DyT operation, thereby maintaining training stability and avoiding gradient vanishing issues often encountered when using DyT alone. Extensive experiments on two benchmark datasets demonstrate that the proposed TransHAR framework achieves the state-of-the-art performance in both in-domain and cross-domain HAR tasks with only 0.17 M parameters. On the SHARP dataset, it attains an impressive 99.04% F1-score and 98.94% accuracy. On the 3DO dataset, it achieves 86.10% accuracy and 84.95% F1-score. These results highlight the potential of TransHAR as an efficient and scalable framework for real-world Wi-Fi-based human activity sensing.
- 11 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Emerging Topics in Computing
- Vol. 13 (4) , 1565-1576
A Novel Proportional-Integral-Parameter Zeroing Neural Network and Its Application to the Quaternion-Valued Time-Varying Linear Matrix Inequality
Zeroing neural network (ZNN) with variable convergence parameter has been a research hotspot recently, and it can be divided into two categories: the varying-parameter ZNN (VP-ZNN) model, and the fuzzy-parameter ZNN (FP-ZNN) model. Both of the two models have their own advantages and disadvantages. VP-ZNN models are usually efficient but not intelligent, while FP-ZNN models are usually intelligent but not efficient. Inspired by the classic proportional–integral–derivative (PID) control technology, we proposed a novel proportional-integral-parameter ZNN (PIP-ZNN) model, which is both efficient and intelligent, to solve the quaternion-valued time-varying linear matrix inequalities (QVTV-LMI) problem. Integrated with adaptive convergence parameters (ACP), the PIP-ZNN model dynamically adjusts its convergence in response to error changes and then achieves optimized performance. Compared with FP-ZNN models which are based on fuzzy logic systems, the PID-based PIP-ZNN models are simpler and more efficient. With the incorporation of a robust activation function (RAF), the PIP-ZNN model demonstrates fixed-time stability and robustness in the presence of both attenuated and constant disturbances. Theoretical analyses in this paper establish the fixed-time stability and robustness of the PIP-ZNN model, including an estimation of the upper bound of the settling-time function. Numerical experiments here validate these advanced features further, emphasizing the efficacy and excellent performance of the proposed PIP-ZNN model.
- 11 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Emerging Topics in Computing
- Vol. 13 (4) , 1565-1576
A Novel Proportional-Integral-Parameter Zeroing Neural Network and Its Application to the Quaternion-Valued Time-Varying Linear Matrix Inequality
Zeroing neural network (ZNN) with variable convergence parameter has been a research hotspot recently, and it can be divided into two categories: the varying-parameter ZNN (VP-ZNN) model, and the fuzzy-parameter ZNN (FP-ZNN) model. Both of the two models have their own advantages and disadvantages. VP-ZNN models are usually efficient but not intelligent, while FP-ZNN models are usually intelligent but not efficient. Inspired by the classic proportional–integral–derivative (PID) control technology, we proposed a novel proportional-integral-parameter ZNN (PIP-ZNN) model, which is both efficient and intelligent, to solve the quaternion-valued time-varying linear matrix inequalities (QVTV-LMI) problem. Integrated with adaptive convergence parameters (ACP), the PIP-ZNN model dynamically adjusts its convergence in response to error changes and then achieves optimized performance. Compared with FP-ZNN models which are based on fuzzy logic systems, the PID-based PIP-ZNN models are simpler and more efficient. With the incorporation of a robust activation function (RAF), the PIP-ZNN model demonstrates fixed-time stability and robustness in the presence of both attenuated and constant disturbances. Theoretical analyses in this paper establish the fixed-time stability and robustness of the PIP-ZNN model, including an estimation of the upper bound of the settling-time function. Numerical experiments here validate these advanced features further, emphasizing the efficacy and excellent performance of the proposed PIP-ZNN model.
- Open Access
- 22 September 2025
- Published by Elsevier in Neurocomputing
- Vol. 657
Face clustering using a novel density peaks clustering algorithm
- 22 September 2025
- Published by Elsevier in Neurocomputing
- Vol. 657
Open AccessFace clustering using a novel density peaks clustering algorithm
- 10 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems, Man, and Cybernetics Magazine
- Vol. 10 (3) , 44-55
Fixed-Time Consensus for Multiagent Systems Under Switching Topology: A Distributed Zeroing Neural Network-Based Method
The zeroing neural network (ZNN) has been utilized in various control applications, such as tracking and motion control. While ZNN has been widely employed, its utilization in consensus control schemes is rarely reported. In this study, we propose a novel distributed fixed-time ZNN (DFTZNN) scheme designed to achieve fixed-time and robust consensus in multiagent systems operating under a switching topology. Theoretical analysis is provided to establish the fixed-time stability and robustness of the proposed scheme in the presence of bounded noises. To highlight the superiority of the proposed method, we introduce an example demonstrating the estimation of the upper bound of a settling-time function. Theoretical analysis and a novel upper-bound estimation method are subsequently validated through numerical experiments, including a practical application in formation control. The comprehensive theoretical and simulation results demonstrate the superior performance of the DFTZNN scheme under both fixed and switching topologies, establishing it as a novel and systematic framework for designing consensus control schemes.
- 10 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems, Man, and Cybernetics Magazine
- Vol. 10 (3) , 44-55
Fixed-Time Consensus for Multiagent Systems Under Switching Topology: A Distributed Zeroing Neural Network-Based Method
The zeroing neural network (ZNN) has been utilized in various control applications, such as tracking and motion control. While ZNN has been widely employed, its utilization in consensus control schemes is rarely reported. In this study, we propose a novel distributed fixed-time ZNN (DFTZNN) scheme designed to achieve fixed-time and robust consensus in multiagent systems operating under a switching topology. Theoretical analysis is provided to establish the fixed-time stability and robustness of the proposed scheme in the presence of bounded noises. To highlight the superiority of the proposed method, we introduce an example demonstrating the estimation of the upper bound of a settling-time function. Theoretical analysis and a novel upper-bound estimation method are subsequently validated through numerical experiments, including a practical application in formation control. The comprehensive theoretical and simulation results demonstrate the superior performance of the DFTZNN scheme under both fixed and switching topologies, establishing it as a novel and systematic framework for designing consensus control schemes.