Liang Li

Liang Li

Auto-generated profile, based on publicly available information

Liang Li

College of Computer Science and Technology, National University of Defense Technology, Changsha, China

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
27 June 2023 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
YLYue Liu
Yue Liu
XYXihong Yang
Xihong Yang
SZSihang Zhou
Sihang Zhou
XLXinwang Liu
Xinwang Liu
SWSiwei Wang
Siwei Wang
LLLiang Li
Liang Li
Contrastive learning has recently attracted plenty of attention in deep graph clustering due to its promising performance. However, complicated data augmentations and time-consuming graph convolutional operations undermine the efficiency of these methods. To solve this problem, we propose a simple contrastive graph clustering (SCGC) algorithm to improve the existing methods from the perspectives of network architecture, data augmentation, and objective function. As to the architecture, our network includes two main parts, that is, preprocessing and network backbone. A simple low-pass denoising operation conducts neighbor information aggregation as an independent preprocessing, and only two multilayer perceptrons (MLPs) are included as the backbone. For data augmentation, instead of introducing complex operations over graphs, we construct two augmented views of the same vertex by designing parameter unshared Siamese encoders and perturbing the node embeddings directly. Finally, as to the objective function, to further improve the clustering performance, a novel cross-view structural consistency objective function is designed to enhance the discriminative capability of the learned network. Extensive experimental results on seven benchmark datasets validate our proposed algorithm’s effectiveness and superiority. Significantly, our algorithm outperforms the recent contrastive deep clustering competitors with at least seven times speedup on average. The code of SCGC is released at SCGC. Besides, we share a collection of deep graph clustering, including papers, codes, and datasets at ADGC.

27 April 2023 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
LLLiang Li
Liang Li
JZJunpu Zhang
Junpu Zhang
SWSiwei Wang
Siwei Wang
XLXinwang Liu
Xinwang Liu
KLKenli Li
Kenli Li
Keqin LiKeqin Li
Keqin Li
Unsupervised bipartite graph learning has been a hot topic in multi-view clustering, to tackle the restricted scalability issue of traditional full graph clustering in large-scale applications. However, the existing bipartite graph clustering paradigm pays little attention to the adverse impact of noisy features on learning process. To further facilitate this part of research, apart from simply reweighting features to depress the noisy ones, we take the first step towards analyzing the induced adverse impact via theoretical and experimental investigations. One crucial finding in this article is that the existence of noisy features will incur “anchor shift” phenomenon, which deviates from the potential representations of anchors and then degrades performance. To this end, we propose a coupled noisy feature filter mechanism with automatically finding feature importance to remedy the anchor shift issue in this article. Apart from leveraging features, we theoretically analyze the bounds of proposed feature-adaptive bipartite graph's fuzzy membership. Specifically, distinguishing features’ discrimination will increase the fuzzy membership to achieve soft partitions against the potential inaccurate absolute relationships. With the afore-mentioned merits, our proposed multi-view bipartite graph clustering with coupled noisy feature filter model (MVBGC-NFF) provides novel and interesting insights on the feature level of anchor shift. The effectiveness and efficiency of MVBGC-NFF are demonstrated on synthetic and real-world datasets with improved clustering performance, increasing fuzzy membership, and filtering noisy features. The code is available on https://github.com/liliangnudt/MVBGC-NFF .

15 July 2022 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
LLLiang Li
Liang Li
SWSiwei Wang
Siwei Wang
XLXinwang Liu
Xinwang Liu
EZEn Zhu
En Zhu
LSLi Shen
Li Shen
Keqin LiKeqin Li
Keqin Li
Multiple kernel clustering (MKC) is committed to achieving optimal information fusion from a set of base kernels. Constructing precise and local kernel matrices is proven to be of vital significance in applications since the unreliable distant–distance similarity estimation would degrade clustering performance. Although existing localized MKC algorithms exhibit improved performance compared with globally designed competitors, most of them widely adopt the KNN mechanism to localize kernel matrix by accounting for $\tau$ -nearest neighbors. However, such a coarse manner follows an unreasonable strategy that the ranking importance of different neighbors is equal, which is impractical in applications. To alleviate such problems, this article proposes a novel local sample-weighted MKC (LSWMKC) model. We first construct a consensus discriminative affinity graph in kernel space, revealing the latent local structures. Furthermore, an optimal neighborhood kernel for the learned affinity graph is output with naturally sparse property and clear block diagonal structure. Moreover, LSWMKC implicitly optimizes adaptive weights on different neighbors with corresponding samples. Experimental results demonstrate that our LSWMKC possesses better local manifold representation and outperforms existing kernel or graph-based clustering algorithms. The source code of LSWMKC can be publicly accessed from https://github.com/liliangnudt/LSWMKC.

19 July 2024 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
YLYue Liu
Yue Liu
SZSihang Zhou
Sihang Zhou
XYXihong Yang
Xihong Yang
XLXinwang Liu
Xinwang Liu
WTWenxuan Tu
Wenxuan Tu
FSFuchun Sun
Fuchun Sun
Deep graph clustering, which aims to reveal the underlying graph structure and divide the nodes into different clusters without human annotations, is a fundamental yet challenging task. However, we observe that the existing methods suffer from the representation collapse problem and tend to encode samples with different classes into the same latent embedding. Consequently, the discriminative capability of nodes is limited, resulting in suboptimal clustering performance. To address this problem, we propose a novel deep graph clustering algorithm termed improved dual correlation reduction network (IDCRN) through improving the discriminative capability of samples. Specifically, by approximating the cross-view feature correlation matrix to an identity matrix, we reduce the redundancy between different dimensions of features, thus improving the discriminative capability of the latent space explicitly. Meanwhile, the cross-view sample correlation matrix is forced to approximate the designed clustering-refined adjacency matrix to guide the learned latent representation to recover the affinity matrix even across views, thus enhancing the discriminative capability of features implicitly. Moreover, we avoid the collapsed representation caused by the oversmoothing issue in graph convolutional networks (GCNs) through an introduced propagation regularization term, enabling IDCRN to capture the long-range information with the shallow network structure. Extensive experimental results on six benchmarks have demonstrated the effectiveness and efficiency of IDCRN compared with the existing state-of-the-art deep graph clustering algorithms. The code of IDCRN is released at https://github.com/yueliu1999/IDCRN. Besides, we share a collection of deep graph clustering, including papers, codes, and datasets at https://github.com/yueliu1999/Awesome-Deep-Graph-Clustering.

1 February 2021 in Aerospace Science and Technology
Verified
Journal Article
Closed access
HWHongbo Wang
Hongbo Wang
XSXiliang Song
Xiliang Song
LLLiang Li
Liang Li
YHYuhui Huang
Yuhui Huang
MSMingbo Sun
Mingbo Sun

7 February 2024 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
LLLiang Li
Liang Li
YPYuangang Pan
Yuangang Pan
JLJie Liu
Jie Liu
YLYue Liu
Yue Liu
XLXinwang Liu
Xinwang Liu
Keqin LiKeqin Li
Keqin Li
Unsupervised multi-view bipartite graph clustering (MVBGC) is a fast-growing research, due to promising scalability in large-scale tasks. Although many variants are proposed by various strategies, a common design is to construct the bipartite graph directly from the input data, i.e. only consider the unidirectional “encoding” process. However, “encoding-decoding” mechanism is a popular design for deep learning, the most representative one is auto-encoder (AE). Enlightened by this, this paper rethinks existing MVBGC paradigms and transfers the “encoding-decoding” design into graph machine learning, and proposes a novel framework termed auto-encoding multi-view bipartite graph clustering (BGAE), which integrates encoding, bipartite graph construction, and decoding modules in a self-supervised learning manner. The encoding module extracts a latent joint representation from the input data, the bipartite graph construction module learns a bipartite graph with connectivity constraint in latent semantic space, and the decoding module recreates the input data via the bipartite graph. Therefore, our novel BGAE combines representation learning, bipartite graph learning, reconstruction learning, and label inference into a unified framework. All the modules are seamlessly integrated and mutually reinforcing for clustering-friendly purposes. Extensive experiments verify the superiority of our novel design and the significance of “decoding” process. To the best of our knowledge, this is the first attempt to explore “encoding-decoding” design in traditional MVBGC. The code is provided at https://github.com/liliangnudt/BGAE .