Jing-Yu Ji
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
Research Subjects
Jing-Yu Ji has a total of 41 co-authors. Here are the top co-authors by number of shared publications:
- Jun Zhang
Hanyang University, ERICA Campus
8 shared publications - Zusheng Tan
School of Data Science, Lingnan University, Hong Kong, China
6 shared publications Billy Chiu
3 shared publications- Sam Kwong
Lingnan University
3 shared publications Wei-Jie Yu
3 shared publicationsJeff Tang
2 shared publications
Latest Publications
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 56 (11) , 6379-6391
EMaTO-LFS: Evolutionary Many-Task Optimization-Based Localized Feature Selection for High-Dimensional Classification
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 56 (11) , 6379-6391
EMaTO-LFS: Evolutionary Many-Task Optimization-Based Localized Feature Selection for High-Dimensional Classification
- 25 June 2026
- Published by Elsevier in Information Processing & Management
- Vol. 64 (1)
Localize-then-summarize: Enhancing scientific multimodal summarization with facet-aware cross-modal memory
- 25 June 2026
- Published by Elsevier in Information Processing & Management
- Vol. 64 (1)
Localize-then-summarize: Enhancing scientific multimodal summarization with facet-aware cross-modal memory
- 30 December 2025
- Published by Elsevier in Applied Soft Computing
- Vol. 189
A surrogate-assisted differential evolution for expensive optimization with equality constraints
- 30 December 2025
- Published by Elsevier in Applied Soft Computing
- Vol. 189
A surrogate-assisted differential evolution for expensive optimization with equality constraints
- 20 December 2025
- Published by Elsevier in Pattern Recognition
- Vol. 174
Adaptive group sparse multi-view classification method based on mutual information
- 20 December 2025
- Published by Elsevier in Pattern Recognition
- Vol. 174
Adaptive group sparse multi-view classification method based on mutual information
- 20 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. PP (1089778X) , 1
Surrogate-Assisted Evolutionary Algorithm for Expensive Optimization with Equality and Inequality Constraints
The presence of equality and inequality constraints is of significant importance in expensive constrained optimization. This study aims to develop a surrogate-assisted evolutionary algorithm capable of addressing three types of constraints commonly encountered in expensive optimization problems: 1) those with only inequality constraints, 2) those with only equality constraints, and 3) those with both equality and inequality constraints. To achieve this, a radial basis function neural network is employed as a surrogate model to approximate expensive objective functions and individual constraints. Leveraging a consensus measure among all individual constraints, an improved infill sampling criterion is proposed to identify the most promising candidates. In addition, a hybrid local search strategy refines infeasible yet promising solutions via both surrogate-driven evolution and a model-free gradient-based mutation. To balance these search modes cost-effectively, a stagnation strategy enables adaptive switching between exploration and exploitation. Experimental results on 58 test instances demonstrate the efficacy of the proposed approach across all three constraint types under a strict budget of 1000 expensive function evaluations. These findings validate the methodology and show competitive performance relative to state-of-the-art methods.
- 20 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. PP (1089778X) , 1
Surrogate-Assisted Evolutionary Algorithm for Expensive Optimization with Equality and Inequality Constraints
The presence of equality and inequality constraints is of significant importance in expensive constrained optimization. This study aims to develop a surrogate-assisted evolutionary algorithm capable of addressing three types of constraints commonly encountered in expensive optimization problems: 1) those with only inequality constraints, 2) those with only equality constraints, and 3) those with both equality and inequality constraints. To achieve this, a radial basis function neural network is employed as a surrogate model to approximate expensive objective functions and individual constraints. Leveraging a consensus measure among all individual constraints, an improved infill sampling criterion is proposed to identify the most promising candidates. In addition, a hybrid local search strategy refines infeasible yet promising solutions via both surrogate-driven evolution and a model-free gradient-based mutation. To balance these search modes cost-effectively, a stagnation strategy enables adaptive switching between exploration and exploitation. Experimental results on 58 test instances demonstrate the efficacy of the proposed approach across all three constraint types under a strict budget of 1000 expensive function evaluations. These findings validate the methodology and show competitive performance relative to state-of-the-art methods.
- 6 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 71 (3) , 7651-7661
Region Division and Merging-Based Multiobjective Optimization for Multimodal Problems
Recently, considerable research efforts have been directed toward multimodal optimization problems in consumer electronics. Given the existence of multiple equally significant solutions applicable to diverse scenarios, simultaneously locating these optima is essential. Utilizing multiobjective optimization presents a promising avenue for addressing such problems, provided an effective transformation from multimodal optimization to multiobjective optimization is established. To this end, this study proposes an enhanced tri-objective transformation framework based on a specifically designed region division and merging strategy. Three objective functions are constructed by incorporating objective conflict and niching principles, thus enabling multiobjective optimization techniques to efficiently locate multiple optimal solutions. Simultaneously, the proposed region division and merging strategy facilitates the transformation process. Initially, the decision space is partitioned into numerous small tiles during the region division phase. Subsequently, these tiles are progressively merged layer by layer during the merging phase, eventually restoring the original decision space. Consequently, the given optimization problem is decomposed into a series of simplified tri-objective optimization subproblems, facilitating a smooth transition from exploration of potential regions to exploitation of promising candidate solutions. Experiments conducted on 20 benchmark multimodal optimization problems demonstrate that the proposed method achieves superior performance compared to 14 state-of-the-art algorithms in terms of simultaneously identifying multiple optimal solutions.
- 6 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 71 (3) , 7651-7661
Region Division and Merging-Based Multiobjective Optimization for Multimodal Problems
Recently, considerable research efforts have been directed toward multimodal optimization problems in consumer electronics. Given the existence of multiple equally significant solutions applicable to diverse scenarios, simultaneously locating these optima is essential. Utilizing multiobjective optimization presents a promising avenue for addressing such problems, provided an effective transformation from multimodal optimization to multiobjective optimization is established. To this end, this study proposes an enhanced tri-objective transformation framework based on a specifically designed region division and merging strategy. Three objective functions are constructed by incorporating objective conflict and niching principles, thus enabling multiobjective optimization techniques to efficiently locate multiple optimal solutions. Simultaneously, the proposed region division and merging strategy facilitates the transformation process. Initially, the decision space is partitioned into numerous small tiles during the region division phase. Subsequently, these tiles are progressively merged layer by layer during the merging phase, eventually restoring the original decision space. Consequently, the given optimization problem is decomposed into a series of simplified tri-objective optimization subproblems, facilitating a smooth transition from exploration of potential regions to exploitation of promising candidate solutions. Experiments conducted on 20 benchmark multimodal optimization problems demonstrate that the proposed method achieves superior performance compared to 14 state-of-the-art algorithms in terms of simultaneously identifying multiple optimal solutions.
- 30 December 2024
- Published by Elsevier in Knowledge-Based Systems
- Vol. 310
SMSMO: Learning to generate multimodal summary for scientific papers
- 30 December 2024
- Published by Elsevier in Knowledge-Based Systems
- Vol. 310
SMSMO: Learning to generate multimodal summary for scientific papers
- 14 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (7) , 8261-8275
Heat-Pipe-Constrained IoT Device Layout via Multiobjective Differential Evolution
Solving large-scale, constrained, and non-linear optimization problems is crucial for the Internet of Things (IoT) due to its wide range of real-life applications. However, there is no unified approach for handling constraints and optimizing objective functions. This paper proposes a tri-objective general framework (TriGF) and an efficient differential evolution method enhanced with adaptive gradient-based mutation (AGM), termed AGM-DE. Within the TriGF, AGM-DE explores the entire feasible region by considering both constraints and the objective function. The goal is to achieve global optimality and fast convergence for the self-assembly of satellite IoT devices under constraints. AGM is an adaptive refinement technique that uses gradient information to reduce the search space and speed up optimization. In our AGM approach, we incorporate gradient information from the objective function to mitigate the negative effects of classic constraint-based gradient descent and reduce its inherent greediness. To validate AGM-DE’s effectiveness, we conducted extensive simulations on 57 benchmark problems with diverse dimensions and constraints. The results demonstrate AGM-DE’s exceptional ability to manage constraints in 56 of these 57 test functions, outperforming five leading methods in optimization efficacy and consistency. We also assessed AGM-DE’s application in optimizing IoT device self-assembly within a satellite layout, subject to heat pipe constraints. Comparative analyses highlight AGM-DE’s robustness and superior search capabilities in deriving layout schemes. Remarkably, these schemes outperform existing best-known solutions for IoT configurations involving 40 to 90 nodes with 80 to 180 variables, confirming AGM-DE’s suitability for a wide range of large-scale constrained IoT challenges.
- 14 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (7) , 8261-8275
Heat-Pipe-Constrained IoT Device Layout via Multiobjective Differential Evolution
Solving large-scale, constrained, and non-linear optimization problems is crucial for the Internet of Things (IoT) due to its wide range of real-life applications. However, there is no unified approach for handling constraints and optimizing objective functions. This paper proposes a tri-objective general framework (TriGF) and an efficient differential evolution method enhanced with adaptive gradient-based mutation (AGM), termed AGM-DE. Within the TriGF, AGM-DE explores the entire feasible region by considering both constraints and the objective function. The goal is to achieve global optimality and fast convergence for the self-assembly of satellite IoT devices under constraints. AGM is an adaptive refinement technique that uses gradient information to reduce the search space and speed up optimization. In our AGM approach, we incorporate gradient information from the objective function to mitigate the negative effects of classic constraint-based gradient descent and reduce its inherent greediness. To validate AGM-DE’s effectiveness, we conducted extensive simulations on 57 benchmark problems with diverse dimensions and constraints. The results demonstrate AGM-DE’s exceptional ability to manage constraints in 56 of these 57 test functions, outperforming five leading methods in optimization efficacy and consistency. We also assessed AGM-DE’s application in optimizing IoT device self-assembly within a satellite layout, subject to heat pipe constraints. Comparative analyses highlight AGM-DE’s robustness and superior search capabilities in deriving layout schemes. Remarkably, these schemes outperform existing best-known solutions for IoT configurations involving 40 to 90 nodes with 80 to 180 variables, confirming AGM-DE’s suitability for a wide range of large-scale constrained IoT challenges.