1 code implementation • NAACL 2022 • Shu Liu, Kaiwen Li, Zuhe Li
Aspect sentiment triplet extraction (ASTE) is a challenging subtask in aspect-based sentiment analysis.
Aspect-Based Sentiment Analysis Aspect-Based Sentiment Analysis (ABSA) +2
no code implementations • 4 Jul 2023 • Rui Wang, Zhiming Zhou, Tao Zhang, Ling Wang, Xin Xu, Xiangke Liao, Kaiwen Li
The proposed model, which combines the graph neural network and the pointer mechanism, can effectively map from the solver state to the branching variable decisions.
1 code implementation • 2 Dec 2022 • Wenhua Li, Xingyi Yao, Kaiwen Li, Rui Wang, Tao Zhang, Ling Wang
To address the above two issues, in this study, a novel coevolutionary framework termed CoMMEA for multimodal multi-objective optimization is proposed to better obtain both global and local PSs, and simultaneously, to improve the convergence performance in dealing with high-dimension MMOPs.
no code implementations • 21 Jun 2022 • Wei Liu, Rui Wang, Tao Zhang, Kaiwen Li, Wenhua Li, Hisao Ishibuchi
Multi-objective orienteering problems (MO-OPs) are classical multi-objective routing problems and have received a lot of attention in the past decades.
no code implementations • 25 Apr 2022 • Kaiwen Li, Tao Zhang, Rui Wang, Ling Wang
The model is trained using a deep reinforcement learning method offline, and is used to optimize the UAV routing problem online.
no code implementations • 25 Apr 2022 • Wei Liu, Tao Zhang, Rui Wang, Kaiwen Li, Wenhua Li, Kang Yang
A dynamic pointer network (DYPN) is introduced as the TSP solver, which takes city locations as inputs and immediately outputs a permutation of nodes.
no code implementations • 11 Feb 2021 • Kaiwen Li, Tao Zhang, Rui Wang Yuheng Wang, Yi Han
This paper introduces a new deep learning approach to approximately solve the Covering Salesman Problem (CSP).
no code implementations • 6 Jun 2019 • Kaiwen Li, Tao Zhang, Rui Wang
The solutions can be directly obtained by a simple forward calculation of the neural network; thereby, no iteration is required and the MOP can be always solved in a reasonable time.