|
|
|
Representative papers are highlighted. |
|
Liang Li, Yinghua Yao, Ivona Martinovic, Xinwang Liu, Moyun Liu, Mandar Kulkarni, Yuangang Pan, Roland Huber, Mile Sikic Preprint , 2025
|
|
Liang Li, Yinghua Yao, Ivona Martinovic, Xinwang Liu, Mandar Kulkarni, Yuangang Pan, Roland Huber, Mile Sikic Preprint , 2025
|
|
Liang Li, Yuangang Pan, Yinghua Yao, Junpu Zhang, Moyun Liu, Xinwang Liu, Kenli Li, Keqin Li IEEE TPAMI (CCF-A, IF: 20.4) , 2025 [IEEE Xplore] / Paper / Code We take the first time to propose a novel multi-view bipartite graph clustering framework based on probabilistic graphical model. |
|
Liang Li, Yuangang Pan, Junpu Zhang, Jie Liu, Xinwang Liu, Kenli Li, Ivor W. Tsang, Keqin Li IEEE TKDE/ICDE Poster Track (CCF-A, IF: 11.6), 2025 [IEEE Xplore] / [pdf] / [Code] We revisit the consistency and specificity of LRP and LLP, and design a new unified structural fusion strategy to integrate both linear and locally linear structures from a global perspective. We reveal that the proposed structural fusion strategy is a generalization of LLP under a newly defined η-norm. |
|
Liang Li, Yuangang Pan, Jie Liu, Yue Liu, Xinwang Liu, Kenli Li, Ivor W. Tsang, Keqin Li IEEE TKDE/ICDE Poster Track (CCF-A, IF: 11.6), 2024 [IEEE Xplore] / [pdf] / [Code] We rethink existing paradigms and find that a common design is to construct the bipartite graph directly from the input data, i.e. only consider the unidirectional "encoding" process. Inspired by the popular "encoding-decoding" design in deep learning, we transfer it into graph machine learning and propose a novel model. |
|
Liang Li, Junpu Zhang, Siwei Wang, Xinwang Liu, Kenli Li, Keqin Li IEEE TKDE (CCF-A, IF: 11.6), 2023 [IEEE Xplore] / [pdf] / [Code] One crucial finding is that the existence of noisy features will incur "anchor shift", which deviates from the potential centroids. We propose a novel noisy feature filter mechanism to remedy the anchor shift, and we theoretically analyze the bounds of the bipartite graph's sparsity. |
|
Liang Li, Siwei Wang, Xinwang Liu, En Zhu, Li Shen, Kenli Li, Keqin Li IEEE TNNLS (CCF-B, IF: 9.7), 2022 [IEEE Xplore] / [pdf] / [Code] We investigate an important issue that how to localize the kernel matrix in multi-kernel clustering. Compared to the traditional KNN manner that neglects the ranking relationship of neighbors, this paper proposes a novel localized MKC algorithm coupled flexible graph learning, termd LSWMKC, which achieves fully exploring the latent local manifold. |
|
Junpu Zhang, Liang Li (Co-first author), Siwei Wang, Jiyuan Liu, Yue Liu, Xinwang Liu, En Zhu, ACM MM (CCF-A), 2022 [Link] / [pdf] / [Code] We mathematically disassemble the noise within kernel partition into dual noise, namely, Null space noise (N-noise) and Column space noise (C-noise), and propose an elegant method to minimize them. We observe that dual noise will pollute the block diagonal structures. An interesting finding is that C-noise exhibits stronger destruction than N-noise. |
|
|
Junpu Zhang, Liang Li(Co-first author), Xinwang Liu IEEE TNNLS (CCF-B, IF: 9.7) , 2024 [IEEE Xplore] / [pdf] / [Code] We propose an elegant diverse kernel partition fusion framework to get the optimal partition. |
|
Yuangang Pan, Yinghua Yao, Liang Li, Roland Huber, Mile Sikic, Ivona Martinovic Singapore Patent , 2025
|
![]() |
Yue Liu, Jiaying Wu, Yufei He, Ruihan Gong, Jun Xia, Liang Li, Hongcheng Gao, Hongyu Chen, Baolong Bi, Jiaheng Zhang, Zhiqi Huang, Bryan Hooi, Stan Z. Li, Keqin Li IEEE T-PAMI, 2026 Paper / Project We conduct a comprehensive survey on efficient inference for large reasoning models (LRMs). We categorize the existing methods into two main categories: explicit compact CoT and implicit latent CoT. We summarize the challenges and highlight further improvements. |
|
Yue Liu, Sihang Zhou, Xihong Yang, Xinwang Liu, Wenxuan Tu, Liang Li, Xin Xu, Fuchun Sun, IEEE T-NNLS(CCF-B, IF: 9.7), 2024 [IEEE Xplore] / [pdf] / [Code] / We explore deep-in reasons of representation collapse in deep graph clustering and improve the dual correlation reduction network with the affinity recovery strategy. |
|
Yue Liu, Xihong Yang, Sihang Zhou, Xinwang Liu, Siwei Wang, Ke Liang, Wenxuan Tu, Liang Li, IEEE TNNLS (CCF-B, IF: 9.7), 2023 [IEEE Xplore] / [pdf] / [Code] We propose to replace the complicated and consuming graph data augmentations by designing the parameter un-shared siamese encoders and perurbing the node embeddings. |
|
Yue Liu, Xihong Yang, Sihang Zhou, Xinwang Liu, Z. Wang, Ke Liang, Wenxuan Tu, Liang Li , Jingcan Duan, Cancan Chen AAAI (CCF-A, Oral presentation), 2023 [Link] / [pdf] / [Code] We propose Hard Sample Aware Network (HSAN) to mine both the hard positive samples and hard negative samples with a comprehensive similarity measure criterion and a general dynamic sample weighing strategy. |
|
Pei Zhang, Siwei Wang, Liang Li, Changwang. Zhang, Xinwang Liu, En Zhu, Zhe Liu, Lu Zhou, Lei Luo, AAAI (CCF-A), 2023 [Link] / [pdf] / [Code] We propose to fuse diverse bipartite graphs across multiple views that can avoid tune the anchor number manually. |
|
|
|
Design and source code from Jon Barron's website