{"total":19,"rows":[{"id":"2205.11506","title":"Orchestra: Unsupervised Federated Learning via Globally Consistent Clustering","created":"2022-05-23","cited_by_count":45,"area":null},{"id":"2206.08646","title":"Scalable Differentially Private Clustering via Hierarchically Separated Trees","created":"2022-06-17","cited_by_count":10,"area":null},{"id":"2208.01700","title":"Differentially Private Vertical Federated Clustering","created":"2022-08-02","cited_by_count":10,"area":null},{"id":"2305.00771","title":"Towards Unbiased Training in Federated Open-world Semi-supervised Learning","created":"2023-05-01","cited_by_count":7,"area":null},{"id":"2203.01440","title":"Near-Optimal Correlation Clustering with Privacy","created":"2022-03-02","cited_by_count":6,"area":null},{"id":"2207.04396","title":"Graph Generative Model for Benchmarking Graph Neural Networks","created":"2022-07-10","cited_by_count":6,"area":null},{"id":"2506.04681","title":"Urania: Differentially Private Insights into AI Use","created":"2025-06-05","cited_by_count":4,"area":null},{"id":"2502.14087","title":"Learning from End User Data with Shuffled Differential Privacy over Kernel Densities","created":"2025-02-19","cited_by_count":3,"area":null},{"id":"2302.11152","title":"Multi-Message Shuffled Privacy in Federated Learning","created":"2023-02-22","cited_by_count":2,"area":null},{"id":"2307.03430","title":"Differential Privacy for Clustering Under Continual Observation","created":"2023-07-07","cited_by_count":2,"area":null},{"id":"2405.02437","title":"FastLloyd: Federated, Accurate, Secure, and Tunable $k$-Means Clustering with Differential Privacy","created":"2024-05-03","cited_by_count":2,"area":null},{"id":"2105.15007","title":"Locally Private $k$-Means Clustering with Constant Multiplicative Approximation and Near-Optimal Additive Error","created":"2021-05-31","cited_by_count":1,"area":null},{"id":"2307.02969","title":"DPM: Clustering Sensitive Data through Separation","created":"2023-07-06","cited_by_count":1,"area":null},{"id":"2307.07449","title":"Differentially Private Clustering in Data Streams","created":"2023-07-14","cited_by_count":1,"area":null},{"id":"2406.11649","title":"Making Old Things New: A Unified Algorithm for Differentially Private Clustering","created":"2024-06-17","cited_by_count":1,"area":null},{"id":"2511.04332","title":"Differentially Private In-Context Learning with Nearest Neighbor Search","created":"2025-11-06","cited_by_count":1,"area":null},{"id":"2304.13886","title":"Improving the Utility of Differentially Private Clustering through Dynamical Processing","created":"2023-04-27","cited_by_count":0,"area":null},{"id":"2508.06183","title":"Differentially Private Federated Clustering with Random Rebalancing","created":"2025-08-08","cited_by_count":0,"area":null},{"id":"2603.26963","title":"On the Optimal Number of Grids for Differentially Private Non-Interactive $K$-Means Clustering","created":"2026-03-27","cited_by_count":0,"area":null}],"next_cursor":null}