Liqun Gao
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
Liqun Gao has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Bin Zhou
National university of defense technology, Changsha, China
3 shared publications - Xin Song
National University of Defense Technology, Changsha, Hunan, China
3 shared publications - Haibin Ouyang
School of Mechanical and Electric Engineering, Guangzhou University, Guangzhou, China
2 shared publications - Haiyan Liu
National university of defense technology, Changsha, China
2 shared publications - Kai Chen
National university of defense technology, Changsha, China
2 shared publications - Steven Li
RMIT University
2 shared publications
Latest Publications
- Open Access
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 4357-4368
FlowPath: From Discrete Paths to Continuous Semantic Flows for Knowledge Graph Completion
Knowledge graph completion (KGC) aims to infer missing facts based on existing triplets. Traditional path-based methods formulate reasoning as a discrete multi-hop traversal, which suffers from exponential search space and error accumulation.In this paper, we propose FlowPath, which rethinks the reasoning process by transforming discrete symbolic paths into a continuous semantic flow in the latent space. Specifically, we formalize the inference from a head entity to the target tail entity as an Ordinary Differential Equation (ODE) governed by a relation-conditioned neural velocity field, which learns to steer a smooth and expressive semantic transformation along the reasoning trajectory. To prevent the continuous flow from drifting into invalid semantic regions, we further introduce a structure-anchored guidance mechanism that leverages factual multi-hop paths from the knowledge graph as topological constraints, grounding the learned flow in the discrete relational structure. Moreover, a uncertainty weighting strategy is employed to adaptively balance the joint optimization of link prediction, flow generation, and structural guidance. By bridging discrete symbolic paths and continuous neural dynamics, FlowPath inherits the interpretability of path-based reasoning while possessing the flexibility and expressiveness of generative modeling. Extensive experiments on benchmark datasets demonstrate that FlowPath achieves competitive performance, and additional analysis confirms the effectiveness of modeling the reasoning paths of KGC as a continuous semantic flow.
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 4357-4368
Open AccessFlowPath: From Discrete Paths to Continuous Semantic Flows for Knowledge Graph Completion
Knowledge graph completion (KGC) aims to infer missing facts based on existing triplets. Traditional path-based methods formulate reasoning as a discrete multi-hop traversal, which suffers from exponential search space and error accumulation.In this paper, we propose FlowPath, which rethinks the reasoning process by transforming discrete symbolic paths into a continuous semantic flow in the latent space. Specifically, we formalize the inference from a head entity to the target tail entity as an Ordinary Differential Equation (ODE) governed by a relation-conditioned neural velocity field, which learns to steer a smooth and expressive semantic transformation along the reasoning trajectory. To prevent the continuous flow from drifting into invalid semantic regions, we further introduce a structure-anchored guidance mechanism that leverages factual multi-hop paths from the knowledge graph as topological constraints, grounding the learned flow in the discrete relational structure. Moreover, a uncertainty weighting strategy is employed to adaptively balance the joint optimization of link prediction, flow generation, and structural guidance. By bridging discrete symbolic paths and continuous neural dynamics, FlowPath inherits the interpretability of path-based reasoning while possessing the flexibility and expressiveness of generative modeling. Extensive experiments on benchmark datasets demonstrate that FlowPath achieves competitive performance, and additional analysis confirms the effectiveness of modeling the reasoning paths of KGC as a continuous semantic flow.
- Open Access
- 15 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 728-737
Robust Multi-modal Knowledge Graph Completion via Modality-Specific Experts
- 15 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 728-737
Open AccessRobust Multi-modal Knowledge Graph Completion via Modality-Specific Experts
- 13 March 2026
- Published by Elsevier in Neural Networks
- Vol. 201, 108849
Relation-Centric knowledge graph generation for recommendation based on conditional diffusion model
- 13 March 2026
- Published by Elsevier in Neural Networks
- Vol. 201, 108849
Relation-Centric knowledge graph generation for recommendation based on conditional diffusion model
- 22 June 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 255, 124526
A joint optimization method for multi-UAV deployment and task scheduling in mobile edge computing with large-scale mobile users
- 22 June 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 255, 124526
A joint optimization method for multi-UAV deployment and task scheduling in mobile edge computing with large-scale mobile users
- Open Access
- 7 December 2022
- Published by Springer Nature in Scientific Reports
- Vol. 12 (1) , 1-14
Improved multi-objective differential evolution algorithm based on a decomposition strategy for multi-objective optimization problems
Many real-world engineering problems need to balance different objectives and can be formatted as multi-objective optimization problem. An effective multi-objective algorithm can achieve a set of optimal solutions that can make a tradeoff between different objectives, which is valuable to further explore and design. In this paper, an improved multi-objective differential evolution algorithm (MOEA/D/DEM) based on a decomposition strategy is proposed to improve the performance of differential evolution algorithm for practical multi-objective nutrition decision problems. Firstly, considering the neighborhood characteristic, a neighbor intimacy factor is designed in the search process for enhancing the diversity of the population, then a new Gaussian mutation strategy with variable step size is proposed to reduce the probability of escaping local optimum area and improve the local search ability. Finally, the proposed algorithm is tested by classic test problems (DTLZ1-7 and WFG1-9) and applied to the multi-objective nutrition decision problems, compared to the other reported multi-objective algorithms, the proposed algorithm has a better search capability and obtained competitive results.
- 7 December 2022
- Published by Springer Nature in Scientific Reports
- Vol. 12 (1) , 1-14
Open AccessImproved multi-objective differential evolution algorithm based on a decomposition strategy for multi-objective optimization problems
Many real-world engineering problems need to balance different objectives and can be formatted as multi-objective optimization problem. An effective multi-objective algorithm can achieve a set of optimal solutions that can make a tradeoff between different objectives, which is valuable to further explore and design. In this paper, an improved multi-objective differential evolution algorithm (MOEA/D/DEM) based on a decomposition strategy is proposed to improve the performance of differential evolution algorithm for practical multi-objective nutrition decision problems. Firstly, considering the neighborhood characteristic, a neighbor intimacy factor is designed in the search process for enhancing the diversity of the population, then a new Gaussian mutation strategy with variable step size is proposed to reduce the probability of escaping local optimum area and improve the local search ability. Finally, the proposed algorithm is tested by classic test problems (DTLZ1-7 and WFG1-9) and applied to the multi-objective nutrition decision problems, compared to the other reported multi-objective algorithms, the proposed algorithm has a better search capability and obtained competitive results.
- Open Access
- 1 January 2021
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2021 (1)
A Heterogeneous Ensemble Learning Model Based on Data Distribution for Credit Card Fraud Detection
Credit card fraud detection (CCFD) is important for protecting the cardholder’s property and the reputation of banks. Class imbalance in credit card transaction data is a primary factor affecting the classification performance of current detection models. However, prior approaches are aimed at improving the prediction accuracy of the minority class samples (fraudulent transactions), but this usually leads to a significant drop in the model’s predictive performance for the majority class samples (legal transactions), which greatly increases the investigation cost for banks. In this paper, we propose a heterogeneous ensemble learning model based on data distribution (HELMDD) to deal with imbalanced data in CCFD. We validate the effectiveness of HELMDD on two real credit card datasets. The experimental results demonstrate that compared with current state‐of‐the‐art models, HELMDD has the best comprehensive performance. HELMDD not only achieves good recall rates for both the minority class and the majority class but also increases the savings rate for banks to 0.8623 and 0.6696, respectively.
- 1 January 2021
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2021 (1)
Open AccessA Heterogeneous Ensemble Learning Model Based on Data Distribution for Credit Card Fraud Detection
Credit card fraud detection (CCFD) is important for protecting the cardholder’s property and the reputation of banks. Class imbalance in credit card transaction data is a primary factor affecting the classification performance of current detection models. However, prior approaches are aimed at improving the prediction accuracy of the minority class samples (fraudulent transactions), but this usually leads to a significant drop in the model’s predictive performance for the majority class samples (legal transactions), which greatly increases the investigation cost for banks. In this paper, we propose a heterogeneous ensemble learning model based on data distribution (HELMDD) to deal with imbalanced data in CCFD. We validate the effectiveness of HELMDD on two real credit card datasets. The experimental results demonstrate that compared with current state‐of‐the‐art models, HELMDD has the best comprehensive performance. HELMDD not only achieves good recall rates for both the minority class and the majority class but also increases the savings rate for banks to 0.8623 and 0.6696, respectively.
- 1 May 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 30 (19483449) , 2437-2440
Edge Detection Algorithm for Magnetic Resonance Images Based on Multi-scale Morphology
Medical image edge detection is an important work for object recognition of human organs and it is an important pre-processing step in medical image segmentation and 3D reconstruction. Conventionally, edge is detected according to some early brought forward algorithms such as gradient-based algorithm, but they are not so good for noise medical image edge detection. In this paper, based on multi-scale morphology algorithm is proposed to detect the edge of brain MRI with Gaussian and salt & pepper noise. Threshold is to classify the MRI into two opposite classes: object and background. The part which is larger than the threshold uses large-scale structure element to detect the edge, and uses small-scale structure element for the part less than the threshold. Large-scale structure element gets through small-scale structure element's dilation. The experimental results show that the proposed algorithm is more efficient for medical image denoising and edge detection than the usually used gradient-based edge detecting algorithms.
- 1 May 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 30 (19483449) , 2437-2440
Edge Detection Algorithm for Magnetic Resonance Images Based on Multi-scale Morphology
Medical image edge detection is an important work for object recognition of human organs and it is an important pre-processing step in medical image segmentation and 3D reconstruction. Conventionally, edge is detected according to some early brought forward algorithms such as gradient-based algorithm, but they are not so good for noise medical image edge detection. In this paper, based on multi-scale morphology algorithm is proposed to detect the edge of brain MRI with Gaussian and salt & pepper noise. Threshold is to classify the MRI into two opposite classes: object and background. The part which is larger than the threshold uses large-scale structure element to detect the edge, and uses small-scale structure element for the part less than the threshold. Large-scale structure element gets through small-scale structure element's dilation. The experimental results show that the proposed algorithm is more efficient for medical image denoising and edge detection than the usually used gradient-based edge detecting algorithms.