{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T13:26:22Z","timestamp":1792070782889,"version":"4.4.0"},"reference-count":48,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,12,17]],"date-time":"2022-12-17T00:00:00Z","timestamp":1671235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,12,17]],"date-time":"2022-12-17T00:00:00Z","timestamp":1671235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,12,17]]},"DOI":"10.1109\/bigdata55660.2022.10020690","type":"proceedings-article","created":{"date-parts":[[2023,1,26]],"date-time":"2023-01-26T19:35:23Z","timestamp":1674761723000},"page":"445-454","source":"Crossref","is-referenced-by-count":7,"title":["Scalable and Accurate Density-Peaks Clustering on Fully Dynamic Data"],"prefix":"10.1109","author":[{"given":"Daichi","family":"Amagata","sequence":"first","affiliation":[{"name":"Osaka University,Osaka,Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3358053"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2737792"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-020-09874-x"},{"key":"ref4","first-page":"3019","article-title":"Dbscan++: Towards fast and scalable density clustering","volume-title":"ICML","author":"Jang"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1126\/science.1242072"},{"key":"ref6","first-page":"579","article-title":"Fully dynamic k-center clustering","volume-title":"Web Conference","author":"Chan"},{"key":"ref7","first-page":"226","article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise","volume-title":"KDD","author":"Ester"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3452781"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1002\/widm.30"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3092817"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1038\/srep45602"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783286"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380183"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00078"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064050"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2020.3023125"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3186728.3164136"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974348.1"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2017.2684807"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.102"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3452782"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-022-00729-1"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2522412"},{"key":"ref24","first-page":"798","article-title":"Navigating nets: Simple algorithms for proximity earch","volume-title":"SODA","author":"Krauthgamer"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196922"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2609423"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00077"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2909204"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-86475-0_22"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2013.10.006"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2889473"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.14778\/3303753.3303754"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.616"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/78973.78977"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/426"},{"key":"ref36","article-title":"Sliding window algorithms for k-clustering problems","author":"Borassi","year":"2020","journal-title":"NeurIPS"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.14778\/3317315.3317319"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457271"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00062"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972764.29"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281210"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/1552303.1552307"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3557915.3560935"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.3004221"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2017.06.023"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/2522968.2522981"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2005.09.012"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/304181.304187"}],"event":{"name":"2022 IEEE International Conference on Big Data (Big Data)","location":"Osaka, Japan","start":{"date-parts":[[2022,12,17]]},"end":{"date-parts":[[2022,12,20]]}},"container-title":["2022 IEEE International Conference on Big Data (Big Data)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10020192\/10020156\/10020690.pdf?arnumber=10020690","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T07:43:11Z","timestamp":1707810191000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10020690\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,17]]},"references-count":48,"URL":"https:\/\/doi.org\/10.1109\/bigdata55660.2022.10020690","relation":{},"subject":[],"published":{"date-parts":[[2022,12,17]]}}}