Renchi Yang

Orcid: 0000-0002-7284-3096

According to our database1, Renchi Yang authored at least 29 papers between 2017 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Effective Edge Ranking via Random Walk with Restart.
CoRR, 2024

2023
PANE: scalable and effective attributed network embedding.
VLDB J., November, 2023

Efficient Estimation of Pairwise Effective Resistance.
Proc. ACM Manag. Data, 2023

Efficient and Effective Attributed Hypergraph Clustering via K-Nearest Neighbor Augmentation.
Proc. ACM Manag. Data, 2023

Effective and Efficient PageRank-based Positioning for Graph Visualization.
Proc. ACM Manag. Data, 2023

Efficient High-Quality Clustering for Large Bipartite Graphs.
CoRR, 2023

Node-wise Diffusion for Scalable Graph Learning.
Proceedings of the ACM Web Conference 2023, 2023

Efficient Approximation Algorithms for Spanning Centrality.
Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

Efficient and Effective Edge-wise Graph Representation Learning.
Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

SlotGAT: Slot-based Message Passing for Heterogeneous Graphs.
Proceedings of the International Conference on Machine Learning, 2023

Anomaly Detection in Financial Transactions Via Graph-Based Feature Aggregations.
Proceedings of the Big Data Analytics and Knowledge Discovery, 2023

2022
No PANE, No Gain: Scaling Attributed Network Embedding in a Single Server.
SIGMOD Rec., 2022

Efficient and Effective Similarity Search over Bipartite Graphs.
Proceedings of the WWW '22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25, 2022

Scalable and Effective Bipartite Network Embedding.
Proceedings of the SIGMOD '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

LSCALE: Latent Space Clustering-Based Active Learning for Node Classification.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2022

2021
Unconstrained Submodular Maximization with Modular Costs: Tight Approximation and Application to Profit Maximization.
Proc. VLDB Endow., 2021

PPRviz: Effective and Efficient Graph Visualization based on Personalized PageRank.
CoRR, 2021

Effective and Scalable Clustering on Massive Attributed Graphs.
Proceedings of the WWW '21: The Web Conference 2021, 2021

Fast Approximate All Pairwise CoSimRanks via Random Projection.
Proceedings of the Web Information Systems Engineering - WISE 2021, 2021

2020
Efficient and scalable techniques for pagerank-based graph analytics
PhD thesis, 2020

Homogeneous Network Embedding for Massive Graphs via Reweighted Personalized PageRank.
Proc. VLDB Endow., 2020

Scaling Attributed Network Embedding to Massive Graphs.
Proc. VLDB Endow., 2020

Realtime Index-Free Single Source SimRank Processing on Web-Scale Graphs.
Proc. VLDB Endow., 2020

Active Learning for Node Classification: The Additional Learning Ability from Unlabelled Nodes.
CoRR, 2020

2019
Efficient Algorithms for Approximate Single-Source Personalized PageRank Queries.
ACM Trans. Database Syst., 2019

Realtime Top-k Personalized PageRank over Large Graphs on GPUs.
Proc. VLDB Endow., 2019

Homogeneous Network Embedding for Massive Graphs via Personalized PageRank.
CoRR, 2019

Efficient Estimation of Heat Kernel PageRank for Local Clustering.
Proceedings of the 2019 International Conference on Management of Data, 2019

2017
FORA: Simple and Effective Approximate Single-Source Personalized PageRank.
Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, NS, Canada, August 13, 2017


  Loading...