← Search

Cuiying Huo

8 accepted papers

2026

Discriminative Attribute Graph Clustering Through Topology-Guided Contrastive Learning

ICML 2026poster

Deep attribute graph clustering aims to learn discriminative node representations by leveraging both node attributes and graph topology to partition nodes into distinct clusters. Although substantial progress has been made in attribute-graph clustering in recent years, two key challenges remain: noi…

Cited by 0SourceScholar
2026

DuoKD: Dual Knowledge Distillation from Large Language Models for Robust Graph Neural Networks

AAAI 2026technical

Graph neural networks (GNNs) have become a dominant modeling paradigm for graph-structured data, and the emergence of large language models (LLMs) has spurred growing interest in integrating external semantic knowledge into GNNs. Current LLM-based GNNs are devoted to extracting semantically similar

Cited by 0SourcePDFScholar
2026

Multi-Semantic Aware Self-Supervised Learning for Multi-Label Node Classification

IJCAI 2026

Graph self-supervised learning aims to mine intrinsic signals from graph data itself to train models. It enables the acquisition of high-quality representations without manual annotations, making it suitable for various label-scarce scenarios and thus garnering substantial interest. Existing graph s

Cited by 0Scholar
2025

Feature-Structure Adaptive Completion Graph Neural Network for Cold-start Recommendation

AAAI 2025technical

The cold-start recommendation has been challenging due to the limited historical interactions for new users and new items. Recently, methods based on meta-learning and graph neural networks have been effective in this problem. However, these methods mainly focus on the missing user-item interactions…

Cited by 0SourcePDFScholar
2024

A New Mechanism for Eliminating Implicit Conflict in Graph Contrastive Learning

AAAI 2024technical

Graph contrastive learning (GCL) has attracted considerable attention because it can self-supervisedly extract low-dimensional representation of graph data. InfoNCE-based loss function is widely used in graph contrastive learning, which pulls the representations of positive pairs close to each other…

2024

Graph Collaborative Expert Finding with Contrastive Learning

IJCAI 2024poster

In Community Question Answering (CQA) websites, most current expert finding methods often model expert embeddings from textual features and optimize them with expert-question first-order interactions, i.e., this expert has answered this question. In this paper, we try to address the limitation of cu…

Cited by 1SourcePDFScholar
2023

T2-GNN: Graph Neural Networks for Graphs with Incomplete Features and Structure via Teacher-Student Distillation

AAAI 2023technical

Graph Neural Networks (GNNs) have been a prevailing technique for tackling various analysis tasks on graph data. A key premise for the remarkable performance of GNNs relies on complete and trustworthy initial graph descriptions (i.e., node features and graph structure), which is often not satisfied…

Cited by 44SourcePDFScholar
2021

Universal Graph Convolutional Networks

NeurIPS 2021poster

Graph Convolutional Networks (GCNs), aiming to obtain the representation of a node by aggregating its neighbors, have demonstrated great power in tackling various analytics tasks on graph (network) data. The remarkable performance of GCNs typically relies on the homophily assumption of networks, whi…