← Search

KE LIANG

40 accepted papers

2026

A General Anchor-Based Framework for Scalable Fair Clustering

AAAI 2026technical

Fair clustering is crucial for mitigating bias in unsupervised learning, yet existing algorithms often suffer from quadratic or super-quadratic computational complexity, rendering them impractical for large-scale datasets. To bridge this gap, we introduce the Anchor-based Fair Clustering Framework (

Cited by 0SourcePDFScholar
2026

CCLRec: Consensus-driven Contrastive Learning for LLM-enhanced Graph Recommendation

ICML 2026poster

Recommendation systems seek to accurately model user preferences from a large set of candidate items. Graph neural networks (GNNs) have emerged as a dominant approach in this domain due to their ability to capture high-order user–item interactions. Recent efforts have aimed to enhance GNN-based repr…

Cited by 0SourceScholar
2026

CLUENet: Cluster Attention Makes Neural Networks Have Eyes

AAAI 2026technical

Despite the success of convolution- and attention-based models in vision tasks, their rigid receptive fields and complex architectures limit their ability to model irregular spatial patterns and hinder interpretability, thereby posing challenges for tasks requiring high model transparency. Clusterin

Cited by 0SourcePDFScholar
2026

DAWN: Distributed LLM Multi-Agent Workflow Synthesis

AAAI 2026technical

Large language models (LLMs) have recently empowered multi-agent systems (MAS) to achieve remarkable advances in collaborative reasoning and complex task automation. The effectiveness of these systems fundamentally depends on the design of adaptive communication graphs—the underlying workflows that

Cited by 0SourcePDFScholar
2026

DMCAR: Disentangled Mixture-of-Experts with Context-Aware Routing for Multi-View Clustering

AAAI 2026technical

Multi-View Clustering (MVC) aims to enhance clustering performance by integrating multi-source complementary information. However, existing deep MVC methods face inherent challenges in balancing the learning of shared consensus representations with the preservation of view-specific information: inde

Cited by 0SourcePDFScholar
2026

Hierarchical Anchor Graph Learning for Multi-View Clustering

ICML 2026poster

Multi-view clustering (MVC) is a fundamental task in heterogeneous data analysis, where anchor-based graph methods are widely adopted for their computational efficiency. However, existing approaches typically utilize static, single-layer anchors, failing to capture the multi-granularity nature of co…

Cited by 0SourceScholar
2026

Hierarchical Cross-View Alignment for Multi-View Clustering via Decoupled Information Distillation

AAAI 2026technical

Multi-view clustering aims to uncover shared semantics and complementary information across different views. However, the inherent heterogeneity among views poses significant challenges to effective collaborative modeling and information integration. While recent studies have introduced distillation

Cited by 0SourcePDFScholar
2026

ImgCoT: Compressing Long Chain of Thought into Compact Visual Tokens for Efficient Reasoning of Large Language Model

ICML 2026poster

Compressing long chains of thought (CoT) into compact latent tokens is crucial for efficient reasoning with large language models (LLMs). Recent studies employ autoencoders to achieve this by reconstructing textual CoT from latent tokens, thus encoding CoT semantics. However, treating textual CoT as…

Cited by 0SourceScholar
2026

MV-FGAD: Towards Efficient and Effective Federated Graph Anomaly Detection via Multi-view Learning

ICML 2026oral

Federated graph anomaly detection (GAD) aims to identify abnormal nodes in distributed subgraphs through collaborative learning. However, existing methods suffer from two limitations. 1) Their reliance on neighborhood aggregation assumes that anomalous information can be sufficiently captured, which…

Cited by 0SourceScholar
2026

Make Model Transparent: Brain Network Analysis via Causal and Knowledge Graph Learning

AAAI 2026technical

Brain network analysis technology reveals the organizational mechanism and information processing mode by constructing the structural connection network between brain regions. It has achieved satisfactory results in brain disease prediction tasks, promoting the progress of neuroscience. In recent ye

Cited by 0SourcePDFScholar
2026

PhenoBrain: Phenotype-Conditioned Long-Range Communication for Multi-Modal Brain Network Analysis

ICML 2026oral

Multi-modal brain network analysis aims to predict neuropsychiatric status from functional connectomes with heterogeneous phenotypes. However, most existing methods treat phenotypes as auxiliary features and perform late fusion, implicitly assuming that the connectome representation should be learne…

Cited by 0SourceScholar
2026

Plug-and-Play Incomplete Multi-View Clustering via Janus-Faced Affinity Learning with Topology Harmonization

CVPR 2026

Prevailing incomplete multi-view clustering (IMVC) approaches typically fail to account for the interference of view-exclusive artifacts when learning view-consensus representations, which could compromise the fidelity of the resulting similarity measure. Moreover, inconsistencies in anchor order ac

Cited by 0SourceScholar
2026

PurMM: Attention-Guided Test-Time Backdoor Purification in Multimodal Large Language Models

AAAI 2026technical

Downstream fine-tuning of Multimodal Large Language Models (MLLMs) is advancing rapidly, allowing general models to achieve superior performance on domain-specific tasks. Yet most prior research focuses on performance gains and overlooks the vulnerability of the fine-tuning pipeline: attackers can e

Cited by 0SourcePDFScholar
2026

TVChain: Leveraging Textual-Visual Prompt Chains for Jailbreaking Large Vision-Language Models

AAAI 2026technical

Large Vision-Language Models (LVLMs) enhance the capabilities of Large Language Models by integrating visual inputs, thereby enabling advanced multimodal reasoning across diverse applications. However, these enhanced reasoning capabilities introduce new security risks, particularly to jailbreaking a

Cited by 0SourcePDFScholar
2025

Breaking the Gradient Barrier: Unveiling Large Language Models for Strategic Classification

NeurIPS 2025poster

Strategic classification (SC) explores how individuals or entities modify their features strategically to achieve favorable classification outcomes. However, existing SC methods, which are largely based on linear models or shallow neural networks, face significant limitations in terms of scalability…

Cited by 0SourceScholar
2025

COKE: Core Kernel for More Efficient Approximation of Kernel Weights in Multiple Kernel Clustering

ICML 2025poster

Inspired by the well-known coreset in clustering algorithms, we introduce the definition of the core kernel for multiple kernel clustering (MKC) algorithms. The core kernel refers to running MKC algorithms on smaller-scale base kernel matrices to obtain kernel weights similar to those obtained from…

Cited by 0SourcePDFScholar
2025

EASEMVC:Efficient Dual Selection Mechanism for Deep Multi-View Clustering

CVPR 2025poster

Multi-view clustering represents one of the most established paradigms within the field of unsupervised learning and has witnessed a surge in popularity in recent years. View-pair form contrastive learning allows for consistently representing multiple views by maximizing mutual information between e…

Cited by 0SourcePDFScholar
2025

Efficient Federated Incomplete Multi-View Clustering

ICML 2025poster

Multi-view clustering (MVC) leverages complementary information from diverse data sources to enhance clustering performance. However, its practical deployment in distributed and privacy-sensitive scenarios remains challenging. Federated multi-view clustering (FMVC) has emerged as a potential solutio…

2025

Enhanced then Progressive Fusion with View Graph for Multi-View Clustering

CVPR 2025poster

Multi-view clustering aims to improve clustering accuracy by effectively integrating complementary information from multiple perspectives. However, existing methods often encounter challenges such as feature conflicts between views and insufficient enhancement of individual view features, which hind…

Cited by 0SourcePDFScholar
2025

FS-KEN: Few-shot Knowledge Graph Reasoning by Adversarial Negative Enhancing

IJCAI 2025

Few-shot knowledge graph reasoning (FS-KGR) try to infer missing facts in a knowledge graphs using limited data (such as only 3/5 samples).Existing strategies have shown good performance by mining more supervised information for few-shot learning through meta-learning and self-supervised learning. H

Cited by 0SourcePDFScholar
2025

Flow Matching for Denoised Social Recommendation

ICML 2025poster

Graph-based social recommendation (SR) models suffer from various noises of the social graphs, hindering their recommendation performances. Either graph-level redundancy or graph-level missing will indeed influence the social graph structures, further influencing the message propagation procedure of…

Cited by 0SourcePDFScholar
2025

From Spectrum-free towards Baseline-view-free: Double-track Proximity Driven Multi-view Clustering

ICML 2025poster

Current multi-view clustering (MVC) techniques generally focus only on the relationship between anchors and samples, while overlooking that between anchors. Moreover, due to the lack of data labels, the cluster order is inconsistent across views and accordingly anchors encounter misalignment, whi…

Cited by 0SourcePDFScholar
2025

Incomplete Multi-view Deep Clustering with Data Imputation and Alignment

NeurIPS 2025poster

Incomplete multi-view deep clustering is an emerging research hot-pot to incorporate data information of multiple sources or modalities when parts of them are missing. Most of existing approaches encode the available data observations into multiple view-specific latent representations and subsequent…

Cited by 0SourceScholar
2025

Knowledge Graph Completion with Relation-Aware Anchor Enhancement

AAAI 2025technical

Text-based knowledge graph completion methods take advantage of pre-trained language models (PLM) to enhance intrinsic semantic connections of raw triplets with detailed text descriptions. Typical methods in this branch map an input query (textual descriptions associated with an entity and a relatio…

2025

Large-scale Multi-view Tensor Clustering with Implicit Linear Kernels

CVPR 2025poster

Multi-view clustering is a long-standing hot topic in machine learning communities, due to its capability of integrating data information from multiple sources and modalities. By utilizing tensor Singular Value Decomposition (t-SVD) technique with the tensor rotation trick, recent advances have achi…

2025

On the Adversarial Robustness of Multi-Kernel Clustering

ICML 2025poster

Multi-kernel clustering (MKC) has emerged as a powerful method for capturing diverse data patterns, offering robust and generalized representations of data structures. However, the increasing deployment of MKC in real-world applications raises concerns about its vulnerability to adversarial perturba…

Cited by 0SourcePDFScholar
2025

SAINT: Sequence-Aware Integration for Spatial Transcriptomics Multi-View Clustering

NeurIPS 2025poster

Spatial transcriptomics (ST) technologies provide gene expression measurements with spatial resolution, enabling the dissection of tissue structure and function. A fundamental challenge in ST analysis is clustering spatial spots into coherent functional regions. While existing models effectively int…

Cited by 0SourceScholar
2025

Skip-Thinking: Chunk-wise Chain-of-Thought Distillation Enable Smaller Language Models to Reason Better and Faster

EMNLP 2025

Chain-of-thought (CoT) distillation allows a large language model (LLM) to guide a small language model (SLM) in reasoning tasks. Existing methods train the SLM to learn the long rationale in one iteration, resulting in two issues: 1) Long rationales lead to a large token-level batch size during tra

Cited by 0SourcePDFScholar
2025

Social Recommendation via Graph-Level Counterfactual Augmentation

AAAI 2025technical

Traditional recommendation system focus more on the correlations between users and items (user-item relationships), while research on user-user relationships has received significant attention these years, which is also known as social recommendation. Graph-based models have achieved a great success…

Cited by 0SourcePDFScholar
2025

Soft Reasoning Paths for Knowledge Graph Completion

IJCAI 2025

Reasoning paths are reliable information in knowledge graph completion (KGC) in which algorithms can find strong clues of the actual relation between entities. However, in real-world applications, it is difficult to guarantee that computationally affordable paths exist toward all candidate entities.

2024

Alleviate Anchor-Shift: Explore Blind Spots with Cross-View Reconstruction for Incomplete Multi-View Clustering

NeurIPS 2024poster

Incomplete multi-view clustering aims to learn complete correlations among samples by leveraging complementary information across multiple views for clustering. Anchor-based methods further establish sample-level similarities for representative anchor generation, effectively addressing scalability i…

Cited by 0SourcePDFScholar
2024

Clustering then Propagation: Select Better Anchors for Knowledge Graph Embedding

NeurIPS 2024poster

Traditional knowledge graph embedding (KGE) models map entities and relations to unique embedding vectors in a shallow lookup manner. As the scale of data becomes larger, this manner will raise unaffordable computational costs. Anchor-based strategies have been treated as effective ways to alleviate…

Cited by 0SourcePDFScholar
2024

From Text to Historical Ecological Knowledge: The Construction and Application of the Shan Jing Knowledge Base

COLING 2024main

Traditional Ecological Knowledge (TEK) has been recognized as a shared cultural heritage and a crucial instrument to tackle today’s environmental challenges. In this paper, we deal with historical ecological knowledge, a special type of TEK that is based on ancient language texts. In particular, we…

Cited by 1SourcePDFScholar
2024

Hawkes-Enhanced Spatial-Temporal Hypergraph Contrastive Learning Based on Criminal Correlations

AAAI 2024technical

Crime prediction is a crucial yet challenging task within urban computing, which benefits public safety and resource optimization. Over the years, various models have been proposed, and spatial-temporal hypergraph learning models have recently shown outstanding performances. However, three correlati…

Cited by 7SourcePDFScholar
2024

Learn from View Correlation: An Anchor Enhancement Strategy for Multi-view Clustering

CVPR 2024poster

In recent years anchor-based methods have achieved promising progress in multi-view clustering. The performances of these methods are significantly affected by the quality of the anchors. However the anchors generated by previous works solely rely on single-view information ignoring the correlation…

Cited by 11SourcePDFScholar
2024

MINES: Message Intercommunication for Inductive Relation Reasoning over Neighbor-Enhanced Subgraphs

AAAI 2024technical

GraIL and its variants have shown their promising capacities for inductive relation reasoning on knowledge graphs. However, the uni-directional message-passing mechanism hinders such models from exploiting hidden mutual relations between entities in directed graphs. Besides, the enclosing subgraph e…

Cited by 38SourcePDFScholar
2023

Dink-Net: Neural Clustering on Large Graphs

ICML 2023poster

Deep graph clustering, which aims to group the nodes of a graph into disjoint clusters with deep neural networks, has achieved promising progress in recent years. However, the existing methods fail to scale to the large graph with million nodes. To solve this problem, a scalable deep graph clusterin…

2023

Hard Sample Aware Network for Contrastive Deep Graph Clustering

AAAI 2023technical

Contrastive deep graph clustering, which aims to divide nodes into disjoint groups via contrastive mechanisms, is a challenging research spot. Among the recent works, hard sample mining-based algorithms have achieved great attention for their promising performance. However, we find that the existing…