Yue Liu

Yue Liu

Auto-generated profile, based on publicly available information

Yue Liu

National University of Singapore, Singapore, Singapore

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 June 2024 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
KLKe Liang
Ke Liang
LMLingyuan Meng
Lingyuan Meng
MLMeng Liu
Meng Liu
YLYue Liu
Yue Liu
WTWenxuan Tu
Wenxuan Tu
KHKunlun He
Kunlun He
Knowledge graph reasoning (KGR), aiming to deduce new facts from existing facts based on mined logic rules underlying knowledge graphs (KGs), has become a fast-growing research direction. It has been proven to significantly benefit the usage of KGs in many AI applications, such as question answering, recommendation systems, and etc. According to the graph types, existing KGR models can be roughly divided into three categories, i.e., static models, temporal models, and multi-modal models. Early works in this domain mainly focus on static KGR, and recent works try to leverage the temporal and multi-modal information, which are more practical and closer to real-world. However, no survey papers and open-source repositories comprehensively summarize and discuss models in this important direction. To fill the gap, we conduct a first survey for knowledge graph reasoning tracing from static to temporal and then to multi-modal KGs. Concretely, the models are reviewed based on bi-level taxonomy, i.e., top-level (graph types) and base-level (techniques and scenarios). Besides, the performances, as well as datasets, are summarized and presented. Moreover, we point out the challenges and potential opportunities to enlighten the readers.

12 June 2023 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
KLKe Liang
Ke Liang
YLYue Liu
Yue Liu
SZSihang Zhou
Sihang Zhou
WTWenxuan Tu
Wenxuan Tu
YWYi Wen
Yi Wen
XLXinwang Liu
Xinwang Liu
Knowledge graph embedding (KGE) aims at learning powerful representations to benefit various artificial intelligence applications. Meanwhile, contrastive learning has been widely leveraged in graph learning as an effective mechanism to enhance the discriminative capacity of the learned representations. However, the complex structures of KG make it hard to construct appropriate contrastive pairs. Only a few attempts have integrated contrastive learning strategies with KGE. But, most of them rely on language models ( e.g., Bert) for contrastive pair construction instead of fully mining information underlying the graph structure, hindering expressive ability. Surprisingly, we find that the entities within a relational symmetrical structure are usually similar and correlated. To this end, we propose a knowledge graph contrastive learning framework based on relation-symmetrical structure, KGE-SymCL, which mines symmetrical structure information in KGs to enhance the discriminative ability of KGE models. Concretely, a plug-and-play approach is proposed by taking entities in the relation-symmetrical positions as positive pairs. Besides, a self-supervised alignment loss is designed to pull together positive pairs. Experimental results on link prediction and entity classification datasets demonstrate that our KGE-SymCL can be easily adopted to various KGE models for performance improvements. Moreover, extensive experiments show that our model could outperform other state-of-the-art baselines.

26 October 2023
Verified
Conference Paper
Open access
XYXihong Yang
Xihong Yang
JJJin Jiaqi
Jin Jiaqi
SWSiwei Wang
Siwei Wang
KLKe Liang
Ke Liang
YLYue Liu
Yue Liu
EZEn Zhu
En Zhu
Benefiting from the strong view-consistent information mining capacity, multi-view contrastive clustering has attracted plenty of attention in recent years. However, we observe the following drawback, which limits the clustering performance from further improvement. The existing multi-view models mainly focus on the consistency of the same samples in different views while ignoring the circumstance of similar but different samples in cross-view scenarios. To solve this problem, we propose a novel Dual contrastive calibration network for Multi-View Clustering (DealMVC). Specifically, we first design a fusion mechanism to obtain a global cross-view feature. Then, a global contrastive calibration loss is proposed by aligning the view feature similarity graph and the high-confidence pseudo-label graph. Moreover, to utilize the diversity of multi-view information, we propose a local contrastive calibration loss to constrain the consistency of pair-wise view features. The feature structure is regularized by reliable class information, thus guaranteeing similar samples have similar features in different views. During the training procedure, the interacted cross-view feature is jointly optimized at both local and global levels. In comparison with other state-of-the-art approaches, the comprehensive experimental results obtained from eight benchmark datasets provide substantial validation of the effectiveness and superiority of our algorithm. We release the code of DealMVC at https://github.com/xihongyang1999/DealMVC on GitHub.

26 February 2024 in IEEE Transactions on Geoscience and Remote Sensing
Verified
Journal Article
Closed access
RGRenxiang Guan
Renxiang Guan
ZLZihao Li
Zihao Li
WTWenxuan Tu
Wenxuan Tu
JWJun Wang
Jun Wang
YLYue Liu
Yue Liu
RFRuyi Feng
Ruyi Feng
High-dimensional and complex spectral structures make the clustering of hyperspectral images (HSI) a challenging task. Subspace clustering is an effective approach for addressing this problem. However, current subspace clustering algorithms are primarily designed for a single view and do not fully exploit the spatial or textural feature information in HSI. In this study, contrastive multi-view subspace clustering of HSI was proposed based on graph convolutional networks. Pixel neighbor textural and spatial-spectral information were sent to construct two graph convolutional subspaces to learn their affinity matrices. To maximize the interaction between different views, a contrastive learning algorithm was introduced to promote the consistency of positive samples and assist the model in extracting robust features. An attention-based fusion module was used to adaptively integrate these affinity matrices, constructing a more discriminative affinity matrix. The model was evaluated using four popular HSI datasets: Indian Pines, Pavia University, Houston, and Xu Zhou. It achieved overall accuracies of 97.61%, 96.69%, 87.21%, and 97.65%, respectively, and significantly outperformed state-of-the-art clustering methods. In conclusion, the proposed model effectively improves the clustering accuracy of HSI. Our implementation is available at https://github.com/GuanRX/CMSCGC.
1

18 July 2023
Verified
Conference Paper
Open access
KLKe Liang
Ke Liang
LMLingyuan Meng
Lingyuan Meng
MLMeng Liu
Meng Liu
YLYue Liu
Yue Liu
WTWenxuan Tu
Wenxuan Tu
XLXinwang Liu
Xinwang Liu

26 October 2023
Verified
Conference Paper
Open access
XYXihong Yang
Xihong Yang
CTCheng Tan
Cheng Tan
YLYue Liu
Yue Liu
KLKe Liang
Ke Liang
SWSiwei Wang
Siwei Wang
EZEn Zhu
En Zhu