{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:25:13Z","timestamp":1758273913484,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030332457"},{"type":"electronic","value":"9783030332464"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-33246-4_9","type":"book-chapter","created":{"date-parts":[[2019,10,30]],"date-time":"2019-10-30T13:47:02Z","timestamp":1572443222000},"page":"146-163","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Initializing k-Means Efficiently: Benefits for Exploratory Cluster Analysis"],"prefix":"10.1007","author":[{"given":"Manuel","family":"Fritz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Holger","family":"Schwarz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,11]]},"reference":[{"key":"9_CR1","unstructured":"Alsabti, K., Ranka, S., Singh, V.: An efficient k-means clustering algorithm. In: Proceedings of IPPS\/SPDP Workshop on High Performance Data Mining (1998)"},{"key":"9_CR2","unstructured":"Arthur, D., Vassilvitskii, S.: k-means++: the advantages of careful seeding. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1027\u20131025 (2007)"},{"issue":"7","key":"9_CR3","doi-asserted-by":"publisher","first-page":"622","DOI":"10.14778\/2180912.2180915","volume":"5","author":"B Bahmani","year":"2012","unstructured":"Bahmani, B., Moseley, B., Vattani, A., Kumar, R., Vassilvitskii, S.: Scalable K-Means++. Proc. VLDB Endowment 5(7), 622\u2013633 (2012)","journal-title":"Proc. VLDB Endowment"},{"key":"9_CR4","unstructured":"Chapman, P., Clinton, J., Kerber, R., Khabaza, T., Reinartz, T., Shearer, C., Wirth, R.: CRISP-DM 1.0. CRISP-DM Consortium p. 76 (2000)"},{"key":"9_CR5","unstructured":"Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. In: Proceedings of 6th Symposium on Operating Systems Design and Implementation, vol. 51, no. 1, pp. 137\u2013149 (2004). \nhttps:\/\/dl.acm.org\/citation.cfm?id=132749"},{"key":"9_CR6","unstructured":"Elkan, C.: Using the triangle inequality to accelerate k-Means. In: Proceedings of the Twentieth International Conference on Machine Learning, pp. 147\u2013153 (2003)"},{"issue":"11","key":"9_CR7","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/240455.240464","volume":"39","author":"U Fayyad","year":"1996","unstructured":"Fayyad, U., Piatetsky-Shapiro, G., Smyth, P.: The KDD process for extracting useful knowledge from volumes of data. Commun. ACM 39(11), 27\u201334 (1996)","journal-title":"Commun. ACM"},{"key":"9_CR8","first-page":"2944","volume":"28","author":"M Feurer","year":"2015","unstructured":"Feurer, M., Klein, A., Eggensperger, K., Springenberg, J., Blum, M., Hutter, F.: Efficient and robust automated machine learning. Adv. Neural Inf. Process. Syst. 28, 2944\u20132952 (2015)","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"2\u20133","key":"9_CR9","first-page":"129","volume":"34","author":"M Fritz","year":"2019","unstructured":"Fritz, M., Behringer, M., Schwarz, H.: Quality-driven early stopping for explorative cluster analysis for big data. SICS Softw.-Intensive Cyber-Phys. Syst. 34(2\u20133), 129\u2013140 (2019)","journal-title":"SICS Softw.-Intensive Cyber-Phys. Syst."},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Fritz, M., Muazzen, O., Behringer, M., Schwarz, H.: ASAP-DM: a framework for automatic selection of analytic platforms for data mining. In: SICS Software-Intensive Cyber-Physical Systems, pp. 1\u201313 (2019)","DOI":"10.1007\/s00450-019-00408-7"},{"issue":"2\u20133","key":"9_CR11","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1023\/A:1012801612483","volume":"17","author":"M Halkidi","year":"2001","unstructured":"Halkidi, M., Batistakis, Y., Vazirgiannis, M.: On clustering validation techniques. J. Intel. Inf. Syst. 17(2\u20133), 107\u2013145 (2001)","journal-title":"J. Intel. Inf. Syst."},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-319-09259-1_2","volume-title":"Partitional Clustering Algorithms","author":"G Hamerly","year":"2015","unstructured":"Hamerly, G., Drake, J.: Accelerating Lloyd\u2019s Algorithm for k-Means Clustering. In: Celebi, M.E. (ed.) Partitional Clustering Algorithms, pp. 41\u201378. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-09259-1_2"},{"issue":"2","key":"9_CR13","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/moor.10.2.180","volume":"10","author":"DS Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A best possible heuristic for the k-Center problem. Math. Oper. Res. 10(2), 180\u2013184 (1985)","journal-title":"Math. Oper. Res."},{"issue":"7","key":"9_CR14","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1109\/TPAMI.2002.1017616","volume":"24","author":"T Kanungo","year":"2002","unstructured":"Kanungo, T., Mount, D., Netanyahu, N., Piatko, C., Silverman, R., Wu, A.: An efficient k-means clustering algorithm: analysis and implementation. IEEE Trans. Pattern Anal. Mach. Intel. 24(7), 881\u2013892 (2002)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intel."},{"key":"9_CR15","unstructured":"Karypis, M.S.G., Kumar, V., Steinbach, M.: A comparison of document clustering techniques. In: Text Mining Workshop at KDD (2000)"},{"key":"9_CR16","first-page":"1","volume":"17","author":"L Kotthoff","year":"2016","unstructured":"Kotthoff, L., Thornton, C., Hoos, H.H., Hutter, F., Leyton-Brown, K.: Auto-WEKA 2.0: automatic model selection and hyperparameter optimization in WEKA. J. Mach. Learn. Res. 17, 1\u20135 (2016)","journal-title":"J. Mach. Learn. Res."},{"key":"9_CR17","unstructured":"Laney, D.: 3D data management: controlling data volume, velocity, and variety. In: META Group Research Note 6 (February 2001), 1\u20134 (2001)"},{"issue":"2","key":"9_CR18","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"SP Lloyd","year":"1982","unstructured":"Lloyd, S.P.: Least squares quantization in PCM. IEEE Trans. Inf. Theor. 28(2), 129\u2013137 (1982)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"9_CR19","first-page":"1","volume":"17","author":"X Meng","year":"2016","unstructured":"Meng, X., et al.: MLlib: machine learning in apache spark. J. Mach. Learn. Res. 17, 1\u20137 (2016)","journal-title":"J. Mach. Learn. Res."},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Mexicano, A., et al.: The early stop heuristic: a new convergence criterion for K-means. In: AIP Conference Proceedings. vol. 1738 (2016)","DOI":"10.1063\/1.4952103"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Pelleg, D., Moore, A.: Accelerating exact k-means algorithms with geometric reasoning. In: Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 277\u2013281. ACM Press (1999)","DOI":"10.1145\/312129.312248"},{"issue":"10","key":"9_CR22","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1016\/S0167-8655(99)00069-0","volume":"20","author":"JM Pena","year":"1999","unstructured":"Pena, J.M., Lozano, J.A., Larranaga, P.: An empirical comparison of four initialization methods for the k-means algorithm. Pattern Recogn. Lett. 20(10), 1027\u20131040 (1999)","journal-title":"Pattern Recogn. Lett."},{"issue":"463","key":"9_CR23","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1198\/016214503000000666","volume":"98","author":"CA Sugar","year":"2003","unstructured":"Sugar, C.A., James, G.M.: Finding the number of clusters in a dataset: an information-theoretic approach. J. Am. Stat. Assoc. 98(463), 750\u2013763 (2003)","journal-title":"J. Am. Stat. Assoc."},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Thornton, C., Hutter, F., Hoos, H.H., Leyton-Brown, K.: Auto-WEKA. In: Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2013)","DOI":"10.1145\/2487575.2487629"},{"issue":"2","key":"9_CR25","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1111\/1467-9868.00293","volume":"63","author":"R Tibshirani","year":"2001","unstructured":"Tibshirani, R., Walther, G., Hastie, T.: Estimating the number of clusters in a data set via the gap statistic. J. Royal Stat. Soc. Ser. B: Stat. Methodol. 63(2), 411\u2013423 (2001)","journal-title":"J. Royal Stat. Soc. Ser. B: Stat. Methodol."},{"issue":"1","key":"9_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10115-007-0114-2","volume":"14","author":"X Wu","year":"2008","unstructured":"Wu, X., et al.: Top 10 algorithms in data mining. Knowl. Inf. Syst. 14(1), 1\u201337 (2008)","journal-title":"Knowl. Inf. Syst."},{"key":"9_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1007\/978-3-642-10665-1_71","volume-title":"Cloud Computing","author":"W Zhao","year":"2009","unstructured":"Zhao, W., Ma, H., He, Q.: Parallel K-means clustering based on MapReduce. In: Jaatun, M.G., Zhao, G., Rong, C. (eds.) CloudCom 2009. LNCS, vol. 5931, pp. 674\u2013679. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-10665-1_71"}],"container-title":["Lecture Notes in Computer Science","On the Move to Meaningful Internet Systems: OTM 2019 Conferences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-33246-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,20]],"date-time":"2020-01-20T11:04:27Z","timestamp":1579518267000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-33246-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030332457","9783030332464"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-33246-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"11 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OTM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"OTM Confederated International Conferences \"On the Move to Meaningful Internet Systems\"","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rhodes","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"otm2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.otmconferences.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}