Double-Anonymous Sketch: Achieving Top-K-fairness for Finding Global Top-K Frequent Items

Yikai Zhao, Wenchen Han, Zheng Zhong, Yinda Zhang 0002, Tong Yang 0003, Bin Cui 0001. Double-Anonymous Sketch: Achieving Top-K-fairness for Finding Global Top-K Frequent Items. Proc. ACM Manag. Data, 1(1), 2023. [doi]

Abstract

Abstract is missing.