Search Results for author:
Found 7 papers, 0 papers with code
Challenging Low Homophily in Social Recommendation
To comprehensively extract preference-aware homophily information latent in the social graph, we propose Social Heterophily-alleviating Rewiring (SHaRe), a data-centric framework for enhancing existing graph-based social recommendation models.
Graph Condensation: A Survey
The burgeoning volume of graph data poses significant challenges in storage, transmission, and particularly the training of graph neural networks (GNNs).
Accelerating Scalable Graph Neural Network Inference with Node-Adaptive Propagation
To further accelerate Scalable GNNs inference in this inductive setting, we propose an online propagation framework and two novel node-adaptive propagation methods that can customize the optimal propagation depth for each node based on its topological information and thereby avoid redundant feature propagation.
Graph Condensation for Inductive Node Representation Learning
To overcome this issue, we propose mapping-aware graph condensation (MCond), explicitly learning the one-to-many node mapping from original nodes to synthetic nodes to seamlessly integrate new nodes into the synthetic graph for inductive representation learning.
Has It All Been Solved? Open NLP Research Questions Not Solved by Large Language Models
Not surprisingly, this has, in turn, made many NLP researchers -- especially those at the beginning of their careers -- worry about what NLP research area they should focus on.
Semantic-aware Node Synthesis for Imbalanced Heterogeneous Information Networks
To tackle the imbalance of minority classes and supplement their inadequate semantics, we present the first method for the semantic imbalance problem in imbalanced HINs named Semantic-aware Node Synthesis (SNS).
Efficient Graph Neural Network Inference at Large Scale
Graph neural networks (GNNs) have demonstrated excellent performance in a wide range of applications.
