{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T05:26:21Z","timestamp":1755926781888,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":54,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,10]],"date-time":"2023-07-10T00:00:00Z","timestamp":1688947200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,10]]},"DOI":"10.1145\/3579856.3590338","type":"proceedings-article","created":{"date-parts":[[2023,7,5]],"date-time":"2023-07-05T14:52:13Z","timestamp":1688568733000},"page":"53-64","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Privacy-Preserving Record Linkage for Cardinality Counting"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6851-409X","authenticated-orcid":false,"given":"Nan","family":"Wu","sequence":"first","affiliation":[{"name":"Macquarie University, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6713-7667","authenticated-orcid":false,"given":"Dinusha","family":"Vatsalan","sequence":"additional","affiliation":[{"name":"Macquarie University, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2714-0276","authenticated-orcid":false,"given":"Mohamed Ali","family":"Kaafar","sequence":"additional","affiliation":[{"name":"Macquarie University, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9793-7742","authenticated-orcid":false,"given":"Sanath Kumar","family":"Ramesh","sequence":"additional","affiliation":[{"name":"OpenTreatments Foundations, United States of America"}]}],"member":"320","published-online":{"date-parts":[[2023,7,10]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Learning with privacy at scale. Apple Machine Learning Journal - Online at: https:\/\/machinelearning.apple.com\/2017\/12\/06\/learning-with-privacy-at-scale.html","author":"Privacy\u00a0Team Apple Differential","year":"2017","unstructured":"Differential Privacy\u00a0Team Apple . 2017. Learning with privacy at scale. Apple Machine Learning Journal - Online at: https:\/\/machinelearning.apple.com\/2017\/12\/06\/learning-with-privacy-at-scale.html ( 2017 ). Differential Privacy\u00a0Team Apple. 2017. Learning with privacy at scale. Apple Machine Learning Journal - Online at: https:\/\/machinelearning.apple.com\/2017\/12\/06\/learning-with-privacy-at-scale.html (2017)."},{"key":"e_1_3_2_1_2_1","first-page":"2238","article-title":"Algorithms Associated with Streaming Data Problems","volume":"14","author":"Balasubramaniam Ramesh","year":"2019","unstructured":"Ramesh Balasubramaniam and K Nandhini . 2019 . Algorithms Associated with Streaming Data Problems . International Journal of Applied Engineering Research 14 , 9 (2019), 2238 \u2013 2243 . Ramesh Balasubramaniam and K Nandhini. 2019. Algorithms Associated with Streaming Data Problems. International Journal of Applied Engineering Research 14, 9 (2019), 2238\u20132243.","journal-title":"International Journal of Applied Engineering Research"},{"key":"e_1_3_2_1_3_1","volume-title":"International Workshop on Randomization and Approximation Techniques in Computer Science. Springer, 1\u201310","author":"Bar-Yossef Ziv","year":"2002","unstructured":"Ziv Bar-Yossef , TS Jayram , Ravi Kumar , D Sivakumar , and Luca Trevisan . 2002 . Counting distinct elements in a data stream . In International Workshop on Randomization and Approximation Techniques in Computer Science. Springer, 1\u201310 . Ziv Bar-Yossef, TS Jayram, Ravi Kumar, D Sivakumar, and Luca Trevisan. 2002. Counting distinct elements in a data stream. In International Workshop on Randomization and Approximation Techniques in Computer Science. Springer, 1\u201310."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1080\/03610927408827101"},{"key":"e_1_3_2_1_6_1","volume-title":"International Conference on Data Mining Workshops. IEEE, 1297\u20131303","author":"Chabchoub Yousra","year":"2010","unstructured":"Yousra Chabchoub and Georges H\u00e9brail . 2010 . Sliding hyperloglog: Estimating cardinality in a data stream over a sliding window . In International Conference on Data Mining Workshops. IEEE, 1297\u20131303 . Yousra Chabchoub and Georges H\u00e9brail. 2010. Sliding hyperloglog: Estimating cardinality in a data stream over a sliding window. In International Conference on Data Mining Workshops. IEEE, 1297\u20131303."},{"key":"e_1_3_2_1_7_1","volume-title":"International Conference on Management of Data. 1087\u20131098","author":"Chen Guoqiang\u00a0Jerry","year":"2016","unstructured":"Guoqiang\u00a0Jerry Chen , Janet\u00a0 L Wiener , Shridhar Iyer , Anshul Jaiswal , Ran Lei , Nikhil Simha , Wei Wang , Kevin Wilfong , Tim Williamson , and Serhat Yilmaz . 2016 . Realtime data processing at Facebook . In International Conference on Management of Data. 1087\u20131098 . Guoqiang\u00a0Jerry Chen, Janet\u00a0L Wiener, Shridhar Iyer, Anshul Jaiswal, Ran Lei, Nikhil Simha, Wei Wang, Kevin Wilfong, Tim Williamson, and Serhat Yilmaz. 2016. Realtime data processing at Facebook. In International Conference on Management of Data. 1087\u20131098."},{"volume-title":"Data matching - concepts and techniques for record linkage, entity resolution, and duplicate detection","author":"Christen Peter","key":"e_1_3_2_1_8_1","unstructured":"Peter Christen . 2012. Data matching - concepts and techniques for record linkage, entity resolution, and duplicate detection . Springer . Peter Christen. 2012. Data matching - concepts and techniques for record linkage, entity resolution, and duplicate detection. Springer."},{"key":"e_1_3_2_1_9_1","volume-title":"Precise and fast cryptanalysis for Bloom filter based privacy-preserving record linkage","author":"Christen Peter","year":"2018","unstructured":"Peter Christen , Thilina Ranbaduge , Dinusha Vatsalan , and Rainer Schnell . 2018. Precise and fast cryptanalysis for Bloom filter based privacy-preserving record linkage . IEEE Transactions on Knowledge and Data Engineering ( 2018 ), 1. Peter Christen, Thilina Ranbaduge, Dinusha Vatsalan, and Rainer Schnell. 2018. Precise and fast cryptanalysis for Bloom filter based privacy-preserving record linkage. IEEE Transactions on Knowledge and Data Engineering (2018), 1."},{"volume-title":"PAKDD","author":"Christen Peter","key":"e_1_3_2_1_10_1","unstructured":"Peter Christen , Anushka Vidanage , Thilina Ranbaduge , and Rainer Schnell . 2018. Pattern-mining based cryptanalysis of Bloom filters for privacy-preserving record linkage . In PAKDD , Springer LNAI. Melbourne , 530\u2013542. Peter Christen, Anushka Vidanage, Thilina Ranbaduge, and Rainer Schnell. 2018. Pattern-mining based cryptanalysis of Bloom filters for privacy-preserving record linkage. In PAKDD, Springer LNAI. Melbourne, 530\u2013542."},{"key":"e_1_3_2_1_11_1","volume-title":"Cohen and Jacob Richman","author":"W.","year":"2002","unstructured":"William\u00a0 W. Cohen and Jacob Richman . 2002 . Learning to Match and Cluster Large High-dimensional Data Sets for Data Integration. In ACM SIGKDD. 475\u2013480. William\u00a0W. Cohen and Jacob Richman. 2002. Learning to Match and Cluster Large High-dimensional Data Sets for Data Integration. In ACM SIGKDD. 475\u2013480."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2019-0018"},{"key":"e_1_3_2_1_13_1","volume-title":"International Symposium on Knowledge and Systems Sciences. Springer, 1\u201317","author":"Dinh Duy-Tai","year":"2019","unstructured":"Duy-Tai Dinh , Tsutomu Fujinami , and Van-Nam Huynh . 2019 . Estimating the optimal number of clusters in categorical data clustering by silhouette coefficient . In International Symposium on Knowledge and Systems Sciences. Springer, 1\u201317 . Duy-Tai Dinh, Tsutomu Fujinami, and Van-Nam Huynh. 2019. Estimating the optimal number of clusters in categorical data clustering by silhouette coefficient. In International Symposium on Knowledge and Systems Sciences. Springer, 1\u201317."},{"key":"e_1_3_2_1_14_1","volume-title":"International Colloquium on Automata, Languages and Programming","author":"Dwork C.","year":"2006","unstructured":"C. Dwork . 2006. Differential privacy . International Colloquium on Automata, Languages and Programming ( 2006 ), 1\u201312. C. Dwork. 2006. Differential privacy. International Colloquium on Automata, Languages and Programming (2006), 1\u201312."},{"volume-title":"Theory and Applications of Models of Computation","author":"Dwork Cynthia","key":"e_1_3_2_1_15_1","unstructured":"Cynthia Dwork . 2008. Differential privacy: A survey of results . In Theory and Applications of Models of Computation . Springer , 1\u201319. Cynthia Dwork. 2008. Differential privacy: A survey of results. In Theory and Applications of Models of Computation. Springer, 1\u201319."},{"key":"e_1_3_2_1_16_1","unstructured":"Cynthia Dwork Moni Naor Toniann Pitassi Guy\u00a0N Rothblum and Sergey Yekhanin. 2010. Pan-Private Streaming Algorithms.. In ICS. 66\u201380.  Cynthia Dwork Moni Naor Toniann Pitassi Guy\u00a0N Rothblum and Sergey Yekhanin. 2010. Pan-Private Streaming Algorithms.. In ICS. 66\u201380."},{"key":"e_1_3_2_1_17_1","volume-title":"SIGSAC conference on computer and communications security. ACM, 1054\u20131067","author":"Erlingsson \u00dalfar","year":"2014","unstructured":"\u00dalfar Erlingsson , Vasyl Pihur , and Aleksandra Korolova . 2014 . Rappor: Randomized aggregatable privacy-preserving ordinal response . In SIGSAC conference on computer and communications security. ACM, 1054\u20131067 . \u00dalfar Erlingsson, Vasyl Pihur, and Aleksandra Korolova. 2014. Rappor: Randomized aggregatable privacy-preserving ordinal response. In SIGSAC conference on computer and communications security. ACM, 1054\u20131067."},{"key":"e_1_3_2_1_18_1","volume-title":"New cardinality estimation algorithms for HyperLogLog sketches. arXiv preprint arXiv:1702.01284","author":"Ertl Otmar","year":"2017","unstructured":"Otmar Ertl . 2017. New cardinality estimation algorithms for HyperLogLog sketches. arXiv preprint arXiv:1702.01284 ( 2017 ). Otmar Ertl. 2017. New cardinality estimation algorithms for HyperLogLog sketches. arXiv preprint arXiv:1702.01284 (2017)."},{"key":"e_1_3_2_1_19_1","volume-title":"ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems. 211\u2013222","author":"Evfimievski Alexandre","year":"2003","unstructured":"Alexandre Evfimievski , Johannes Gehrke , and Ramakrishnan Srikant . 2003 . Limiting privacy breaches in privacy preserving data mining . In ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems. 211\u2013222 . Alexandre Evfimievski, Johannes Gehrke, and Ramakrishnan Srikant. 2003. Limiting privacy breaches in privacy preserving data mining. In ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems. 211\u2013222."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02241657"},{"key":"e_1_3_2_1_21_1","volume-title":"Conference on Analysis of Algorithms (AofA)","author":"Flajolet Philippe","year":"2007","unstructured":"Philippe Flajolet , \u00c9ric Fusy , Olivier Gandouet , and Fr\u00e9d\u00e9ric Meunier . 2007 . Hyperloglog: the analysis of a near-optimal cardinality estimation algorithm . In Conference on Analysis of Algorithms (AofA) . Nancy, France. Philippe Flajolet, \u00c9ric Fusy, Olivier Gandouet, and Fr\u00e9d\u00e9ric Meunier. 2007. Hyperloglog: the analysis of a near-optimal cardinality estimation algorithm. In Conference on Analysis of Algorithms (AofA). Nancy, France."},{"key":"e_1_3_2_1_22_1","unstructured":"Phillip\u00a0B Gibbons. 2001. Distinct sampling for highly-accurate answers to distinct values queries and event reports. In VLDB Vol.\u00a01. 541\u2013550.  Phillip\u00a0B Gibbons. 2001. Distinct sampling for highly-accurate answers to distinct values queries and event reports. In VLDB Vol.\u00a01. 541\u2013550."},{"volume-title":"Data Stream Management","author":"Gibbons B","key":"e_1_3_2_1_23_1","unstructured":"Phillip\u00a0 B Gibbons . 2016. Distinct-values estimation over data streams . In Data Stream Management . Springer , 121\u2013147. Phillip\u00a0B Gibbons. 2016. Distinct-values estimation over data streams. In Data Stream Management. Springer, 121\u2013147."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"A. Gkoulalas-Divanis D. Vatsalan D. Karapiperis and M. Kantarcioglu. 2021. Modern Privacy-Preserving Record Linkage Techniques: An Overview. IEEE TIFS (2021).  A. Gkoulalas-Divanis D. Vatsalan D. Karapiperis and M. Kantarcioglu. 2021. Modern Privacy-Preserving Record Linkage Techniques: An Overview. IEEE TIFS (2021).","DOI":"10.1109\/TIFS.2021.3114026"},{"key":"e_1_3_2_1_25_1","volume-title":"Efficient Exact Algorithm for Count Distinct Problem. In International Workshop on Computer Algebra in Scientific Computing. Springer, 67\u201377","author":"Golov Nikolay","year":"2019","unstructured":"Nikolay Golov , Alexander Filatov , and Sergey Bruskin . 2019 . Efficient Exact Algorithm for Count Distinct Problem. In International Workshop on Computer Algebra in Scientific Computing. Springer, 67\u201377 . Nikolay Golov, Alexander Filatov, and Sergey Bruskin. 2019. Efficient Exact Algorithm for Count Distinct Problem. In International Workshop on Computer Algebra in Scientific Computing. Springer, 67\u201377."},{"key":"e_1_3_2_1_26_1","volume-title":"Wired","author":"Greenberg Andy","year":"2016","unstructured":"Andy Greenberg . 2016 . Apple\u2019s \u2018differential privacy\u2019is about collecting your data\u2014but not your data . Wired , June 13 (2016). Andy Greenberg. 2016. Apple\u2019s \u2018differential privacy\u2019is about collecting your data\u2014but not your data. Wired, June 13 (2016)."},{"key":"e_1_3_2_1_27_1","unstructured":"Peter\u00a0J Haas Jeffrey\u00a0F Naughton S Seshadri and Lynne Stokes. 1995. Sampling-based estimation of the number of distinct values of an attribute. In VLDB Vol.\u00a095. 311\u2013322.  Peter\u00a0J Haas Jeffrey\u00a0F Naughton S Seshadri and Lynne Stokes. 1995. Sampling-based estimation of the number of distinct values of an attribute. In VLDB Vol.\u00a095. 311\u2013322."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3164135.3164145"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687771"},{"key":"e_1_3_2_1_30_1","volume-title":"International Conference on Extending Database Technology. 683\u2013692","author":"Heule Stefan","year":"2013","unstructured":"Stefan Heule , Marc Nunkesser , and Alexander Hall . 2013 . HyperLogLog in practice: algorithmic engineering of a state of the art cardinality estimation algorithm . In International Conference on Extending Database Technology. 683\u2013692 . Stefan Heule, Marc Nunkesser, and Alexander Hall. 2013. HyperLogLog in practice: algorithmic engineering of a state of the art cardinality estimation algorithm. In International Conference on Extending Database Technology. 683\u2013692."},{"key":"e_1_3_2_1_31_1","volume-title":"Search log analysis: What it is, what\u2019s been done, how to do it","author":"Jansen J","year":"2006","unstructured":"Bernard\u00a0 J Jansen . 2006. Search log analysis: What it is, what\u2019s been done, how to do it . Library & information science research 28, 3 ( 2006 ), 407\u2013432. Bernard\u00a0J Jansen. 2006. Search log analysis: What it is, what\u2019s been done, how to do it. Library & information science research 28, 3 (2006), 407\u2013432."},{"key":"e_1_3_2_1_32_1","first-page":"793","article-title":"What can we learn privately?SIAM J","volume":"40","author":"Kasiviswanathan Shiva\u00a0Prasad","year":"2011","unstructured":"Shiva\u00a0Prasad Kasiviswanathan , Homin\u00a0 K Lee , Kobbi Nissim , Sofya Raskhodnikova , and Adam Smith . 2011 . What can we learn privately?SIAM J . Comput. 40 , 3 (2011), 793 \u2013 826 . Shiva\u00a0Prasad Kasiviswanathan, Homin\u00a0K Lee, Kobbi Nissim, Sofya Raskhodnikova, and Adam Smith. 2011. What can we learn privately?SIAM J. Comput. 40, 3 (2011), 793\u2013826.","journal-title":"Comput."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.884032"},{"key":"e_1_3_2_1_34_1","volume-title":"ACM SIGSAC Conference on Computer and Communications Security. 425\u2013438","author":"Qin Zhan","year":"2017","unstructured":"Zhan Qin , Ting Yu , Yin Yang , Issa Khalil , Xiaokui Xiao , and Kui Ren . 2017 . Generating synthetic decentralized social graphs with local differential privacy . In ACM SIGSAC Conference on Computer and Communications Security. 425\u2013438 . Zhan Qin, Ting Yu, Yin Yang, Issa Khalil, Xiaokui Xiao, and Kui Ren. 2017. Generating synthetic decentralized social graphs with local differential privacy. In ACM SIGSAC Conference on Computer and Communications Security. 425\u2013438."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jbi.2013.12.003","article-title":"Privacy-preserving record linkage on large real world datasets","volume":"50","author":"Randall M","year":"2014","unstructured":"Sean\u00a0 M Randall , Anna\u00a0 M Ferrante , James\u00a0 H Boyd , and James\u00a0 B Semmens . 2014 . Privacy-preserving record linkage on large real world datasets . Journal of Biomedical Informatics 50 , 1 (2014), 1 . Sean\u00a0M Randall, Anna\u00a0M Ferrante, James\u00a0H Boyd, and James\u00a0B Semmens. 2014. Privacy-preserving record linkage on large real world datasets. Journal of Biomedical Informatics 50, 1 (2014), 1.","journal-title":"Journal of Biomedical Informatics"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(87)90125-7"},{"key":"e_1_3_2_1_37_1","volume-title":"Scalable matching and clustering of entities with FAMER. Complex Systems Informatics and Modeling Quarterly16","author":"Saeedi Alieh","year":"2018","unstructured":"Alieh Saeedi , Markus Nentwig , Eric Peukert , and Erhard Rahm . 2018. Scalable matching and clustering of entities with FAMER. Complex Systems Informatics and Modeling Quarterly16 ( 2018 ), 61\u201383. Alieh Saeedi, Markus Nentwig, Eric Peukert, and Erhard Rahm. 2018. Scalable matching and clustering of entities with FAMER. Complex Systems Informatics and Modeling Quarterly16 (2018), 61\u201383."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","first-page":"199","DOI":"10.2174\/1574884713666180604081349","article-title":"Trends of Clinical Trials for Drug Development in Rare Diseases","volume":"13","author":"Sakate R.","year":"2018","unstructured":"R. Sakate , A. Fukagawa , Y. Takagaki , H. Okura , and A. Matsuyama . 2018 . Trends of Clinical Trials for Drug Development in Rare Diseases . Curr Clin Pharmacol 13 , 3 (2018), 199 \u2013 208 . R. Sakate, A. Fukagawa, Y. Takagaki, H. Okura, and A. Matsuyama. 2018. Trends of Clinical Trials for Drug Development in Rare Diseases. Curr Clin Pharmacol 13, 3 (2018), 199\u2013208.","journal-title":"Curr Clin Pharmacol"},{"volume-title":"Methodological developments in data linkage","author":"Schnell Rainer","key":"e_1_3_2_1_39_1","unstructured":"Rainer Schnell . 2016. Privacy preserving record linkage . In Methodological developments in data linkage , Katie Harron, Harvey Goldstein, and Chris Dibben (Eds.). Wiley , Chichester , 201\u2013225. Rainer Schnell. 2016. Privacy preserving record linkage. In Methodological developments in data linkage, Katie Harron, Harvey Goldstein, and Chris Dibben (Eds.). Wiley, Chichester, 201\u2013225."},{"key":"e_1_3_2_1_40_1","volume-title":"The spread of fake news by social bots. arXiv preprint arXiv:1707.07592 96","author":"Shao Chengcheng","year":"2017","unstructured":"Chengcheng Shao , Giovanni\u00a0Luca Ciampaglia , Onur Varol , Alessandro Flammini , and Filippo Menczer . 2017. The spread of fake news by social bots. arXiv preprint arXiv:1707.07592 96 ( 2017 ), 104. Chengcheng Shao, Giovanni\u00a0Luca Ciampaglia, Onur Varol, Alessandro Flammini, and Filippo Menczer. 2017. The spread of fake news by social bots. arXiv preprint arXiv:1707.07592 96 (2017), 104."},{"key":"e_1_3_2_1_41_1","unstructured":"Hagen Sparka Florian Tschorsch and Bj\u00f6rn Scheuermann. 2018. P2KMV: a privacy-preserving counting sketch for efficient and accurate set intersection cardinality estimations. (2018).  Hagen Sparka Florian Tschorsch and Bj\u00f6rn Scheuermann. 2018. P2KMV: a privacy-preserving counting sketch for efficient and accurate set intersection cardinality estimations. (2018)."},{"key":"e_1_3_2_1_42_1","volume-title":"2017 IEEE Symposium on Privacy-Aware Computing (PAC). IEEE, 37\u201348","author":"Stanojevic Rade","year":"2017","unstructured":"Rade Stanojevic , Mohamed Nabeel , and Ting Yu . 2017 . Distributed cardinality estimation of set operations with differential privacy . In 2017 IEEE Symposium on Privacy-Aware Computing (PAC). IEEE, 37\u201348 . Rade Stanojevic, Mohamed Nabeel, and Ting Yu. 2017. Distributed cardinality estimation of set operations with differential privacy. In 2017 IEEE Symposium on Privacy-Aware Computing (PAC). IEEE, 37\u201348."},{"key":"e_1_3_2_1_43_1","volume-title":"ACM International on Conference on Information and Knowledge Management. 1603\u20131612","author":"Su Hong","year":"2016","unstructured":"Hong Su , Mohamed Zait , Vladimir Barri\u00e8re , Joseph Torres , and Andre Menck . 2016 . Approximate aggregates in oracle 12c . In ACM International on Conference on Information and Knowledge Management. 1603\u20131612 . Hong Su, Mohamed Zait, Vladimir Barri\u00e8re, Joseph Torres, and Andre Menck. 2016. Approximate aggregates in oracle 12c. In ACM International on Conference on Information and Knowledge Management. 1603\u20131612."},{"key":"e_1_3_2_1_44_1","volume-title":"ACM Conference in Knowledge Management","author":"Tran Khoi-Nguyen","year":"2013","unstructured":"Khoi-Nguyen Tran , Dinusha Vatsalan , and Peter Christen . 2013 . GeCo: an online personal data generator and corruptor . In ACM Conference in Knowledge Management . San Francisco, 2473\u20132476. Khoi-Nguyen Tran, Dinusha Vatsalan, and Peter Christen. 2013. GeCo: an online personal data generator and corruptor. In ACM Conference in Knowledge Management. San Francisco, 2473\u20132476."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jbi.2015.12.004"},{"key":"e_1_3_2_1_46_1","volume-title":"Incremental clustering techniques for multi-party Privacy-Preserving Record Linkage. Data & Knowledge Engineering","author":"Vatsalan Dinusha","year":"2020","unstructured":"Dinusha Vatsalan , Peter Christen , and Erhard Rahm . 2020. Incremental clustering techniques for multi-party Privacy-Preserving Record Linkage. Data & Knowledge Engineering ( 2020 ). Dinusha Vatsalan, Peter Christen, and Erhard Rahm. 2020. Incremental clustering techniques for multi-party Privacy-Preserving Record Linkage. Data & Knowledge Engineering (2020)."},{"key":"e_1_3_2_1_47_1","volume-title":"An Efficient Two-Party Protocol for Approximate Matching in Private Record Linkage. In Australasian Data Mining Conference","author":"Vatsalan D.","year":"2011","unstructured":"D. Vatsalan , P. Christen , and Vassilios\u00a0 S. Verykios . 2011 . An Efficient Two-Party Protocol for Approximate Matching in Private Record Linkage. In Australasian Data Mining Conference . Ballarat, Australia. D. Vatsalan, P. Christen, and Vassilios\u00a0S. Verykios. 2011. An Efficient Two-Party Protocol for Approximate Matching in Private Record Linkage. In Australasian Data Mining Conference. Ballarat, Australia."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2012.11.005"},{"volume-title":"Handbook of Big Data Technologies","author":"Vatsalan Dinusha","key":"e_1_3_2_1_49_1","unstructured":"Dinusha Vatsalan , Ziad Sehili , Peter Christen , and Erhard Rahm . 2017. Privacy-preserving record linkage for Big data: Current approaches and research challenges . In Handbook of Big Data Technologies . Springer , 851\u2013895. Dinusha Vatsalan, Ziad Sehili, Peter Christen, and Erhard Rahm. 2017. Privacy-preserving record linkage for Big data: Current approaches and research challenges. In Handbook of Big Data Technologies. Springer, 851\u2013895."},{"key":"e_1_3_2_1_50_1","volume-title":"RRTxFM: Probabilistic Counting for Differentially Private Statistics. In Conference on e-Business, e-Services and e-Society. Springer, 86\u201398","author":"von Voigt Saskia\u00a0Nu\u00f1ez","year":"2019","unstructured":"Saskia\u00a0Nu\u00f1ez von Voigt and Florian Tschorsch . 2019 . RRTxFM: Probabilistic Counting for Differentially Private Statistics. In Conference on e-Business, e-Services and e-Society. Springer, 86\u201398 . Saskia\u00a0Nu\u00f1ez von Voigt and Florian Tschorsch. 2019. RRTxFM: Probabilistic Counting for Differentially Private Statistics. In Conference on e-Business, e-Services and e-Society. Springer, 86\u201398."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3068332","article-title":"Clickstream user behavior models","volume":"11","author":"Wang Gang","year":"2017","unstructured":"Gang Wang , Xinyi Zhang , Shiliang Tang , Christo Wilson , Haitao Zheng , and Ben\u00a0 Y Zhao . 2017 . Clickstream user behavior models . ACM Transactions on the Web (TWEB) 11 , 4 (2017), 1 \u2013 37 . Gang Wang, Xinyi Zhang, Shiliang Tang, Christo Wilson, Haitao Zheng, and Ben\u00a0Y Zhao. 2017. Clickstream user behavior models. ACM Transactions on the Web (TWEB) 11, 4 (2017), 1\u201337.","journal-title":"ACM Transactions on the Web (TWEB)"},{"key":"e_1_3_2_1_52_1","volume-title":"IOP Conference Series: Materials Science and Engineering, Vol.\u00a0569","author":"Wang Xu","year":"2019","unstructured":"Xu Wang and Yusheng Xu . 2019 . An improved index for clustering validation based on Silhouette index and Calinski-Harabasz index . In IOP Conference Series: Materials Science and Engineering, Vol.\u00a0569 . IOP Publishing, 05 2024. Xu Wang and Yusheng Xu. 2019. An improved index for clustering validation based on Silhouette index and Calinski-Harabasz index. In IOP Conference Series: Materials Science and Engineering, Vol.\u00a0569. IOP Publishing, 052024."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1965.10480775"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/78922.78925"}],"event":{"name":"ASIA CCS '23: ACM ASIA Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Melbourne VIC Australia","acronym":"ASIA CCS '23"},"container-title":["Proceedings of the ACM Asia Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3579856.3590338","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:08:16Z","timestamp":1750183696000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3579856.3590338"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,10]]},"references-count":54,"alternative-id":["10.1145\/3579856.3590338","10.1145\/3579856"],"URL":"https:\/\/doi.org\/10.1145\/3579856.3590338","relation":{},"subject":[],"published":{"date-parts":[[2023,7,10]]},"assertion":[{"value":"2023-07-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}