{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T15:47:44Z","timestamp":1778255264549,"version":"3.51.4"},"reference-count":42,"publisher":"Association for Computing Machinery (ACM)","issue":"3","funder":[{"DOI":"10.13039\/501100006374","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62372122, 92270123"],"award-info":[{"award-number":["62372122, 92270123"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Research Grants Council, Hong Kong SAR, China","award":["15225921, 15208923, 25207224, and C2003-23Y"],"award-info":[{"award-number":["15225921, 15208923, 25207224, and C2003-23Y"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2025,6,17]]},"abstract":"<jats:p>\n                    The increasing collection and analysis of personal data driven by digital technologies has raised concerns about individual privacy. Local Differential Privacy (LDP) has emerged as a promising solution to provide rigorous privacy guarantee for users, without relying on a trusted data collector. In the context of LDP, range mean estimation over numerical values is an important yet challenging problem. Simply applying existing work may introduce overly large noise sensitivity, since all of them focus on statistical tasks (e.g., mean or distribution) across the entire domain. In this paper, we propose a novel framework for &lt;u&gt;Priv&lt;\/u&gt;ate &lt;u&gt;R&lt;\/u&gt;ange &lt;u&gt;M&lt;\/u&gt;ean (\n                    <jats:italic toggle=\"yes\">PrivRM<\/jats:italic>\n                    ) estimation under LDP. Two implementations of the framework, namely\n                    <jats:italic toggle=\"yes\">PrivRM<\/jats:italic>\n                    <jats:sup>I<\/jats:sup>\n                    and\n                    <jats:italic toggle=\"yes\">PrivRM<\/jats:italic>\n                    <jats:sup>*<\/jats:sup>\n                    , are developed, which are adaptable to all existing numerical value perturbation mechanisms. As an optimization of the framework, we also propose a distribution-aware Adaptive Adjustment (AA) strategy to dynamically confine the perturbation space for skewed data distributions. Extensive experimental results show that under the same privacy guarantee and query range, our framework\n                    <jats:italic toggle=\"yes\">PrivRM<\/jats:italic>\n                    significantly improve over existing solutions.\n                  <\/jats:p>","DOI":"10.1145\/3725414","type":"journal-article","created":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:23:29Z","timestamp":1750281809000},"page":"1-26","source":"Crossref","is-referenced-by-count":3,"title":["<i>PrivRM<\/i>\n                    : A Framework for Range Mean Estimation under Local Differential Privacy"],"prefix":"10.1145","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-7279-4352","authenticated-orcid":false,"given":"Liantong","family":"Yu","sequence":"first","affiliation":[{"name":"The Hong Kong Polytechnic University, Hong Kong SAR, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1547-2847","authenticated-orcid":false,"given":"Qingqing","family":"Ye","sequence":"additional","affiliation":[{"name":"The Hong Kong Polytechnic University, Hong Kong SAR, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5478-896X","authenticated-orcid":false,"given":"Rong","family":"Du","sequence":"additional","affiliation":[{"name":"The Hong Kong Polytechnic University, Hong Kong SAR, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,6,18]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"2019. New york taxi trip record data. https:\/\/www.nyc.gov\/site\/tlc\/about\/tlc-trip-record-data.page"},{"key":"e_1_2_1_2_1","unstructured":"2020. Frequent itemset mining dataset repository. http:\/\/fimi.ua.ac.be\/data\/"},{"key":"e_1_2_1_3_1","unstructured":"2024. PrivRM: A Framework for Range Mean Estimation under Local Differential Privacy (Full version). https:\/\/github.com\/Yunicom-YLT\/Range-mean"},{"key":"e_1_2_1_4_1","unstructured":"2024. USA Real Estate Dataset. https:\/\/www.kaggle.com\/datasets\/ahmedshahriarsakib\/usa-real-estate-dataset"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476277"},{"key":"e_1_2_1_6_1","volume-title":"Practical locally private heavy hitters. Advances in Neural Information Processing Systems 30","author":"Bassily Raef","year":"2017","unstructured":"Raef Bassily, Kobbi Nissim, Uri Stemmer, and Abhradeep Guha Thakurta. 2017. Practical locally private heavy hitters. Advances in Neural Information Processing Systems 30 (2017)."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746632"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3344722"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3197390"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196906"},{"key":"e_1_2_1_11_1","volume-title":"Collecting telemetry data privately. Advances in Neural Information Processing Systems 30","author":"Ding Bolin","year":"2017","unstructured":"Bolin Ding, Janardhan Kulkarni, and Sergey Yekhanin. 2017. Collecting telemetry data privately. Advances in Neural Information Processing Systems 30 (2017)."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3485668"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00169"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/3594512.3594520"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00035"},{"key":"e_1_2_1_16_1","volume-title":"Local privacy and statistical minimax rates. In 2013 IEEE 54th annual symposium on foundations of computer science","author":"Duchi John C","unstructured":"John C Duchi, Michael I Jordan, and Martin J Wainwright. 2013. Local privacy and statistical minimax rates. In 2013 IEEE 54th annual symposium on foundations of computer science. IEEE, 429--438."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2017.1389735"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2666468"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660348"},{"key":"e_1_2_1_21_1","volume-title":"29th USENIX security symposium (USENIX security 20). 967--984.","author":"Gu Xiaolan","unstructured":"Xiaolan Gu, Ming Li, Yueqiang Cheng, Li Xiong, and Yang Cao. 2020. {PCKV}: Locally differentially private correlated {Key-Value} data collection with optimized utility. In 29th USENIX security symposium (USENIX security 20). 967--984."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920970"},{"key":"e_1_2_1_23_1","volume-title":"Extremal mechanisms for local differential privacy. Advances in neural information processing systems 27","author":"Kairouz Peter","year":"2014","unstructured":"Peter Kairouz, Sewoong Oh, and Pramod Viswanath. 2014. Extremal mechanisms for local differential privacy. Advances in neural information processing systems 27 (2014)."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300102"},{"key":"e_1_2_1_25_1","volume-title":"32nd USENIX Security Symposium (USENIX Security 23)","author":"Li Xiaoguang","year":"2023","unstructured":"Xiaoguang Li, Ninghui Li, Wenhai Sun, Neil Zhenqiang Gong, and Hui Li. 2023. Fine-grained poisoning attack to local differential privacy protocols for mean and variance estimation. In 32nd USENIX Security Symposium (USENIX Security 23). 1739--1756."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389700"},{"key":"e_1_2_1_27_1","unstructured":"Alexander McFarlane Mood. 1950. Introduction to the Theory of Statistics. (1950)."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134086"},{"key":"e_1_2_1_29_1","first-page":"705","article-title":"Emoji frequency detection and deep link frequency","volume":"9","author":"Thakurta Abhradeep Guha","year":"2017","unstructured":"Abhradeep Guha Thakurta, Andrew H Vyrros, Umesh S Vaishampayan, Gaurav Kapoor, Julien Freudinger, Vipul Ved Prakash, Arnaud Legendre, and Steven Duplinsky. 2017. Emoji frequency detection and deep link frequency. US Patent 9,705,908.","journal-title":"US Patent"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00063"},{"key":"e_1_2_1_31_1","volume-title":"26th USENIX Security Symposium (USENIX Security 17)","author":"Wang Tianhao","year":"2017","unstructured":"Tianhao Wang, Jeremiah Blocki, Ninghui Li, and Somesh Jha. 2017. Locally differentially private protocols for frequency estimation. In 26th USENIX Security Symposium (USENIX Security 17). 729--745."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319891"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1965.10480775"},{"key":"e_1_2_1_34_1","volume-title":"31st USENIX Security Symposium (USENIX Security 22)","author":"Wu Yongji","year":"2022","unstructured":"Yongji Wu, Xiaoyu Cao, Jinyuan Jia, and Neil Zhenqiang Gong. 2022. Poisoning Attacks to Local Differential Privacy Protocols for {Key-Value} Data. In 31st USENIX Security Symposium (USENIX Security 22). 519--536."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.247"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2809790"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.3047124"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM53939.2023.10229063"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM42981.2021.9488899"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2019.00018"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.14778\/3603581.3603597"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243742"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3725414","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T18:58:43Z","timestamp":1774983523000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3725414"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,17]]},"references-count":42,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,6,17]]}},"alternative-id":["10.1145\/3725414"],"URL":"https:\/\/doi.org\/10.1145\/3725414","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,17]]}}}