Li Liu 0030

dblp:33/4528-30 · DBLP profile ↗
← Back
26ranked-venue papers
6as first author
19since 2021 · last 2026
0000-0002-8929-4871ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 14 · 4 first-author · 10 since 2021Databases, data management, data science and information retrieval · 8 · 2 first-author · 6 since 2021Applied, interdisciplinary, general and emerging computing · 3 · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1
YearPublicationVenuePosition
2026 Granular-ball based robust representation learning for social recommendation
Xiaofei Zhu, Shiyan Wu, Li Liu 0030, Shuyin Xia, Yi Wang 0004, Guoyin Wang 0001
Eng. Appl. Artif. Intell.3
2025 Enhancing Explanations of Graph Neural Networks via Bridging Model-Level and Instance-Level Explainers
Youmin Zhang 0006, Qun Liu 0005, Guoyin Wang 0001, Lili Yang 0001, Li Liu 0030
DASFAA (3)5
2025 Enhancing graph representation learning via type-aware decoupling and node influence allocation
Guochang Zhu, Jun Hu 0002, Li Liu 0030, Qinghua Zhang 0001, Guoyin Wang 0001
Appl. Intell.3
2025 A deep recommendation model based on semantic information and correlation between items
Jiani Duan, Jun Hu 0002, Fujin Zhong, Li Liu 0030, Qinghua Zhang 0001
J. Intell. Inf. Syst.4
2025 Learning model-level explanations of graph neural networks via subgraph order embedding space
Li Liu 0030, Pengyu Wan, Feiyan Zhang, Youmin Zhang 0006, Qun Liu 0005, Guoyin Wang 0001
Neural Networks1
2024 APK-MRL: An Adaptive Pre-training Framework with Knowledge-enhanced for Molecular Representation Learning
abstract
As a dominant pre-training paradigm, molecular contrastive learning (MCL) has been proven effective in learning molecular representations with unlabeled data. However, high data dependency and scarce domain knowledge caused by data augmentation in MCL limit the model’s generalization and performance. To address these issues, we propose an adaptive pre-training framework with knowledge-enhanced for molecular representation learning, named APK-MRL. It seamlessly integrates diverse prior information on hierarchical skeletons and the chemical semantics of molecules, aiming to obtain stronger stability and generalization. Extensive computational experiments demonstrate that APK-MRL can achieve competitive performances over state-of-the-art baselines on both drug-target interaction and molecular properties prediction tasks. All code is released at https://github.com/lukcats/APK-MRL.
Qun Liu 0005, Rui Han 0001, Li Liu 0030, Yike Guo, Guoyin Wang 0001
BIBM4
2024 Enhancing graph neural networks for self-explainable modeling: A causal perspective with multi-granularity receptive fields
Yuan Li 0050, Li Liu 0030, Penggang Chen, Guoyin Wang 0001
Inf. Process. Manag.2
2024 Towards explaining graph neural networks via preserving prediction ranking and structural dependency
Youmin Zhang 0006, William Kwok-Wai Cheung, Qun Liu 0005, Guoyin Wang 0001, Lili Yang 0001, Li Liu 0030
Inf. Process. Manag.6
2024 GEAR: Learning graph neural network explainer via adjusting gradients
Youmin Zhang 0006, Qun Liu 0005, Guoyin Wang 0001, William Kwok-Wai Cheung, Li Liu 0030
Knowl. Based Syst.5
2024 Self-supervised modal optimization transformer for image captioning
Ye Wang 0006, Daitianxia Li, Qun Liu 0005, Li Liu 0030, Guoyin Wang 0001
Neural Comput. Appl.4
2024 One-shot knowledge graph completion based on disentangled representation learning
Youmin Zhang 0006, Ye Wang 0006, Qun Liu 0005, Li Liu 0030
Neural Comput. Appl.5
2024 A Knowledge-Driven Self-Supervised Approach for Molecular Generation
abstract
Due to the great successes of Graph Neural Networks (GNN) in numerous fields, growing research interests have been devoted to applying GNN to molecular learning tasks. The molecule structure can be naturally represented as graphs where atoms and bonds refer to nodes and edges respectively. However, the atoms are not haphazardly stacked together but combined into various spatial geometries. Meanwhile, since chemical reactions mainly occur in substructures such as functional groups, the substructure plays a decisive role in the molecule's properties. Therefore, directly applying GNN to molecular representation learning could ignore the molecular spatial structure and the substructure properties which in turn degrades the performance of downstream tasks. In this paper, we propose Knowledge-Driven Self-Supervised Model for Molecular Representation Learning (KSMRL) to address above problems. The KSMRL consists of two major pathways: (1) the Spatial Information (SI) based pathway which preserves the spatial information of molecular structure, (2) the Subgraph Constraint (SC) based pathway which retains the properties of substructures into the molecular representation. In this manner, both the atomic level and substructure level information can be included in modeling. According to the experimental results on multiple datasets, the proposed KSMRL can generate discriminative molecular representations. In molecular generation tasks, KSMRL combined with Autoregressive Flow (AF) models or Discrete Flow (DF) models outperforms the state-of-the-art baselines over all datasets. In addition, we demonstrate the effectiveness of KSMRL with property optimization experiments. To indicate the ability of predicting specified potential Drug-Target Interactions (DTIs), a case study for discriminating the interactions between molecule generated by KSMRL and targets is also given.
Maotao Liu, Yifan Yang 0008, Qun Liu 0005, Li Liu 0030, Guoyin Wang 0001
IEEE ACM Trans. Comput. Biol. Bioinform.4
2024 WL-Align: Weisfeiler-Lehman Relabeling for Aligning Users Across Networks via Regularized Representation Learning
abstract
Aligning users across networks using graph representation learning has been found effective where the alignment is accomplished in a low-dimensional embedding space. Yet, highly precise alignment remains challenging, especially for nodes with long-range connectivity to labeled anchors. To alleviate this limitation, we propose WL-Align which employs a regularized representation learning framework to learn distinctive node representations. It extends the Weisfeiler-Lehman Isormorphism Test and learns the alignment in alternating phases of “across-network Weisfeiler-Lehman relabeling” and “proximity-preserving representation learning”. The across-network Weisfeiler-Lehman relabeling is achieved through iterating the anchor-based label propagation and a similarity-based hashing to exploit the known anchors’ connectivity to different nodes in an efficient and robust manner. The representation learning module preserves the second-order proximity within individual networks and is regularized by the across-network Weisfeiler-Lehman hash labels. Extensive experiments on real-world and synthetic datasets have demonstrated that our proposed WL-Align outperforms the state-of-the-art methods, achieving significant performance improvements in the “exact matching” scenario.
Li Liu 0030, Penggang Chen, Xin Li 0033, William Kwok-Wai Cheung, Youmin Zhang 0006, Qun Liu 0005, Guoyin Wang 0001
IEEE Trans. Knowl. Data Eng.1
2023 Interpreting open-domain dialogue generation by disentangling latent feature representations
Ye Wang 0006, Jingbo Liao, Hong Yu 0007, Guoyin Wang 0001, Li Liu 0030
Neural Comput. Appl.6
2023 Towards Improving Embedding Based Models of Social Network Alignment via Pseudo Anchors
abstract
Social network alignment aims at aligning person identities across social networks. Embedding based models have been shown effective for the alignment where the structural proximity preserving objective is typically adopted for the model training. With the observation that “overly-close” user embeddings are unavoidable for such models causing alignment inaccuracy, we propose a novel learning framework which tries to enforce the resulting embeddings to be more widely apart among the users via the introduction of carefully implanted pseudo anchors. We further proposed a meta-learning algorithm to guide the updating of the pseudo anchor embeddings during the learning process. The proposed intervention via the use of pseudo anchors and meta-learning allows the learning framework to be applicable to a wide spectrum of network alignment methods. We have incorporated the proposed learning framework into several state-of-the-art models. Our experimental results demonstrate its efficacy where the methods with the pseudo anchors implanted can outperform their counterparts without pseudo anchors by a fairly large margin, especially when there only exist very few labeled anchors.
Li Liu 0030, Xin Li 0033, William Kwok-Wai Cheung, Youmin Zhang 0006, Qun Liu 0005, Guoyin Wang 0001
IEEE Trans. Knowl. Data Eng.2
2022 HierMRL: Hierarchical Structure-Aware Molecular Representation Learning for Property Prediction
abstract
Deep graph neural networks have recently demonstrated powerful representation learning capabilities in bioinformatics. It is still crucial and challenging to design a representation model fusing the fundamental chemistry and biology knowledge. However, most existing representation models not only ignore domain knowledge but are also built on labeled datasets. To address this issue, this paper proposed a hierarchical structure-aware pre-training model that used contrastive learning to improve molecular representations with unlabeled datasets. We conducted comprehensive experiments on 13 molecular benchmark datasets from different application domains. The results demonstrate that our hierarchical structure-aware pre-trained model achieves superior performance against state-of-the-art baselines.
Maotao Liu, Yifan Yang 0008, Li Liu 0030, Qun Liu 0005
BIBM4
2022 EGNN: Constructing explainable graph neural networks via knowledge distillation
Yuan Li 0050, Li Liu 0030, Guoyin Wang 0001, Penggang Chen
Knowl. Based Syst.2
2022 LRP2A: Layer-wise Relevance Propagation based Adversarial attacking for Graph Neural Networks
Li Liu 0030, Ye Wang 0006, William Kwok-Wai Cheung, Youmin Zhang 0006, Qun Liu 0005, Guoyin Wang 0001
Knowl. Based Syst.1
2021 DSPNet: A low computational-cost network for human pose estimation
Fujin Zhong, Kun Zhang 0045, Jun Hu 0002, Li Liu 0030
Neurocomputing5
2020 Deep multi-granularity graph embedding for user identity linkage across social networks
Shun Fu, Guoyin Wang 0001, Shuyin Xia, Li Liu 0030
Knowl. Based Syst.4
2020 Structural Representation Learning for User Alignment Across Social Networks
abstract
Aligning users across different social networks has become increasingly studied as an important task to social network analysis. In this paper, we propose a novel representation learning method that mainly exploits social structures for the network alignment. In particular, the proposed network embedding framework models the follower-ship and followee-ship of each user explicitly as input and output context vectors, while preserving the proximity of users with “similar” followers and followees in the embedded space. We incorporate both known and predicted user anchors across the networks as constraints to facilitate the transfer of context information to achieve accurate user alignment. Both network embedding and user alignment are inferred under a unified optimization framework with negative sampling adopted to ensure scalability. Also, variants of the proposed framework, including the incorporation of higher-order structural features, are also explored for further boosting the alignment accuracy. Extensive experiments on large-scale social and academia network datasets demonstrate the efficacy of our proposed model compared with state-of-the-art methods.
Li Liu 0030, Xin Li 0033, William Kwok-Wai Cheung, Lejian Liao
IEEE Trans. Knowl. Data Eng.1
2018 Robust 2DLDA based on correntropy
Fujin Zhong, Li Liu 0030, Jun Hu 0002
Neurocomputing2
2016 A Novel Service Recommendation Approach Considering the User's Trust Network
Guoqiang Li 0003, Zibin Zheng, Zifen Yang, Zuoping Xu, Li Liu 0030
CollaborateCom6
2016 Aligning Users across Social Networks Using Network Embedding
Li Liu 0030, William Kwok-Wai Cheung, Xin Li 0033, Lejian Liao
IJCAI1
2016 FriendBurst: Ranking people who get friends fast in a short time
Li Liu 0030, Jie Tang 0001, Lejian Liao, Xin Li 0033, Jianguang Du
Neurocomputing1
2014 ReadBehavior: Reading Probabilities Modeling of Tweets via the Users' Retweeting Behaviors
Jianguang Du, Lejian Liao, Xin Li 0033, Li Liu 0030, Guoqiang Li 0003, Guanguo Gao, Guiying Wu
PAKDD (1)5