受强制性开放获取政策约束的文章 - Renchi Yang了解详情
可在其他位置公开访问的文章：14 篇
FORA: simple and effective approximate single-source personalized pagerank
S Wang, R Yang, X Xiao, Z Wei, Y Yang
Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge …, 2017
强制性开放获取政策： 国家自然科学基金委员会
Efficient algorithms for approximate single-source personalized pagerank queries
S Wang, R Yang, R Wang, X Xiao, Z Wei, W Lin, Y Yang, N Tang
ACM Transactions on Database Systems (TODS) 44 (4), 1-37, 2019
强制性开放获取政策： 国家自然科学基金委员会
Efficient estimation of heat kernel pagerank for local clustering
R Yang, X Xiao, Z Wei, SS Bhowmick, J Zhao, RH Li
Proceedings of the 2019 International Conference on Management of Data, 1339 …, 2019
强制性开放获取政策： 国家自然科学基金委员会
Unconstrained submodular maximization with modular costs: Tight approximation and application to profit maximization
T Jin, Y Yang, R Yang, J Shi, K Huang, X Xiao
Proceedings of the VLDB Endowment 14 (10), 1756-1768, 2021
强制性开放获取政策： Research Grants Council, Hong Kong, National Research Foundation, Singapore
Node-wise diffusion for scalable graph learning
K Huang, J Tang, J Liu, R Yang, X Xiao
Proceedings of the ACM Web Conference 2023, 1723-1733, 2023
强制性开放获取政策： 国家自然科学基金委员会, National Research Foundation, Singapore
Lscale: latent space clustering-based active learning for node classification
J Liu, Y Wang, B Hooi, R Yang, X Xiao
Joint European Conference on Machine Learning and Knowledge Discovery in …, 2022
强制性开放获取政策： A*Star, Singapore
Scalable and effective bipartite network embedding
R Yang, J Shi, K Huang, X Xiao
Proceedings of the 2022 International Conference on Management of Data, 1977 …, 2022
强制性开放获取政策： Research Grants Council, Hong Kong
Efficient and effective attributed hypergraph clustering via k-nearest neighbor augmentation
Y Li, R Yang, J Shi
Proceedings of the ACM on Management of Data 1 (2), 1-23, 2023
强制性开放获取政策： 国家自然科学基金委员会, A*Star, Singapore, Research Grants Council, Hong Kong
SlotGAT: slot-based message passing for heterogeneous graphs
Z Zhou, J Shi, R Yang, Y Zou, Q Li
International Conference on Machine Learning, 42644-42657, 2023
强制性开放获取政策： 国家自然科学基金委员会, Research Grants Council, Hong Kong
Efficient High-Quality Clustering for Large Bipartite Graphs
R Yang, J Shi
Proceedings of the ACM on Management of Data 2 (1), 1-27, 2024
强制性开放获取政策： Research Grants Council, Hong Kong
Effective and efficient pagerank-based positioning for graph visualization
S Zhang, R Yang, X Xiao, X Yan, B Tang
Proceedings of the ACM on Management of Data 1 (1), 1-27, 2023
强制性开放获取政策： A*Star, Singapore
Efficient Approximation Algorithms for Spanning Centrality
S Zhang, R Yang, J Tang, X Xiao, B Tang
Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and …, 2023
强制性开放获取政策： 国家自然科学基金委员会
Efficient Estimation of Pairwise Effective Resistance
R Yang, J Tang
Proceedings of the ACM on Management of Data 1 (1), 1-27, 2023
强制性开放获取政策： 国家自然科学基金委员会, A*Star, Singapore
Effective Clustering on Large Attributed Bipartite Graphs
R Yang, Y Wu, X Lin, Q Wang, TN Chan, J Shi
Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and …, 2024
强制性开放获取政策： Research Grants Council, Hong Kong
出版信息和资助信息由计算机程序自动确定