Optimal Dynamic Subset Sampling: Theory and Applications-Reference-Cited by-同舟云学术

Optimal Dynamic Subset Sampling: Theory and Applications

Published:2023-08-04 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining
language:
Short-container-title:

Author:

Yi Lu¹^ORCID,Wang Hanzhi¹^ORCID,Wei Zhewei¹^ORCID

Affiliation:

1. Renmin University of China, Beijing, China

Funder

National Key R&D Program of China

Beijing Outstanding Young Scientist Program

Alibaba Group through Alibaba Innovative Research Program

National Natural Science Foundation of China

the major key project of PCL

Engineering Research Center of Next-Generation Intelligent Search and Recommendation, Ministry of Education

Intelligent Social Governance Interdisciplinary Platform, Major Innovation & Planning Interdisciplinary Platform for the ?Double-First Class? Initiative, Public Policy and Decision-making Research Lab, Public Computing Cloud, Renmin University of China

Beijing Natural Science Foundation

Huawei-Renmin University joint program on Information Retrieval

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3580305.3599458

Reference36 articles.

1. https://arxiv.org/abs/2305.18785. https://arxiv.org/abs/2305.18785.

2. Scaling Graph Neural Networks with Approximate PageRank

3. Efficient Sampling Methods for Discrete Distributions

4. Scalable influence maximization for prevalent viral marketing in large-scale social networks

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10