Scalable decoupling graph neural network with feature-oriented optimization

Liao, Ningyi; Mo, Dingheng; Luo, Siqiang; Li, Xiang; Yin, Pengcheng

doi:10.1007/s00778-023-00829-6

The VLDB Journal

2023

DOI: 10.1007/s00778-023-00829-6

|View full text |Cite

Scalable decoupling graph neural network with feature-oriented optimization

Ningyi Liao,

Dingheng Mo,

Siqiang Luo

et al.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

BIRD: Efficient Approximation of Bidirectional Hidden Personalized PageRank

Liu,

Luo

2024

Proc. VLDB Endow.

View full text Add to dashboard Cite

In bipartite graph analysis, similarity measures play a pivotal role in various applications. Among existing metrics, the Bidirectional Hidden Personalized PageRank (BHPP) stands out for its superior query quality. However, the computational expense of BHPP remains a bottleneck. Existing approximation methods either demand significant matrix storage or incur prohibitive time costs. For example, current state-of-the-art methods require over 3 hours to process a single-source BHPP query on the real-world bipartite graph Orkut , which contains approximately 3 × 10 8 edges. We introduce BIRD, a novel algorithm designed for answering single-source BHPP queries on weighted bipartite graphs. Through meticulous theoretical analysis, we demonstrate that BIRD significantly improves time complexity to Õ ( n ), as compared to the previous best one, Õ ( m ), under typical relative error setting and constant failure probability. ( n, m denote the number of nodes and edges respectively.) Extensive experiments confirm that BIRD outperforms existing baselines by orders of magnitude in large-scale bipartite graphs. Notably, our proposed method accomplishes a single-source BHPP query on Orkut using merely 7 minutes.

show abstract

BIRD: Efficient Approximation of Bidirectional Hidden Personalized PageRank

Liu,

Luo

2024

Proc. VLDB Endow.

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Scalable decoupling graph neural network with feature-oriented optimization

Cited by 1 publication

References 21 publications

BIRD: Efficient Approximation of Bidirectional Hidden Personalized PageRank

BIRD: Efficient Approximation of Bidirectional Hidden Personalized PageRank

Contact Info

Product

Resources

About