← Search

Yuhui Guo

7 accepted papers

2026

From Semantics to Spectrum: A New Lens on Graph Augmentation Strategy

AAAI 2026technical

Graph augmentation is a cornerstone of effective graph contrastive learning, yet existing methods often rely on random designed perturbations, which may distort latent semantics and impair representation quality. In this work, we argue that semantic consistency can be effectively approximated by low

Cited by 0SourcePDFScholar
2023

Cross-Modal Matching and Adaptive Graph Attention Network for RGB-D Scene Recognition

ICASSP 2023accepted

Despite the significant advances in RGB-D scene recognition, there are several major limitations that need further investigation. For example, simply extracting modal-specific features neglects the complex relationships among multiple modalities of features. Moreover, cross-modal features have not b…

Cited by 0SourceScholar
2023

Intent Does Matter! Propagating High-Order Relations for Exploring Interest Preferences

ICASSP 2023accepted

Session-based recommendation (SBR) aims to predict the user’s action at the next timestamp according to an anonymous yet short interaction sequence (i.e., session). Almost all the existing SBR solutions for user preference are only based on the current session without exploiting the high-order relat…

Cited by 0SourceScholar
2022

Eureka: Neural Insight Learning for Knowledge Graph Reasoning

COLING 2022main

The human recognition system has presented the remarkable ability to effortlessly learn novel knowledge from only a few trigger events based on prior knowledge, which is called insight learning. Mimicking such behavior on Knowledge Graph Reasoning (KGR) is an interesting and challenging research pro…

Cited by 0SourcePDFScholar
2022

Improving Dynamic Graph Convolutional Network with Fine-Grained Attention Mechanism

ICASSP 2022accepted

Graph convolutional network (GCN) is a novel framework that utilizes a pre-defined Laplacian matrix to learn graph data effectively. With its powerful nonlinear fitting ability, GCN can produce high-quality node embedding. However, generalized GCN can only handle static graphs, whereas a large numbe…

Cited by 0SourceScholar