default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRenchi Yang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Renchi Yang
, Jieming Shi:
Efficient High-Quality Clustering for Large Bipartite Graphs. Proc. ACM Manag. Data 2(1): 23:1-23:27 (2024)- [j12]Yiran Li, Gongyao Guo, Jieming Shi, Renchi Yang, Shiqi Shen, Qing Li, Jun Luo:
A versatile framework for attributed network clustering via K-nearest neighbor augmentation. VLDB J. 33(6): 1913-1943 (2024) - [c15]Yurui Lai, Xiaoyang Lin, Renchi Yang, Hongtao Wang:
Efficient Topology-aware Data Augmentation for High-Degree Graph Neural Networks. KDD 2024: 1463-1473 - [c14]Hewen Wang, Renchi Yang, Xiaokui Xiao:
Effective Edge-wise Representation Learning in Edge-Attributed Bipartite Graphs. KDD 2024: 3081-3091 - [c13]Renchi Yang, Yidu Wu, Xiaoyang Lin, Qichen Wang, Tsz Nam Chan, Jieming Shi:
Effective Clustering on Large Attributed Bipartite Graphs. KDD 2024: 3782-3793 - [i18]Ziang Zhou, Jieming Shi, Renchi Yang, Yuanhang Zou, Qing Li:
SlotGAT: Slot-based Message Passing for Heterogeneous Graph Neural Network. CoRR abs/2405.01927 (2024) - [i17]Renchi Yang, Yidu Wu, Xiaoyang Lin, Qichen Wang, Tsz Nam Chan, Jieming Shi:
Effective Clustering on Large Attributed Bipartite Graphs. CoRR abs/2405.11922 (2024) - [i16]Yurui Lai, Xiaoyang Lin, Renchi Yang, Hongtao Wang:
Efficient Topology-aware Data Augmentation for High-Degree Graph Neural Networks. CoRR abs/2406.05482 (2024) - [i15]Hewen Wang, Renchi Yang, Xiaokui Xiao:
Effective Edge-wise Representation Learning in Edge-Attributed Bipartite Graphs. CoRR abs/2406.13369 (2024) - [i14]Yiran Li, Gongyao Guo, Jieming Shi, Renchi Yang, Shiqi Shen, Qing Li, Jun Luo:
A Versatile Framework for Attributed Network Clustering via K-Nearest Neighbor Augmentation. CoRR abs/2408.05459 (2024) - 2023
- [j11]Renchi Yang, Jing Tang:
Efficient Estimation of Pairwise Effective Resistance. Proc. ACM Manag. Data 1(1): 16:1-16:27 (2023) - [j10]Shiqi Zhang, Renchi Yang, Xiaokui Xiao, Xiao Yan, Bo Tang:
Effective and Efficient PageRank-based Positioning for Graph Visualization. Proc. ACM Manag. Data 1(1): 76:1-76:27 (2023) - [j9]Yiran Li, Renchi Yang, Jieming Shi:
Efficient and Effective Attributed Hypergraph Clustering via K-Nearest Neighbor Augmentation. Proc. ACM Manag. Data 1(2): 116:1-116:23 (2023) - [j8]Renchi Yang, Jieming Shi, Xiaokui Xiao, Yin Yang, Sourav S. Bhowmick, Juncheng Liu:
PANE: scalable and effective attributed network embedding. VLDB J. 32(6): 1237-1262 (2023) - [c12]Hewen Wang, Renchi Yang, Jieming Shi:
Anomaly Detection in Financial Transactions Via Graph-Based Feature Aggregations. DaWaK 2023: 64-79 - [c11]Ziang Zhou, Jieming Shi, Renchi Yang, Yuanhang Zou, Qing Li:
SlotGAT: Slot-based Message Passing for Heterogeneous Graphs. ICML 2023: 42644-42657 - [c10]Hewen Wang, Renchi Yang, Keke Huang, Xiaokui Xiao:
Efficient and Effective Edge-wise Graph Representation Learning. KDD 2023: 2326-2336 - [c9]Shiqi Zhang, Renchi Yang, Jing Tang, Xiaokui Xiao, Bo Tang:
Efficient Approximation Algorithms for Spanning Centrality. KDD 2023: 3386-3395 - [c8]Keke Huang, Jing Tang, Juncheng Liu, Renchi Yang, Xiaokui Xiao:
Node-wise Diffusion for Scalable Graph Learning. WWW 2023: 1723-1733 - [i13]Keke Huang, Jing Tang, Juncheng Liu, Renchi Yang, Xiaokui Xiao:
Node-wise Diffusion for Scalable Graph Learning. CoRR abs/2305.14000 (2023) - [i12]Shiqi Zhang, Renchi Yang, Jing Tang, Xiaokui Xiao, Bo Tang:
Efficient Approximation Algorithms for Spanning Centrality. CoRR abs/2305.16086 (2023) - [i11]Renchi Yang, Jing Tang:
Efficient Estimation of Pairwise Effective Resistance. CoRR abs/2312.06123 (2023) - [i10]Renchi Yang:
Efficient and Effective Similarity Search over Bipartite Graphs. CoRR abs/2312.06724 (2023) - [i9]Renchi Yang, Jieming Shi:
Efficient High-Quality Clustering for Large Bipartite Graphs. CoRR abs/2312.16926 (2023) - 2022
- [j7]Renchi Yang, Jieming Shi, Xiaokui Xiao, Yin Yang, Sourav S. Bhowmick, Juncheng Liu:
No PANE, No Gain: Scaling Attributed Network Embedding in a Single Server. SIGMOD Rec. 51(1): 42-49 (2022) - [c7]Juncheng Liu, Yiwei Wang, Bryan Hooi, Renchi Yang, Xiaokui Xiao:
LSCALE: Latent Space Clustering-Based Active Learning for Node Classification. ECML/PKDD (1) 2022: 55-70 - [c6]Renchi Yang, Jieming Shi, Keke Huang, Xiaokui Xiao:
Scalable and Effective Bipartite Network Embedding. SIGMOD Conference 2022: 1977-1991 - [c5]Renchi Yang:
Efficient and Effective Similarity Search over Bipartite Graphs. WWW 2022: 308-318 - 2021
- [j6]Tianyuan Jin, Yu Yang, Renchi Yang, Jieming Shi, Keke Huang, Xiaokui Xiao:
Unconstrained Submodular Maximization with Modular Costs: Tight Approximation and Application to Profit Maximization. Proc. VLDB Endow. 14(10): 1756-1768 (2021) - [c4]Renchi Yang, Xiaokui Xiao:
Fast Approximate All Pairwise CoSimRanks via Random Projection. WISE (1) 2021: 438-452 - [c3]Renchi Yang, Jieming Shi, Yin Yang, Keke Huang, Shiqi Zhang, Xiaokui Xiao:
Effective and Scalable Clustering on Massive Attributed Graphs. WWW 2021: 3675-3687 - [i8]Renchi Yang, Jieming Shi, Yin Yang, Keke Huang, Shiqi Zhang, Xiaokui Xiao:
Effective and Scalable Clustering on Massive Attributed Graphs. CoRR abs/2102.03826 (2021) - [i7]Shiqi Zhang, Renchi Yang, Xiaokui Xiao, Xiao Yan, Bo Tang:
PPRviz: Effective and Efficient Graph Visualization based on Personalized PageRank. CoRR abs/2112.14944 (2021) - 2020
- [b1]Renchi Yang:
Efficient and scalable techniques for pagerank-based graph analytics. Nanyang Technological University, Singapore, 2020 - [j5]Renchi Yang, Jieming Shi, Xiaokui Xiao, Yin Yang, Sourav S. Bhowmick:
Homogeneous Network Embedding for Massive Graphs via Reweighted Personalized PageRank. Proc. VLDB Endow. 13(5): 670-683 (2020) - [j4]Jieming Shi, Tianyuan Jin, Renchi Yang, Xiaokui Xiao, Yin Yang:
Realtime Index-Free Single Source SimRank Processing on Web-Scale Graphs. Proc. VLDB Endow. 13(7): 966-978 (2020) - [j3]Renchi Yang, Jieming Shi, Xiaokui Xiao, Yin Yang, Juncheng Liu, Sourav S. Bhowmick:
Scaling Attributed Network Embedding to Massive Graphs. Proc. VLDB Endow. 14(1): 37-49 (2020) - [i6]Jieming Shi, Tianyuan Jin, Renchi Yang, Xiaokui Xiao, Yin Yang:
Realtime Index-Free Single Source SimRank Processing on Web-Scale Graphs. CoRR abs/2002.08082 (2020) - [i5]Renchi Yang, Jieming Shi, Xiaokui Xiao, Yin Yang, Juncheng Liu, Sourav S. Bhowmick:
Scaling Attributed Network Embedding to Massive Graphs. CoRR abs/2009.00826 (2020) - [i4]Juncheng Liu, Yiwei Wang, Bryan Hooi, Renchi Yang, Xiaokui Xiao:
Active Learning for Node Classification: The Additional Learning Ability from Unlabelled Nodes. CoRR abs/2012.07065 (2020)
2010 – 2019
- 2019
- [j2]Jieming Shi, Renchi Yang, Tianyuan Jin, Xiaokui Xiao, Yin Yang:
Realtime Top-k Personalized PageRank over Large Graphs on GPUs. Proc. VLDB Endow. 13(1): 15-28 (2019) - [j1]Sibo Wang, Renchi Yang, Runhui Wang, Xiaokui Xiao, Zhewei Wei, Wenqing Lin, Yin Yang, Nan Tang:
Efficient Algorithms for Approximate Single-Source Personalized PageRank Queries. ACM Trans. Database Syst. 44(4): 18:1-18:37 (2019) - [c2]Renchi Yang, Xiaokui Xiao, Zhewei Wei, Sourav S. Bhowmick, Jun Zhao, Rong-Hua Li:
Efficient Estimation of Heat Kernel PageRank for Local Clustering. SIGMOD Conference 2019: 1339-1356 - [i3]Renchi Yang, Xiaokui Xiao, Zhewei Wei, Sourav S. Bhowmick, Jun Zhao, Rong-Hua Li:
Efficient Estimation of Heat Kernel PageRank for Local Clustering. CoRR abs/1904.02707 (2019) - [i2]Renchi Yang, Jieming Shi, Xiaokui Xiao, Sourav S. Bhowmick, Yin Yang:
Homogeneous Network Embedding for Massive Graphs via Personalized PageRank. CoRR abs/1906.06826 (2019) - [i1]Sibo Wang, Renchi Yang, Runhui Wang, Xiaokui Xiao, Zhewei Wei, Wenqing Lin, Yin Yang, Nan Tang:
Efficient Algorithms for Approximate Single-Source Personalized PageRank Queries. CoRR abs/1908.10583 (2019) - 2017
- [c1]Sibo Wang, Renchi Yang, Xiaokui Xiao, Zhewei Wei, Yin Yang:
FORA: Simple and Effective Approximate Single-Source Personalized PageRank. KDD 2017: 505-514
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-06 20:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
