Building K-Anonymous User Cohorts with Consecutive Consistent Weighted Sampling (CCWS)-Reference-Cited by-同舟云学术

Building K-Anonymous User Cohorts with Consecutive Consistent Weighted Sampling (CCWS)

Published:2023-07-18 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval
language:
Short-container-title:

Author:

Zheng Xinyi¹^ORCID,Zhao Weijie¹^ORCID,Li Xiaoyun¹^ORCID,Li Ping¹^ORCID

Affiliation:

1. LinkedIn, Mountain View, USA

Publisher

ACM

Link

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

Reference67 articles.

1. Google Research & Ads. 2020a. Computing k-anonymity for a dataset. https://cloud.google.com/dlp/docs/compute-k-anonymity Google Research & Ads. 2020a. Computing k-anonymity for a dataset. https://cloud.google.com/dlp/docs/compute-k-anonymity

2. Google Research & Ads. 2020b. Evaluation of cohort algorithms for the FLoC API. https://github.com/google/ads-privacy/blob/master/proposals/FLoC/FLOC-Whitepaper-Google.pdf Google Research & Ads. 2020b. Evaluation of cohort algorithms for the FLoC API. https://github.com/google/ads-privacy/blob/master/proposals/FLoC/FLOC-Whitepaper-Google.pdf

3. An efficient recommendation generation using relevant Jaccard similarity

4. Michael Bendersky and W. Bruce Croft . 2009. Finding text reuse on the web . In Proceedings of the Second International Conference on Web Search and Web Data Mining (WSDM) . Barcelona, Spain, 262--271. Michael Bendersky and W. Bruce Croft. 2009. Finding text reuse on the web. In Proceedings of the Second International Conference on Web Search and Web Data Mining (WSDM). Barcelona, Spain, 262--271.

5. A Web Search Engine-Based Approach to Measure Semantic Similarity between Words

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

1. Pb-Hash: Partitioned b-bit Hashing;Proceedings of the 2024 ACM SIGIR International Conference on Theory of Information Retrieval;2024-08-02