{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T21:56:16Z","timestamp":1769637376723,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":97,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,11,12]],"date-time":"2021-11-12T00:00:00Z","timestamp":1636675200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-sa\/4.0\/"}],"funder":[{"name":"Crystal Center at National University of Singapore"},{"name":"National Research Foundation Singapore under its NRF Fellowship Programme","award":["[NRFNRFFAI1-2019-0004]"],"award-info":[{"award-number":["[NRFNRFFAI1-2019-0004]"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,11,12]]},"DOI":"10.1145\/3460120.3484822","type":"proceedings-article","created":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T12:05:33Z","timestamp":1636805133000},"page":"2342-2360","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Private Hierarchical Clustering in Federated Networks"],"prefix":"10.1145","author":[{"given":"Aashish","family":"Kolluri","sequence":"first","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Teodora","family":"Baluta","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prateek","family":"Saxena","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,11,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978318"},{"key":"e_1_3_2_1_2_1","unstructured":"Google Research & Ads. 2020. Evaluation of Cohort Algorithms for the FLoC API. (2020). https:\/\/github.com\/google\/ads-privacy\/blob\/master\/proposals\/FLoC\/FLOC-Whitepaper-Google.pdf"},{"key":"e_1_3_2_1_3_1","volume-title":"Twitter has become toxic. Can Mastodon provide a saner, safer alternative? Scroll.in","author":"Alphonso Anmol","year":"2019","unstructured":"Anmol Alphonso. 2019. Twitter has become toxic. Can Mastodon provide a saner, safer alternative? Scroll.in (2019). https:\/\/scroll.in\/article\/945163\/twitter-has-become-toxic-can-mastodon-provide-a-saner-safer-alternative"},{"key":"e_1_3_2_1_4_1","series-title":"Part 1","volume-title":"Netflix Recommendations: Beyond the 5 stars","author":"Amatriain Xavier","year":"2012","unstructured":"Xavier Amatriain and Justin Basilico. 2012. Netflix Recommendations: Beyond the 5 stars (Part 1). (2012). https:\/\/netflixtechblog.com\/netflix-recommendations-beyond-the-5-stars-part-1--55838468f429."},{"key":"e_1_3_2_1_5_1","volume-title":"Conference on Artificial Intelligence and Statistics (AISTATS).","author":"Bassily Raef","year":"2019","unstructured":"Raef Bassily. 2019. Linear queries estimation with local differential privacy. In Conference on Artificial Intelligence and Statistics (AISTATS)."},{"key":"e_1_3_2_1_6_1","volume-title":"Efficient Protocols for Succinct Histograms. In Symposium on Theory of Computing (STOC).","author":"Bassily Raef","year":"2015","unstructured":"Raef Bassily and Adam Smith. 2015. Local, Private, Efficient Protocols for Succinct Histograms. In Symposium on Theory of Computing (STOC)."},{"key":"e_1_3_2_1_7_1","volume-title":"AAAI Conference on Artificial Intelligence (AAAI).","author":"Basu Chumki","year":"1998","unstructured":"Chumki Basu, Haym Hirsh, William Cohen, et al. 1998. Recommendation as classification: Using social and content-based information in recommendation. In AAAI Conference on Artificial Intelligence (AAAI)."},{"key":"e_1_3_2_1_8_1","unstructured":"Hossein Bateni and Kevin Aydin. 2018. Balanced Partitioning and Hierarchical Clustering at Scale. (2018). https:\/\/ai.googleblog.com\/2018\/03\/balanced-partitioning-and-hierarchical.html."},{"key":"e_1_3_2_1_9_1","volume-title":"Affinity Clustering: Hierarchical Clustering at Scale. In Neural Information Processing Systems (NeurIPS).","author":"Bateni Mohammadhossein","year":"2017","unstructured":"Mohammadhossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Raimondas Kiveris, Silvio Lattanzi, and Vahab Mirrokni. 2017. Affinity Clustering: Hierarchical Clustering at Scale. In Neural Information Processing Systems (NeurIPS)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.17705\/1jais.00065"},{"key":"e_1_3_2_1_11_1","unstructured":"Brave. 2020. An Introduction to Brave's In-Browser Ads. (2020). https:\/\/brave.com\/intro-to-brave-ads\/"},{"key":"e_1_3_2_1_12_1","volume-title":"9th $$USENIX$$ Symposium on Networked Systems Design and Implementation ($$NSDI$$ 12). 169--182.","author":"Chen Ruichuan","unstructured":"Ruichuan Chen, Alexey Reznichenko, Paul Francis, and Johanes Gehrke. 2012. Towards statistical queries over distributed private user data. In 9th $$USENIX$$ Symposium on Networked Systems Design and Implementation ($$NSDI$$ 12). 169--182."},{"key":"e_1_3_2_1_13_1","volume-title":"Structural Inference of Hierarchies in Networks. ICML Workshop on Statistical Network Analysis.","author":"Clauset Aaron","year":"2007","unstructured":"Aaron Clauset, Cristopher Moore, and Mark EJ Newman. 2007. Structural Inference of Hierarchies in Networks. ICML Workshop on Statistical Network Analysis."},{"key":"e_1_3_2_1_14_1","volume-title":"Hierarchical structure and the prediction of missing links in networks. Nature","author":"Clauset Aaron","year":"2008","unstructured":"Aaron Clauset, Cristopher Moore, and Mark EJ Newman. 2008. Hierarchical structure and the prediction of missing links in networks. Nature (2008)."},{"key":"e_1_3_2_1_15_1","volume-title":"Hierarchical Clustering: Objective Functions and Algorithms. In Journal of the ACM (JACM).","author":"Cohen-Addad Vincent","year":"2018","unstructured":"Vincent Cohen-Addad, Varun Kanade, Frederik Mallmann-Trenn, and Claire Mathieu. 2018. Hierarchical Clustering: Objective Functions and Algorithms. In Journal of the ACM (JACM)."},{"key":"e_1_3_2_1_16_1","volume-title":"The structure of dark matter haloes in hierarchical clustering models. Monthly Notices of the Royal Astronomical Society","author":"Cole Shaun","year":"1996","unstructured":"Shaun Cole and Cedric Lacey. 1996. The structure of dark matter haloes in hierarchical clustering models. Monthly Notices of the Royal Astronomical Society (1996)."},{"key":"e_1_3_2_1_17_1","volume-title":"Multiple sequence alignment with hierarchical clustering. Nucleic Acids Research","author":"Florence Corp","year":"1988","unstructured":"Florence Corpet. 1988. Multiple sequence alignment with hierarchical clustering. Nucleic Acids Research (1988)."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897527"},{"key":"e_1_3_2_1_19_1","volume-title":"Publishing Graph Degree Distribution with Node Differential Privacy. In Conference on Management of Data (SIGMOD).","author":"Day Wei-Yen","year":"2016","unstructured":"Wei-Yen Day, Ninghui Li, and Min Lyu. 2016. Publishing Graph Degree Distribution with Node Differential Privacy. In Conference on Management of Data (SIGMOD)."},{"key":"e_1_3_2_1_20_1","volume-title":"International Conference on Multimedia and Expo (ICME).","author":"Deng Zhengyu","year":"2013","unstructured":"Zhengyu Deng, Jitao Sang, and Changsheng Xu. 2013. Personalized video recommendation based on cross-platform user modeling. In International Conference on Multimedia and Expo (ICME)."},{"key":"e_1_3_2_1_21_1","volume-title":"Local Privacy and Statistical Minimax Rates. In Symposium on Foundations of Computer Science (FOCS).","author":"Duchi John C","year":"2013","unstructured":"John C Duchi, Michael I Jordan, and Martin J Wainwright. 2013. Local Privacy and Statistical Minimax Rates. In Symposium on Foundations of Computer Science (FOCS)."},{"key":"e_1_3_2_1_22_1","unstructured":"Richard O Duda Peter E Hart et al. 1973. Pattern classification and scene analysis. Vol. 3. Wiley New York."},{"key":"e_1_3_2_1_23_1","first-page":"3","article-title":"The algorithmic foundations of differential privacy","volume":"9","author":"Dwork Cynthia","year":"2014","unstructured":"Cynthia Dwork, Aaron Roth, et al. 2014. The algorithmic foundations of differential privacy. Foundations and Trends in Theoretical Computer Science, Vol. 9, 3--4 (2014), 211--407.","journal-title":"Foundations and Trends in Theoretical Computer Science"},{"key":"e_1_3_2_1_24_1","unstructured":"Facebook Engineering. 2015. Recommending items to more than a billion people. (2015). https:\/\/engineering.fb.com\/2015\/06\/02\/core-data\/recommending-items-to-more-than-a-billion-people\/"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660348"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313488"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2016-0015"},{"key":"e_1_3_2_1_28_1","volume-title":"Colloquium mathematicum","author":"Florek Kazimierz","unstructured":"Kazimierz Florek, Jan \u0141ukaszewicz, Julian Perkal, Hugo Steinhaus, and Stefan Zubrzycki. 1951. Sur la liaison et la division des points d'un ensemble fini. In Colloquium mathematicum, Vol. 2. 282--285."},{"key":"e_1_3_2_1_29_1","volume-title":"https:\/\/diasporafoundation.org","author":"Foundation Diaspora","year":"2021","unstructured":"Diaspora Foundation. 2021. Diaspora. (2021). https:\/\/diasporafoundation.org."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.21236\/ADA447900"},{"key":"e_1_3_2_1_31_1","unstructured":"Jennifer Ann Golbeck. 2005. Computing and applying trust in web-based social networks. Ph.D. Dissertation."},{"key":"e_1_3_2_1_32_1","volume-title":"Supporting Both Range Queries and Frequency Estimation with Local Differential Privacy. In Conference on Communications and Network Security (CNS).","author":"Gu Xiaolan","year":"2019","unstructured":"Xiaolan Gu, Ming Li, Yang Cao, and Li Xiong. 2019. Supporting Both Range Queries and Frequency Estimation with Local Differential Privacy. In Conference on Communications and Network Security (CNS)."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9153"},{"key":"e_1_3_2_1_34_1","unstructured":"Chung-Wei Hang Yonghong Wang and Munindar P Singh. 2008. Operators for propagating trust and their evaluation in social networks. Technical Report. North Carolina State University. Dept. of Computer Science."},{"key":"e_1_3_2_1_35_1","volume-title":"WhatsApp Loses Millions of Users After Terms Update. The Guardian","author":"Hern Alex","year":"2021","unstructured":"Alex Hern. 2021. WhatsApp Loses Millions of Users After Terms Update. The Guardian (2021). https:\/\/www.theguardian.com\/technology\/2021\/jan\/24\/whatsapp-loses-millions-of-users-after-terms-update"},{"key":"e_1_3_2_1_36_1","volume-title":"Differential Privacy: An Economic Method for Choosing Epsilon. In Computer Security Foundations Symposium (CSF).","author":"Hsu Justin","year":"2014","unstructured":"Justin Hsu, Marco Gaboardi, Andreas Haeberlen, Sanjeev Khanna, Arjun Narayan, Benjamin C Pierce, and Aaron Roth. 2014. Differential Privacy: An Economic Method for Choosing Epsilon. In Computer Security Foundations Symposium (CSF)."},{"key":"e_1_3_2_1_37_1","unstructured":"Justin Hsu Sanjeev Khanna and Aaron Roth. 2012. Distributed Private Heavy Hitters. In International Colloquium on Automata Languages and Programming (ICALP)."},{"key":"e_1_3_2_1_38_1","volume-title":"Auditing Differentially Private Machine Learning: How Private is Private SGD? arXiv preprint arXiv:2006.07709","author":"Jagielski Matthew","year":"2020","unstructured":"Matthew Jagielski, Jonathan Ullman, and Alina Oprea. 2020. Auditing Differentially Private Machine Learning: How Private is Private SGD? arXiv preprint arXiv:2006.07709 (2020)."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557067"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1864708.1864736"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2396771"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"crossref","unstructured":"Vishesh Karwa and Aleksandra Slavkovic. 2012. Differentially Private Graphical Degree Sequences and Synthetic Graphs. Privacy in Statistical Databases.","DOI":"10.1007\/978-3-642-33627-0_21"},{"key":"e_1_3_2_1_43_1","volume-title":"Analyzing Graphs with Node Differential Privacy. Theory of Cryptography Conference (TCC).","author":"Kasiviswanathan Shiva Prasad","year":"2013","unstructured":"Shiva Prasad Kasiviswanathan, Kobbi Nissim, Sofya Raskhodnikova, and Adam Smith. 2013. Analyzing Graphs with Node Differential Privacy. Theory of Cryptography Conference (TCC)."},{"key":"e_1_3_2_1_44_1","volume-title":"A new intrusion detection system using support vector machines and hierarchical clustering. The VLDB Journal","author":"Khan Latifur","year":"2007","unstructured":"Latifur Khan, Mamoun Awad, and Bhavani Thuraisingham. 2007. A new intrusion detection system using support vector machines and hierarchical clustering. The VLDB Journal (2007)."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(99)00222-8"},{"key":"e_1_3_2_1_46_1","volume-title":"The Ties That Torture: Simmelian Tie Analysis in Organizations. Research in the Sociology of Organizations","author":"Krackhardt David","year":"1999","unstructured":"David Krackhardt. 1999. The Ties That Torture: Simmelian Tie Analysis in Organizations. Research in the Sociology of Organizations (1999)."},{"key":"e_1_3_2_1_47_1","unstructured":"R language. 2021. Hierarchical Random Graph package. (2021). http:\/\/search.r-project.org\/library\/igraph\/html\/hrg-methods.html."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.3301208"},{"key":"e_1_3_2_1_49_1","volume-title":"Link prediction in complex networks: A survey. Physica A: statistical mechanics and its applications","author":"L\u00fc Linyuan","year":"2011","unstructured":"Linyuan L\u00fc and Tao Zhou. 2011a. Link prediction in complex networks: A survey. Physica A: statistical mechanics and its applications (2011)."},{"key":"e_1_3_2_1_50_1","volume-title":"Link prediction in complex networks: A survey. Physica A: statistical mechanics and its applications","author":"L\u00fc Linyuan","year":"2011","unstructured":"Linyuan L\u00fc and Tao Zhou. 2011b. Link prediction in complex networks: A survey. Physica A: statistical mechanics and its applications, Vol. 390, 6 (2011), 1150--1170."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623683"},{"key":"e_1_3_2_1_52_1","volume-title":"Community Detection and Classification in Hierarchical Stochastic Blockmodels. Transactions on Network Science and Engineering","author":"Lyzinski Vince","year":"2015","unstructured":"Vince Lyzinski, Minh Tang, Avanti Athreya, Youngser Park, and Carey Priebe. 2015. Community Detection and Classification in Hierarchical Stochastic Blockmodels. Transactions on Network Science and Engineering (2015)."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935877"},{"key":"e_1_3_2_1_54_1","unstructured":"Mastodon. 2021. Mastodon network. (2021). https:\/\/joinmastodon.org."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851275.1851199"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557090"},{"key":"e_1_3_2_1_57_1","volume-title":"Joint EDBT\/ICDT Workshops.","author":"Mir Darakhshan","unstructured":"Darakhshan Mir and Rebecca N. Wright. 2012. A Differentially Private Estimator for the Stochastic Kronecker Graph Model. In Joint EDBT\/ICDT Workshops."},{"key":"e_1_3_2_1_58_1","volume-title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis","author":"Mitzenmacher Michael","unstructured":"Michael Mitzenmacher and Eli Upfal. 2005. Probability and Computing: Randomized Algorithms and Probabilistic Analysis .Cambridge University Press."},{"key":"e_1_3_2_1_59_1","unstructured":"Benjamin Moseley and Joshua Wang. 2017. Approximation Bounds for Hierarchical Clustering: Average Linkage Bisecting K-means and Local Search. In Neural Information Processing Systems (NeurIPS)."},{"key":"e_1_3_2_1_60_1","volume-title":"GeneMANIA: a real-time multiple association network integration algorithm for predicting gene function. Genome biology","author":"Mostafavi Sara","year":"2008","unstructured":"Sara Mostafavi, Debajyoti Ray, David Warde-Farley, Chris Grouios, and Quaid Morris. 2008. GeneMANIA: a real-time multiple association network integration algorithm for predicting gene function. Genome biology (2008)."},{"key":"e_1_3_2_1_61_1","volume-title":"Algorithms for hierarchical clustering: an overview. Data Mining and Knowledge Discovery","author":"Murtagh Fionn","year":"2012","unstructured":"Fionn Murtagh and Pedro Contreras. 2012. Algorithms for hierarchical clustering: an overview. Data Mining and Knowledge Discovery (2012)."},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0601602103"},{"key":"e_1_3_2_1_63_1","volume-title":"Smooth Sensitivity and Sampling in Private Data Analysis. In Symposium on Theory of Computing (STOC).","author":"Nissim Kobbi","year":"2007","unstructured":"Kobbi Nissim, Sofya Raskhodnikova, and Adam Smith. 2007. Smooth Sensitivity and Sampling in Private Data Analysis. In Symposium on Theory of Computing (STOC)."},{"key":"e_1_3_2_1_64_1","volume-title":"SIGIR 2013 Workshop on Time Aware Information Access (TAIA).","author":"Osborne Miles","year":"2012","unstructured":"Miles Osborne, Savs a Petrovic, Richard McCreadie, Craig Macdonald, and Iadh Ounis. 2012. Bieber no more: First story detection using Twitter and Wikipedia. In SIGIR 2013 Workshop on Time Aware Information Access (TAIA)."},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124379"},{"key":"e_1_3_2_1_66_1","unstructured":"Peepeth. 2021. A blockchain-powered social network. (2021). https:\/\/peepeth.com\/welcome."},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/3123266.3123447"},{"key":"e_1_3_2_1_68_1","volume-title":"Towards Comprehensive Recommender Systems: Time-Aware Unified Recommendations Based on Listwise Ranking of Implicit Cross-Network Data. In AAAI Conference on Artificial Intelligence (AAAI).","author":"Perera Dilruk","year":"2020","unstructured":"Dilruk Perera and Roger Zimmermann. 2020. Towards Comprehensive Recommender Systems: Time-Aware Unified Recommendations Based on Listwise Ranking of Implicit Cross-Network Data. In AAAI Conference on Artificial Intelligence (AAAI)."},{"key":"e_1_3_2_1_69_1","volume-title":"Hierarchical Random Graph Model for Off-line Handwritten Signatures Recognition. In Conference on Complex, Intelligent and Software Intensive Systems (CISIS).","author":"Piekarczyk Marcin","year":"2010","unstructured":"Marcin Piekarczyk. 2010. Hierarchical Random Graph Model for Off-line Handwritten Signatures Recognition. In Conference on Complex, Intelligent and Software Intensive Systems (CISIS)."},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978409"},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"crossref","unstructured":"Zhan Qin Ting Yu Yin Yang Issa Khalil Xiaokui Xiao and Kui Ren. 2017. Generating Synthetic Decentralized Social Graphs with Local Differential Privacy.","DOI":"10.1145\/3133956.3134086"},{"key":"e_1_3_2_1_72_1","volume-title":"Federated Analytics: Collaborative Data Science without Data Collection.","author":"Ramage Daniel","year":"2020","unstructured":"Daniel Ramage and Stefano Mazzocchi (Google Research). 2020. Federated Analytics: Collaborative Data Science without Data Collection. (2020). https:\/\/ai.googleblog.com\/2020\/05\/federated-analytics-collaborative-data.html"},{"key":"e_1_3_2_1_73_1","volume-title":"Symposium on Foundations of Computer Science (FOCS).","author":"Raskhodnikova Sofya","year":"2008","unstructured":"Sofya Raskhodnikova, Adam Smith, Homin K Lee, Kobbi Nissim, and Shiva Prasad Kasiviswanathan. 2008. What Can We Learn Privately?. In Symposium on Foundations of Computer Science (FOCS)."},{"key":"e_1_3_2_1_74_1","volume-title":"Recommenders: Figuring out how to bring unique joy to each member.","author":"Research Netflix","year":"2021","unstructured":"Netflix Research. 2021. Recommenders: Figuring out how to bring unique joy to each member. (2021). https:\/\/research.netflix.com\/research-area\/recommendations"},{"key":"e_1_3_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1145\/192844.192905"},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1145\/2393347.2393437"},{"key":"e_1_3_2_1_77_1","volume-title":"Collaborative filtering recommender systems. The adaptive web","author":"Schafer J Ben","unstructured":"J Ben Schafer, Dan Frankowski, Jon Herlocker, and Shilad Sen. 2007. Collaborative filtering recommender systems. The adaptive web. Springer, 291--324."},{"key":"e_1_3_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1145\/1454008.1454048"},{"key":"e_1_3_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2805356"},{"key":"e_1_3_2_1_80_1","volume-title":"SLINK: an optimally efficient algorithm for the single-link cluster method. The computer journal","author":"Sibson Robin","year":"1973","unstructured":"Robin Sibson. 1973. SLINK: an optimally efficient algorithm for the single-link cluster method. The computer journal, Vol. 16, 1 (1973), 30--34."},{"key":"e_1_3_2_1_81_1","volume-title":"International World Wide Web Conference (WWW).","author":"Singla Parag","year":"2008","unstructured":"Parag Singla and Matthew Richardson. 2008. Yes, there is a correlation - from social networks to personal behavior on the web. In International World Wide Web Conference (WWW)."},{"key":"e_1_3_2_1_82_1","volume-title":"WhatsApp clarifies it's not giving all your data to Facebook after surge in Signal and Telegram users. The Verge","author":"Statt Nick","year":"2021","unstructured":"Nick Statt. 2021. WhatsApp clarifies it's not giving all your data to Facebook after surge in Signal and Telegram users. The Verge (2021). https:\/\/www.theverge.com\/2021\/1\/12\/22226792\/whatsapp-privacy-policy-response-signal-telegram-controversy-clarification"},{"key":"e_1_3_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-013-0141-9"},{"key":"e_1_3_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.1145\/3378679.3394533"},{"key":"e_1_3_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11835"},{"key":"e_1_3_2_1_86_1","volume-title":"Collecting and Analyzing Multidimensional Data with Local Differential Privacy. In International Conference on Data Engineering (ICDE).","author":"Wang Ning","year":"2019","unstructured":"Ning Wang, Xiaokui Xiao, Yin Yang, Jun Zhao, Siu Cheung Hui, Hyejin Shin, Junbum Shin, and Ge Yu. 2019. Collecting and Analyzing Multidimensional Data with Local Differential Privacy. In International Conference on Data Engineering (ICDE)."},{"key":"e_1_3_2_1_87_1","volume-title":"Differential Privacy Preserving Spectral Graph Analysis. In Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD).","author":"Wang Yue","year":"2013","unstructured":"Yue Wang, Xintao Wu, and Leting Wu. 2013. Differential Privacy Preserving Spectral Graph Analysis. In Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD)."},{"key":"e_1_3_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500845"},{"key":"e_1_3_2_1_89_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623642"},{"key":"e_1_3_2_1_90_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2016.7472065"},{"key":"e_1_3_2_1_91_1","unstructured":"Dana Yakoobinsky and Dafang He. 2020. Using machine learning to auto-organize boards. (2020). https:\/\/medium.com\/pinterest-engineering\/using-machine-learning-to-auto-organize-boards-13a12b22bf5."},{"key":"e_1_3_2_1_92_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526745"},{"key":"e_1_3_2_1_93_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2016.2605085"},{"key":"e_1_3_2_1_94_1","doi-asserted-by":"publisher","DOI":"10.1109\/TST.2015.7128943"},{"key":"e_1_3_2_1_95_1","volume-title":"PrivKV: Key-Value Data Collection with Local Differential Privacy. In Symposium on Security and Privacy (S&P).","author":"Ye Qingqing","year":"2019","unstructured":"Qingqing Ye, Haibo Hu, Xiaofeng Meng, and Huadi Zheng. 2019. PrivKV: Key-Value Data Collection with Local Differential Privacy. In Symposium on Security and Privacy (S&P)."},{"key":"e_1_3_2_1_96_1","volume-title":"Private Release of Graph Statistics Using Ladder Functions. In Conference on Management of Data (SIGMOD).","author":"Zhang Jun","year":"2015","unstructured":"Jun Zhang, Graham Cormode, Cecilia M. Procopiuc, Divesh Srivastava, and Xiaokui Xiao. 2015. Private Release of Graph Statistics Using Ladder Functions. In Conference on Management of Data (SIGMOD)."},{"key":"e_1_3_2_1_97_1","unstructured":"Tianqing Zhu Gang Li Yongli Ren Wanlei Zhou and Ping Xiong. 2013. Differential privacy for neighborhood-based collaborative filtering. In Advances in Social Networks Analysis and Mining (ASONAM)."}],"event":{"name":"CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security","location":"Virtual Event Republic of Korea","acronym":"CCS '21","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460120.3484822","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3460120.3484822","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T20:49:16Z","timestamp":1763498956000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460120.3484822"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,12]]},"references-count":97,"alternative-id":["10.1145\/3460120.3484822","10.1145\/3460120"],"URL":"https:\/\/doi.org\/10.1145\/3460120.3484822","relation":{},"subject":[],"published":{"date-parts":[[2021,11,12]]},"assertion":[{"value":"2021-11-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}