Yunfeng Yu

Yunfeng Yu

Auto-generated profile, based on publicly available information

Yunfeng Yu

College of Computer and Information Science, Southwest University, Chongqing, China

Research Focus & Metrics

Representative Publications

View All Publications
30 May 2024
Verified
Conference Paper
Open access
YYYunfeng Yu
Yunfeng Yu
LLLonglong Lin
Longlong Lin
QLQiyu Liu
Qiyu Liu
ZWZeli Wang
Zeli Wang
XOXi Ou
Xi Ou
Tao JiaTao Jia
Tao Jia
Graph Neural Networks (GNNs) have achieved remarkable performance in various applications, including social media analysis, computer vision, and natural language processing. Decoupled GNNs are a ubiquitous framework because of their high efficiency. However, existing decoupled GNNs suffer from the following several defects. (1) Their studies on GNN feature propagation are isolated, with each study emphasizing a user-specified propagation matrix. (2) They still have high computation costs to achieve provable performance on massive graphs with millions of nodes and billions of edges. (3) Their feature propagation steps are uniform, which makes it difficult for them to escape the dilemmas of over-smoothing. In this paper, we propose GSD-GNN, a Generalized and Scalable Decoupled GNN framework based on the spectral graph theory, which offers the following advantages. Firstly, through minor parameter adjustments, it can degenerate into most existing Decoupled GNNs, such as APPNP, GDC, SGC, etc. Secondly, it efficiently computes an arbitrary propagation matrix with near-linear time complexity and theoretical guarantees. Thirdly, it customizes the adaptive feature propagation mechanism for each node to mitigate the over-smoothing dilemma. Finally, extensive experiments on massive graphs demonstrate that the proposed GSD-GNN indeed is effective, scalable, and flexible.

30 June 2025
Verified
Conference Paper
Open access
TLTao Liu
Tao Liu
LLLonglong Lin
Longlong Lin
YYYunfeng Yu
Yunfeng Yu
XOXi Ou
Xi Ou
YZYouan Zhang
Youan Zhang
Tao JiaTao Jia
Tao Jia

21 October 2024
Verified
Conference Paper
Open access
LLLonglong Lin
Longlong Lin
YYYunfeng Yu
Yunfeng Yu
ZWZihao Wang
Zihao Wang
ZWZeli Wang
Zeli Wang
YZYuying Zhao
Yuying Zhao
Tao JiaTao Jia
Tao Jia
Network embedding has numerous practical applications and has received extensive attention in graph learning, which aims at mapping vertices into a low-dimensional and continuous dense vector space by preserving the underlying structural properties of the graph. Many network embedding methods have been proposed, among which factorization of the Personalized PageRank (PPR for short) matrix has been empirically and theoretically well supported recently. However, several fundamental issues cannot be addressed. (1) Existing methods invoke a seminal Local Push subroutine to approximate a single row or column of the PPR matrix. Thus, they have to execute n (n is the number of nodes) Local Push subroutines to obtain a provable PPR matrix, resulting in prohibitively high computational costs for large n. (2) The PPR matrix has limited power in capturing the structural similarity between vertices, leading to performance degradation. To overcome these dilemmas, we propose PSNE, an efficient spectral sParsification method for Scaling Network Embedding, which can fast obtain the embedding vectors that retain strong structural similarities. Specifically, PSNE first designs a matrix polynomial sparser to accelerate the calculation of the PPR matrix, which has a theoretical guarantee in terms of the Frobenius norm. Subsequently, PSNE proposes a simple but effective multiple-perspective strategy to enhance further the representation power of the obtained approximate PPR matrix. Finally, PSNE applies a randomized singular value decomposition algorithm on the sparse and multiple-perspective PPR matrix to get the target embedding vectors. Experimental evaluation of real-world and synthetic datasets shows that our solutions are indeed more efficient, effective, and scalable compared with ten competitors.