{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T20:50:48Z","timestamp":1749243048009,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030609351"},{"type":"electronic","value":"9783030609368"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-60936-8_22","type":"book-chapter","created":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T10:05:52Z","timestamp":1602669952000},"page":"281-296","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["BETULA: Numerically Stable CF-Trees for BIRCH Clustering"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3212-5548","authenticated-orcid":false,"given":"Andreas","family":"Lang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9143-4880","authenticated-orcid":false,"given":"Erich","family":"Schubert","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,14]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","unstructured":"Aggarwal, C.C., Han, J., Wang, J., Yu, P.S.: A framework for clustering evolving data streams. In: VLDB, pp. 81\u201392 (2003). https:\/\/doi.org\/10.1016\/B978-012722442-8\/50016-1","DOI":"10.1016\/B978-012722442-8\/50016-1"},{"key":"22_CR2","doi-asserted-by":"publisher","unstructured":"Aggarwal, C.C., Han, J., Wang, J., Yu, P.S.: A framework for projected clustering of high dimensional data streams. In: VLDB, pp. 852\u2013863 (2004). https:\/\/doi.org\/10.1016\/B978-012088469-8.50075-9","DOI":"10.1016\/B978-012088469-8.50075-9"},{"key":"22_CR3","doi-asserted-by":"publisher","unstructured":"Ankerst, M., Breunig, M.M., Kriegel, H., Sander, J.: OPTICS: ordering points to identify the clustering structure. In: SIGMOD, pp. 49\u201360 (1999). https:\/\/doi.org\/10.1145\/304182.304187","DOI":"10.1145\/304182.304187"},{"key":"22_CR4","unstructured":"Arthur, D., Vassilvitskii, S.: k-means++: the advantages of careful seeding. In: SODA, pp. 1027\u20131035 (2007)"},{"issue":"1","key":"22_CR5","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1147\/rd.81.0022","volume":"8","author":"RE Bonner","year":"1964","unstructured":"Bonner, R.E.: On some clustering techniques. IBM J. Res. Dev. 8(1), 22\u201332 (1964)","journal-title":"IBM J. Res. Dev."},{"key":"22_CR6","unstructured":"Bradley, P.S., Fayyad, U.M., Reina, C.: Scaling clustering algorithms to large databases. In: KDD, pp. 9\u201315 (1998)"},{"key":"22_CR7","doi-asserted-by":"publisher","unstructured":"Breunig, M.M., Kriegel, H., Kr\u00f6ger, P., Sander, J.: Data bubbles: quality preserving performance boosting for hierarchical clustering. In: SIGMOD, pp. 79\u201390 (2001). https:\/\/doi.org\/10.1145\/375663.375672","DOI":"10.1145\/375663.375672"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/3-540-45372-5_23","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"MM Breunig","year":"2000","unstructured":"Breunig, M.M., Kriegel, H.-P., Sander, J.: Fast hierarchical clustering based on compressed data and OPTICS. In: Zighed, D.A., Komorowski, J., \u017bytkow, J. (eds.) PKDD 2000. LNCS (LNAI), vol. 1910, pp. 232\u2013242. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45372-5_23"},{"key":"22_CR9","doi-asserted-by":"publisher","unstructured":"Cao, F., Ester, M., Qian, W., Zhou, A.: Density-based clustering over an evolving data stream with noise. In: SDM, pp. 328\u2013339 (2006). https:\/\/doi.org\/10.1137\/1.9781611972764.29","DOI":"10.1137\/1.9781611972764.29"},{"key":"22_CR10","doi-asserted-by":"publisher","unstructured":"Chiu, T., Fang, D., Chen, J., Wang, Y., Jeris, C.: A robust and scalable clustering algorithm for mixed type attributes in large database environment. In: KDD, pp. 263\u2013268 (2001). https:\/\/doi.org\/10.1145\/502512.502549","DOI":"10.1145\/502512.502549"},{"issue":"1","key":"22_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"AP Dempster","year":"1977","unstructured":"Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the EM algorithm. J. Royal Stat. Soc. Series B 39(1), 1\u201338 (1977)","journal-title":"J. Royal Stat. Soc. Series B"},{"issue":"1","key":"22_CR12","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1145\/568574.568575","volume":"4","author":"V Estivill-Castro","year":"2002","unstructured":"Estivill-Castro, V.: Why so many clustering algorithms: a position paper. SIGKDD Explor. 4(1), 65\u201375 (2002)","journal-title":"SIGKDD Explor."},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-642-40450-4_41","volume-title":"Algorithms \u2013 ESA 2013","author":"H Fichtenberger","year":"2013","unstructured":"Fichtenberger, H., Gill\u00e9, M., Schmidt, M., Schwiegelshohn, C., Sohler, C.: BICO: BIRCH meets coresets for k-means clustering. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 481\u2013492. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40450-4_41"},{"issue":"2","key":"22_CR14","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s00357-007-0004-5","volume":"24","author":"C Fraley","year":"2007","unstructured":"Fraley, C., Raftery, A.E.: Bayesian regularization for normal mixture estimation and model-based clustering. J. Classif. 24(2), 155\u2013181 (2007). https:\/\/doi.org\/10.1007\/s00357-007-0004-5","journal-title":"J. Classif."},{"issue":"1","key":"22_CR15","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1109\/69.908980","volume":"13","author":"V Ganti","year":"2001","unstructured":"Ganti, V., Gehrke, J., Ramakrishnan, R.: DEMON: mining and monitoring evolving data. IEEE Trans. Knowl. Data Eng. 13(1), 50\u201363 (2001). https:\/\/doi.org\/10.1109\/69.908980","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"22_CR16","volume-title":"Data Mining: Concepts and Techniques","author":"J Han","year":"2011","unstructured":"Han, J., Kamber, M., Pei, J.: Data Mining: Concepts and Techniques, 3rd edn. Morgan Kaufmann, Burlington (2011)","edition":"3"},{"issue":"2","key":"22_CR17","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10115-010-0342-8","volume":"29","author":"P Kranen","year":"2011","unstructured":"Kranen, P., Assent, I., Baldauf, C., Seidl, T.: The ClusTree: indexing micro-clusters for anytime stream mining. Knowl. Inf. Syst. 29(2), 249\u2013272 (2011). https:\/\/doi.org\/10.1007\/s10115-010-0342-8","journal-title":"Knowl. Inf. Syst."},{"issue":"2","key":"22_CR18","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s10115-016-1004-2","volume":"52","author":"H-P Kriegel","year":"2017","unstructured":"Kriegel, H.-P., Schubert, E., Zimek, A.: The (black) art of runtime evaluation: are we comparing algorithms or implementations? Knowl. Inf. Syst. 52(2), 341\u2013378 (2017). https:\/\/doi.org\/10.1007\/s10115-016-1004-2","journal-title":"Knowl. Inf. Syst."},{"key":"22_CR19","unstructured":"Lang, A., Schubert, E.: BETULA: numerically stable CF-trees for BIRCH clustering. CoRR abs\/2006.12881 (2020). https:\/\/arxiv.org\/abs\/2006.12881"},{"issue":"5","key":"22_CR20","doi-asserted-by":"publisher","first-page":"1003","DOI":"10.1109\/TKDE.2002.1033770","volume":"14","author":"RT Ng","year":"2002","unstructured":"Ng, R.T., Han, J.: CLARANS: a method for clustering objects for spatial data mining. IEEE Trans. Knowl. Data Eng. 14(5), 1003\u20131016 (2002). https:\/\/doi.org\/10.1109\/TKDE.2002.1033770","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"22_CR21","doi-asserted-by":"publisher","unstructured":"Schubert, E., Gertz, M.: Numerically stable parallel computation of (co-)variance. In: SSDBM, pp. 10:1\u201310:12 (2018). https:\/\/doi.org\/10.1145\/3221269.3223036","DOI":"10.1145\/3221269.3223036"},{"key":"22_CR22","unstructured":"Schubert, E., Zimek, A.: ELKI: a large open-source library for data analysis - ELKI release 0.7.5 \u201cHeidelberg\u201d. CoRR abs\/1902.03616 (2019)"},{"key":"22_CR23","unstructured":"Zhang, T.: Data clustering for very large datasets plus applications. Technical report 1355, University of Wisconsin Madison (1996)"},{"key":"22_CR24","doi-asserted-by":"publisher","unstructured":"Zhang, T., Ramakrishnan, R., Livny, M.: BIRCH: an efficient data clustering method for very large databases. In: SIGMOD, pp. 103\u2013114 (1996). https:\/\/doi.org\/10.1145\/233269.233324","DOI":"10.1145\/233269.233324"},{"issue":"2","key":"22_CR25","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1023\/A:1009783824328","volume":"1","author":"T Zhang","year":"1997","unstructured":"Zhang, T., Ramakrishnan, R., Livny, M.: BIRCH: a new data clustering algorithm and its applications. Data Min. Knowl. Discov. 1(2), 141\u2013182 (1997). https:\/\/doi.org\/10.1023\/A:1009783824328","journal-title":"Data Min. Knowl. Discov."},{"key":"22_CR26","doi-asserted-by":"publisher","unstructured":"Zhang, T., Ramakrishnan, R., Livny, M.: Fast density estimation using CF-kernel for very large databases. In: KDD, pp. 312\u2013316 (1999). https:\/\/doi.org\/10.1145\/312129.312266","DOI":"10.1145\/312129.312266"}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-60936-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T22:09:11Z","timestamp":1723759751000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-60936-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030609351","9783030609368"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60936-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SISAP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Similarity Search and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Copenhagen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sisap2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.sisap.org\/2020\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","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":"19","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":"38% - 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.9","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":"3","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)"}},{"value":"2 short papers accepted for the SISAP 2020 Doctoral Symposium are also included. The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}