Xinyun Wu
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
Xinyun Wu has a total of 88 co-authors. Here are the top co-authors by number of shared publications:
- Caiquan Xiong
School of Computer Science, Hubei University of Technology, Wuhan 430068, China
12 shared publications - Mao Luo
School of Computer Science, Hubei University of Technology, Wuhan 430068, China
9 shared publications - Caiquan Xiong
School of Computer Science, Hubei University of Technology, Wuhan, China
6 shared publications - Yuanzhi Ke
School of Computer Science, Hubei University of Technology, No. 28 Nanli Road, Hongshan District, Wuhan 430068, China
6 shared publications - Jianxia Chen
Hubei University of Technology
3 shared publications - Rong Gao
Hubei University of Technology
3 shared publications
Latest Publications
- Open Access
A Dual-Evaluation Local Search Algorithm for the Minimum Hitting Set Problem
The Minimum Hitting Set (MinHS) problem is a classic NP-hard problem in combinatorial optimization, widely applied across fields such as artificial intelligence diagnosis, bioinformatics, and network monitoring. This paper proposes a local search algorithm with Dual-evaluation mode, named DemHS (Dual-evaluation mode search algorithm), tailored for large-scale hitting set instances. The evaluation employs two types of functions: strong and weak. Strong evaluation accurately calculates the exchange gain by introducing a cross-correction term within the local neighborhood defined by an inserted vertex; meanwhile, weak evaluation quickly estimates the gain through global random sampling to broaden the search scope. These two functions synergistically guide the search process. Furthermore, we introduce an age strategy to break ties and enhance the diversity of the search path. When no improvements are made for extended iterations, a large-scale random perturbation is executed to help the algorithm escape local stagnation. Comparative experiments were conducted using 200 public hitting set instances (100 metaheuristic and 100 exact cases) from PACE-2025. The results show that, in the metaheuristic case group, DemHS improves the record on 62 instances and in the precise case group, DemHS obtains optimal solutions across all tested instances. The ablation studies demonstrate a significant positive gain from the dual-evaluation neighborhood structure on optimization results.
Open AccessA Dual-Evaluation Local Search Algorithm for the Minimum Hitting Set Problem
The Minimum Hitting Set (MinHS) problem is a classic NP-hard problem in combinatorial optimization, widely applied across fields such as artificial intelligence diagnosis, bioinformatics, and network monitoring. This paper proposes a local search algorithm with Dual-evaluation mode, named DemHS (Dual-evaluation mode search algorithm), tailored for large-scale hitting set instances. The evaluation employs two types of functions: strong and weak. Strong evaluation accurately calculates the exchange gain by introducing a cross-correction term within the local neighborhood defined by an inserted vertex; meanwhile, weak evaluation quickly estimates the gain through global random sampling to broaden the search scope. These two functions synergistically guide the search process. Furthermore, we introduce an age strategy to break ties and enhance the diversity of the search path. When no improvements are made for extended iterations, a large-scale random perturbation is executed to help the algorithm escape local stagnation. Comparative experiments were conducted using 200 public hitting set instances (100 metaheuristic and 100 exact cases) from PACE-2025. The results show that, in the metaheuristic case group, DemHS improves the record on 62 instances and in the precise case group, DemHS obtains optimal solutions across all tested instances. The ablation studies demonstrate a significant positive gain from the dual-evaluation neighborhood structure on optimization results.
- 7 January 2026
- Published by Springer Nature in Applied Intelligence
- Vol. 56 (1) , 31
SDLK-Net: Enhanced squeezed directional large kernel multi-scale multi-modal fusion network for salient object detection
- 7 January 2026
- Published by Springer Nature in Applied Intelligence
- Vol. 56 (1) , 31
SDLK-Net: Enhanced squeezed directional large kernel multi-scale multi-modal fusion network for salient object detection
- Open Access
- 8 November 2025
- Published by MDPI AG in Journal of Marine Science and Engineering
- Vol. 13 (11) , 2119
MKAIS: A Hybrid Mamba–KAN Neural Network for Vessel Trajectory Prediction
Vessel trajectory prediction (VTP) plays a critical role in maritime safety and intelligent navigation. Existing methods struggle to simultaneously capture long-term dependencies and nonlinear dynamic patterns in vessel movements. To address this challenge, we propose MKAIS, a novel trajectory prediction model that integrates the selective state space modeling capability of Mamba with the strong nonlinear representation power of Kolmogorov–Arnold Networks (KAN). Specifically, we design a feature-separated embedding strategy for AIS inputs (longitude, latitude, speed over ground, course over ground), followed by an MKAN module that jointly models global temporal dependencies and nonlinear dynamics. Experiments on the public ct_dma dataset demonstrate that MKAIS outperforms state-of-the-art baselines (LSTM, Transformer, TrAISformer, Mamba), achieving up to 16.65% improvement in the Haversine distance over 3 h prediction horizons. These results highlight the effectiveness and robustness of MKAIS for both short-term and long-term vessel trajectory prediction.
- 8 November 2025
- Published by MDPI AG in Journal of Marine Science and Engineering
- Vol. 13 (11) , 2119
Open AccessMKAIS: A Hybrid Mamba–KAN Neural Network for Vessel Trajectory Prediction
Vessel trajectory prediction (VTP) plays a critical role in maritime safety and intelligent navigation. Existing methods struggle to simultaneously capture long-term dependencies and nonlinear dynamic patterns in vessel movements. To address this challenge, we propose MKAIS, a novel trajectory prediction model that integrates the selective state space modeling capability of Mamba with the strong nonlinear representation power of Kolmogorov–Arnold Networks (KAN). Specifically, we design a feature-separated embedding strategy for AIS inputs (longitude, latitude, speed over ground, course over ground), followed by an MKAN module that jointly models global temporal dependencies and nonlinear dynamics. Experiments on the public ct_dma dataset demonstrate that MKAIS outperforms state-of-the-art baselines (LSTM, Transformer, TrAISformer, Mamba), achieving up to 16.65% improvement in the Haversine distance over 3 h prediction horizons. These results highlight the effectiveness and robustness of MKAIS for both short-term and long-term vessel trajectory prediction.
- 16 August 2025
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 81 (13) , 1-24
A dual-evaluation-mode local-search for the minimum dominating set problem on ultra-large sparse graphs
- 16 August 2025
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 81 (13) , 1-24
A dual-evaluation-mode local-search for the minimum dominating set problem on ultra-large sparse graphs
- 14 February 2025
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 81 (3) , 1-32
An adaptive focal distance tabu search approach for the minimum 2-connected dominating set problem
- 14 February 2025
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 81 (3) , 1-32
An adaptive focal distance tabu search approach for the minimum 2-connected dominating set problem
- Open Access
- 7 January 2025
- Published by MDPI AG in Electronics
- Vol. 14 (2) , 216
Interactive, Enhanced Dual Hypergraph Model for Explainable Contrastive Learning Recommendation
In recent years, it has become a hot topic to combine graph neural networks with contrastive learning, a method which has been applied not only in recommendation tasks but has also achieved impressive results in many fields, such as text processing and spatio-temporal modeling. However, existing methods are still constrained by several issues: (1) Most graph learning methods do not explore the imbalance of node and edge type distribution caused by different user–item interactions. (2) The randomness of data expansion and sampling strategies in contrastive learning may lead to confusion about the importance of key items for users. To overcome the problems, in this paper, we propose an explanation-guided contrastive recommendation model based on interactive message propagation and dual-hypergraph convolution (ECR-ID). Specifically, we designed two different interactive propagation mechanisms for the user–item dual-hypergraph sets to promote comprehensive dynamic information propagation and exchange, which further mitigates the imbalance problem of hyperedges and nodes in the hypergraph convolution, as well as the propagation loss of synergistic information between nodes. In addition, we developed an explanation-guided contrastive learning framework, which highlights the important items in user–item interactions through an explanation-based approach and guided the training of the contrastive learning framework based on the differences in the importance scores of the items, thus generating accurate positive and negative views and improving the contrastive learning performance. Finally, we integrated the contrastive learning framework with the dual-hypergraph networks based on joint training to further improve the recommendation performance. Extensive experimental evaluations on real datasets show that ECR-ID outperforms state-of-the-art recommendation algorithms. In the future, we will conduct in-depth tests based on a wider range of real-world datasets to alleviate the limitation that the existing experimental datasets all comprise data from single business services like Alibaba and Amazon, thus validating the effectiveness of our model more comprehensively.
- 7 January 2025
- Published by MDPI AG in Electronics
- Vol. 14 (2) , 216
Open AccessInteractive, Enhanced Dual Hypergraph Model for Explainable Contrastive Learning Recommendation
In recent years, it has become a hot topic to combine graph neural networks with contrastive learning, a method which has been applied not only in recommendation tasks but has also achieved impressive results in many fields, such as text processing and spatio-temporal modeling. However, existing methods are still constrained by several issues: (1) Most graph learning methods do not explore the imbalance of node and edge type distribution caused by different user–item interactions. (2) The randomness of data expansion and sampling strategies in contrastive learning may lead to confusion about the importance of key items for users. To overcome the problems, in this paper, we propose an explanation-guided contrastive recommendation model based on interactive message propagation and dual-hypergraph convolution (ECR-ID). Specifically, we designed two different interactive propagation mechanisms for the user–item dual-hypergraph sets to promote comprehensive dynamic information propagation and exchange, which further mitigates the imbalance problem of hyperedges and nodes in the hypergraph convolution, as well as the propagation loss of synergistic information between nodes. In addition, we developed an explanation-guided contrastive learning framework, which highlights the important items in user–item interactions through an explanation-based approach and guided the training of the contrastive learning framework based on the differences in the importance scores of the items, thus generating accurate positive and negative views and improving the contrastive learning performance. Finally, we integrated the contrastive learning framework with the dual-hypergraph networks based on joint training to further improve the recommendation performance. Extensive experimental evaluations on real datasets show that ECR-ID outperforms state-of-the-art recommendation algorithms. In the future, we will conduct in-depth tests based on a wider range of real-world datasets to alleviate the limitation that the existing experimental datasets all comprise data from single business services like Alibaba and Amazon, thus validating the effectiveness of our model more comprehensively.
- Open Access
- 20 December 2024
- Published by Faculty of Transport and Traffic Sciences in Promet - Traffic&Transportation
- Vol. 36 (6) , 1160-1175
Vessel Trajectory Prediction Method Based on the Time Series Data Fusion Model
Vessel trajectory prediction is important in maritime traffic safety and emergency management. Vessel trajectory prediction using vessel automatic identification system (AIS) data has attracted wide attention. Deep learning techniques have been widely applied to vessel trajectory prediction tasks due to their advantages in fine-grained feature learning and time series modelling. However, most deep learning-based methods use a unified approach for modelling AIS data, ignoring the diversity of AIS data and the impact of noise on prediction performance due to environmental factors. To address this issue, this study introduces a method consisting of temporal convolutional network (TCN), convolutional neural network (CNN) and convolutional long short-term memory (ConvLSTM) to predict vessel trajectories, called TCC. The model employs TCN to capture the complex correlation of the time series, utilises CNN to capture the fine-grained covariate features and then captures the dynamics and complexity of the trajectory sequences through ConvLSTM to predict vessel trajectories. Experiments are conducted on real public datasets, and the results show that the TCC model proposed in this paper outperforms the existing baseline algorithms with high accuracy and robustness in vessel trajectory prediction.
- 20 December 2024
- Published by Faculty of Transport and Traffic Sciences in Promet - Traffic&Transportation
- Vol. 36 (6) , 1160-1175
Open AccessVessel Trajectory Prediction Method Based on the Time Series Data Fusion Model
Vessel trajectory prediction is important in maritime traffic safety and emergency management. Vessel trajectory prediction using vessel automatic identification system (AIS) data has attracted wide attention. Deep learning techniques have been widely applied to vessel trajectory prediction tasks due to their advantages in fine-grained feature learning and time series modelling. However, most deep learning-based methods use a unified approach for modelling AIS data, ignoring the diversity of AIS data and the impact of noise on prediction performance due to environmental factors. To address this issue, this study introduces a method consisting of temporal convolutional network (TCN), convolutional neural network (CNN) and convolutional long short-term memory (ConvLSTM) to predict vessel trajectories, called TCC. The model employs TCN to capture the complex correlation of the time series, utilises CNN to capture the fine-grained covariate features and then captures the dynamics and complexity of the trajectory sequences through ConvLSTM to predict vessel trajectories. Experiments are conducted on real public datasets, and the results show that the TCC model proposed in this paper outperforms the existing baseline algorithms with high accuracy and robustness in vessel trajectory prediction.
- 12 November 2024
- Published by Springer Nature
- p. 216-231
An In-Label Prioritizing Variable Branching Strategy of SAT Solvers for a Preferred Extension of Argumentation Frameworks
- 12 November 2024
- Published by Springer Nature
- p. 216-231
An In-Label Prioritizing Variable Branching Strategy of SAT Solvers for a Preferred Extension of Argumentation Frameworks
- 17 October 2024
- Published by Springer Nature in Cluster Computing
- Vol. 28 (1) , 1-18
Dynamic deep graph convolution with enhanced transformer networks for time series anomaly detection in IoT
- 17 October 2024
- Published by Springer Nature in Cluster Computing
- Vol. 28 (1) , 1-18
Dynamic deep graph convolution with enhanced transformer networks for time series anomaly detection in IoT
- Open Access
- 29 August 2024
- Published by MDPI AG in Applied Sciences
- Vol. 14 (17) , 7656
A Four-Label-Based Algorithm for Solving Stable Extension Enumeration in Abstract Argumentation Frameworks
In abstract argumentation frameworks, the computation of stable extensions is an important semantic task for evaluating the acceptability of arguments. The current approaches for the computation of stable extensions are typically conducted through methodologies that are either label-based or extension-based. Label-based algorithms operate by assigning labels to each argument, thus reducing the attack relations between arguments to constraint relations among the labels. This paper analyzes the existing two-label and three-label enumeration algorithms for stable extensions through case studies. It is found that both the two-label and three-label algorithms are not precise enough in defining types of arguments. To address these issues, this paper proposes a four-label enumeration algorithm for stable extensions. This method introduces a label to pre-mark certain -type arguments, thereby achieving a finer classification of -type arguments. This enhances the labelings’ propagation ability and reduces the algorithm’s search space. Our proposed four-label algorithm was tested on authoritative benchmark sets of abstract argumentation framework problems: ICCMA 2019, ICCMA 2021, and ICCMA 2023. Experimental results show that the four-label algorithm significantly improves solving efficiency compared to existing two-label and three-label algorithms. Additionally, ablation experiments confirm that both the four-label transition strategy and preprocessing strategy enhance the algorithm’s performance.- 29 August 2024
- Published by MDPI AG in Applied Sciences
- Vol. 14 (17) , 7656
Open AccessA Four-Label-Based Algorithm for Solving Stable Extension Enumeration in Abstract Argumentation Frameworks
In abstract argumentation frameworks, the computation of stable extensions is an important semantic task for evaluating the acceptability of arguments. The current approaches for the computation of stable extensions are typically conducted through methodologies that are either label-based or extension-based. Label-based algorithms operate by assigning labels to each argument, thus reducing the attack relations between arguments to constraint relations among the labels. This paper analyzes the existing two-label and three-label enumeration algorithms for stable extensions through case studies. It is found that both the two-label and three-label algorithms are not precise enough in defining types of arguments. To address these issues, this paper proposes a four-label enumeration algorithm for stable extensions. This method introduces a label to pre-mark certain -type arguments, thereby achieving a finer classification of -type arguments. This enhances the labelings’ propagation ability and reduces the algorithm’s search space. Our proposed four-label algorithm was tested on authoritative benchmark sets of abstract argumentation framework problems: ICCMA 2019, ICCMA 2021, and ICCMA 2023. Experimental results show that the four-label algorithm significantly improves solving efficiency compared to existing two-label and three-label algorithms. Additionally, ablation experiments confirm that both the four-label transition strategy and preprocessing strategy enhance the algorithm’s performance.