{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T06:48:35Z","timestamp":1774421315729,"version":"3.50.1"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031221040","type":"print"},{"value":"9783031221057","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22105-7_14","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:12:32Z","timestamp":1672549952000},"page":"150-161","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Fully Dynamic k-Center Clustering with\u00a0Outliers"],"prefix":"10.1007","author":[{"given":"T.-H. Hubert","family":"Chan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Silvio","family":"Lattanzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mauro","family":"Sozio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"14_CR1","unstructured":"Bateni, M., Esfandiari, H., Jayaram, R., Mirrokni, V.S.: Optimal fully dynamic k-centers clustering. CoRR abs\/2112.07050 (2021)"},{"key":"14_CR2","unstructured":"de Berg, M., Monemizadeh, M., Zhong, Y.: k-center clustering with outliers in the sliding-window model. In: ESA, vol. 204, pp. 1\u201313. Schloss Dagstuhl (2021)"},{"key":"14_CR3","unstructured":"Bhaskara, A., Vadgama, S., Xu, H.: Greedy sampling for approximate clustering in the presence of outliers. In: NeurIPS, pp. 11146\u201311155 (2019)"},{"issue":"7","key":"14_CR4","doi-asserted-by":"publisher","first-page":"766","DOI":"10.14778\/3317315.3317319","volume":"12","author":"M Ceccarello","year":"2019","unstructured":"Ceccarello, M., Pietracaprina, A., Pucci, G.: Solving k-center clustering (with outliers) in MapReduce and streaming, almost as accurately as sequentially. Proc. VLDB Endow. 12(7), 766\u2013778 (2019)","journal-title":"Proc. VLDB Endow."},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Chan, T.H., Guerqin, A., Sozio, M.: Fully dynamic k-center clustering. In: WWW, pp. 579\u2013587 (2018)","DOI":"10.1145\/3178876.3186124"},{"issue":"7","key":"14_CR6","first-page":"3255","volume":"34","author":"TH Chan","year":"2022","unstructured":"Chan, T.H., Guerquin, A., Hu, S., Sozio, M.: Fully dynamic k-center clustering with improved memory efficiency. IEEE Trans. Knowl. Data Eng. 34(7), 3255\u20133266 (2022)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"14_CR7","unstructured":"Charikar, M., Khuller, S., Mount, D.M., Narasimhan, G.: Algorithms for facility location problems with outliers. In: SODA, pp. 642\u2013651 (2001)"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Charikar, M., O\u2019Callaghan, L., Panigrahy, R.: Better streaming algorithms for clustering problems. In: STOC, pp. 30\u201339 (2003)","DOI":"10.1145\/780542.780548"},{"key":"14_CR9","unstructured":"Cohen-Addad, V., Hjuler, N.O.D., Parotsidis, N., Saulpic, D., Schwiegelshohn, C.: Fully dynamic consistent facility location. In: NeurIPS, pp. 3250\u20133260 (2019)"},{"key":"14_CR10","unstructured":"Cohen-Addad, V., Schwiegelshohn, C., Sohler, C.: Diameter and k-center in sliding windows. In: ICALP, pp. 1\u201312 (2016)"},{"key":"14_CR11","unstructured":"Ding, H., Yu, H., Wang, Z.: Greedy strategy works for k-center clustering with outliers and coreset construction. In: ESA (2019)"},{"key":"14_CR12","unstructured":"Goranci, G., Henzinger, M., Leniowski, D., Svozil, A.: Fully dynamic k-center clustering in doubling metrics. arXiv preprint arXiv:1908.03948 (2019)"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Harris, D.G., Pensyl, T.W., Srinivasan, A., Trinh, K.: A lottery model for center-type problems with outliers. ACM Trans. Algorithms 15(3), 36:1\u201336:25 (2019)","DOI":"10.1145\/3311953"},{"key":"14_CR14","unstructured":"Henzinger, M., Kale, S.: Fully-dynamic coresets. In: 2020 ESA LIPIcs, vol. 173, pp. 57:1\u201357:21 (2020)"},{"key":"14_CR15","unstructured":"Hou, B.J., Zhang, L., Zhou, Z.H.: Learning with feature evolvable streams. In: Advances in Neural Information Processing Systems, pp. 1417\u20131427 (2017)"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Huang, L., Jiang, S., Li, J., Wu, X.: Epsilon-coresets for clustering (with outliers) in doubling metrics. In: FOCS, pp. 814\u2013825 (2018)","DOI":"10.1109\/FOCS.2018.00082"},{"key":"14_CR17","unstructured":"Malkomes, G., Kusner, M.J., Chen, W., Weinberger, K.Q., Moseley, B.: Fast distributed k-center clustering with outliers on massive data. In: Advances in Neural Information Processing Systems, pp. 1063\u20131071 (2015)"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-540-85363-3_14","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"R Matthew McCutchen","year":"2008","unstructured":"Matthew McCutchen, R., Khuller, S.: Streaming algorithms for k-center clustering with outliers and with anonymity. In: Goel, A., Jansen, K., Rolim, J.D.P., Rubinfeld, R. (eds.) APPROX\/RANDOM -2008. LNCS, vol. 5171, pp. 165\u2013178. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85363-3_14"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Putina, A., Sozio, M., Rossi, D., Navarro, J.M.: Random histogram forest for unsupervised anomaly detection. In: ICDM, pp. 1226\u20131231. IEEE (2020)","DOI":"10.1109\/ICDM50108.2020.00154"},{"key":"14_CR20","unstructured":"Schmidt, M., Sohler, C.: Fully dynamic hierarchical diameter k-clustering and k-center. arXiv preprint arXiv:1908.02645 (2019)"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Wang, H., Fan, W., Yu, P.S., Han, J.: Mining concept-drifting data streams using ensemble classifiers. In: SIGKDD, pp. 226\u2013235 (2003)","DOI":"10.1145\/956750.956778"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Zhang, P., Li, J., Wang, P., Gao, B.J., Zhu, X., Guo, L.: Enabling fast prediction for ensemble models on data streams. In: SIGKDD, pp. 177\u2013185 (2011)","DOI":"10.1145\/2020408.2020442"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22105-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T22:04:29Z","timestamp":1680213869000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22105-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031221040","9783031221057"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22105-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"101","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}