{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:29:05Z","timestamp":1743028145177,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030590642"},{"type":"electronic","value":"9783030590659"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/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":"http:\/\/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-59065-9_28","type":"book-chapter","created":{"date-parts":[[2020,9,10]],"date-time":"2020-09-10T07:22:15Z","timestamp":1599722535000},"page":"364-379","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Learning from Past Observations: Meta-Learning for Efficient Clustering Analyses"],"prefix":"10.1007","author":[{"given":"Manuel","family":"Fritz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dennis","family":"Tschechlov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Holger","family":"Schwarz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,11]]},"reference":[{"issue":"6","key":"28_CR1","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1109\/TAC.1974.1100705","volume":"19","author":"H Akaike","year":"1974","unstructured":"Akaike, H.: A new look at the statistical model identification. IEEE Trans. Autom. Control 19(6), 716\u2013723 (1974)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"7","key":"28_CR2","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 Endow. 5(7), 622\u2013633 (2012)","journal-title":"Proc. VLDB Endow."},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Brazdil, P., Carrier, C.G., Soares, C., Vilalta, R.: Metalearning: Applications to Data Mining. Springer Science & Business Media, Berlin (2008)","DOI":"10.1007\/978-3-540-73263-1"},{"issue":"1","key":"28_CR4","first-page":"1","volume":"3","author":"T Cali\u00f1ski","year":"1974","unstructured":"Cali\u00f1ski, T., Harabasz, J.: A dendrite method for cluster analysis. Commun. Stat. 3(1), 1\u201327 (1974)","journal-title":"Commun. Stat."},{"issue":"3","key":"28_CR5","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0167-8655(85)90053-4","volume":"3","author":"JM Coggins","year":"1985","unstructured":"Coggins, J.M., Jain, A.K.: A spatial filtering approach to texture analysis. Pattern Recogn. Lett. 3(3), 195\u2013203 (1985)","journal-title":"Pattern Recogn. Lett."},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Davies, D.L., Bouldin, D.W.: A cluster separation measure. IEEE Trans. Pattern Anal. Mach. Intell. PAMI-1(2), 224\u2013227 (1979)","DOI":"10.1109\/TPAMI.1979.4766909"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"De Souto, M.C.P., Prud\u00eancio, R.B.C., Soares, R.G.F., De Araujo, D.S.A., Costa, I.G., Ludermir, T.B., Schliep, A.: Ranking and selecting clustering algorithms using a meta-learning approach. In: Proceedings of the International Joint Conference on Neural Networks, pp. 3729\u20133735 (2008)","DOI":"10.1109\/IJCNN.2008.4634333"},{"issue":"1","key":"28_CR8","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1080\/01969727408546059","volume":"4","author":"JC Dunn","year":"1974","unstructured":"Dunn, J.C.: Well-separated clusters and optimal fuzzy partitions. J. Cybern. 4(1), 95\u2013104 (1974)","journal-title":"J. Cybern."},{"key":"28_CR9","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)"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-642-35380-2_18","volume-title":"Swarm, Evolutionary, and Memetic Computing","author":"DG Ferrari","year":"2012","unstructured":"Ferrari, D.G., de Castro, L.N.: Clustering Algorithm Recommendation: A Meta-learning Approach. In: Panigrahi, B.K., Das, S., Suganthan, P.N., Nanda, P.K. (eds.) SEMCCO 2012. LNCS, vol. 7677, pp. 143\u2013150. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-35380-2_18"},{"key":"28_CR11","unstructured":"Feurer, M., Klein, A., Eggensperger, K., Springenberg, J., Blum, M., Hutter, F.: Efficient and robust automated machine learning. In: Advances in Neural Information Processing Systems (2015)"},{"key":"28_CR12","unstructured":"Fritz, M., Albrecht, S., Ziekow, H., Str\u00fcker, J.: Benchmarking big data technologies for energy procurement efficiency. In: Proceedings of the 23rd America\u2019s Conference on Information Systems (AMCIS 2017) (2017)"},{"key":"28_CR13","doi-asserted-by":"publisher","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, 1\u201312 (2019). \nhttps:\/\/doi.org\/10.1007\/s00450-019-00401-0","DOI":"10.1007\/s00450-019-00401-0"},{"key":"28_CR14","unstructured":"Fritz, M., Muazzen, O., Behringer, M., Schwarz, H.: ASAP-DM: A framework for automatic selection of analytic platforms for data mining. Softw.-Intensive Cyber-Phys. Syst. 35, 1\u201313 (2019)"},{"key":"28_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-030-33246-4_9","volume-title":"On the Move to Meaningful Internet Systems: OTM 2019 Conferences","author":"M Fritz","year":"2019","unstructured":"Fritz, M., Schwarz, H.: Initializing k-Means Efficiently: Benefits for Exploratory Cluster Analysis. In: Panetto, H., Debruyne, C., Hepp, M., Lewis, D., Ardagna, C.A., Meersman, R. (eds.) OTM 2019. LNCS, vol. 11877, pp. 146\u2013163. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-33246-4_9"},{"issue":"3","key":"28_CR16","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1023\/B:MACH.0000015878.60765.42","volume":"54","author":"C Giraud-Carrier","year":"2004","unstructured":"Giraud-Carrier, C., Vilalta, R., Brazdil, P.: Introduction to the special issue on meta-learning. Mach. Learn. 54(3), 187\u2013193 (2004)","journal-title":"Mach. Learn."},{"key":"28_CR17","first-page":"1","volume":"17","author":"G Hamerly","year":"2004","unstructured":"Hamerly, G., Elkan, C.: Learning the k in kmeans. Adv. Neural Inf. Process. Syst. (NIPS) 17, 1\u20138 (2004)","journal-title":"Adv. Neural Inf. Process. Syst. (NIPS)"},{"issue":"8","key":"28_CR18","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/j.patrec.2009.09.011","volume":"31","author":"AK Jain","year":"2010","unstructured":"Jain, A.K.: Data clustering: 50 years beyond K-means. Pattern Recogn. Lett. 31(8), 651\u2013666 (2010)","journal-title":"Pattern Recogn. Lett."},{"issue":"7","key":"28_CR19","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. Intell. 24(7), 881\u2013892 (2002)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"28_CR20","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. Theory 28(2), 129\u2013137 (1982)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"28_CR21","unstructured":"Macqueen, J.B.: Some methods for classification and analysis of multivariate observations. Proc. Fifth Berkeley Symp. Math. Stat. Prob. 1, 281\u2013297 (1967)"},{"key":"28_CR22","doi-asserted-by":"crossref","unstructured":"Mexicano, A., Rodr\u00edguez, R., Cervantes, S., Montes, P., Jim\u00e9nez, M., Almanza, N., Abrego, A.: The early stop heuristic: A new convergence criterion for K-means. In: AIP Conference Proceedings, vol. 1738 (2016)","DOI":"10.1063\/1.4952103"},{"key":"28_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-642-04277-5_3","volume-title":"Artificial Neural Networks \u2013 ICANN 2009","author":"ACA Nascimento","year":"2009","unstructured":"Nascimento, A.C.A., Prud\u00eancio, R.B.C., de Souto, M.C.P., Costa, I.G.: Mining rules for the automatic selection process of clustering methods applied to cancer gene expression data. In: Alippi, C., Polycarpou, M., Panayiotou, C., Ellinas, G. (eds.) ICANN 2009. LNCS, vol. 5769, pp. 20\u201329. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-04277-5_3"},{"key":"28_CR24","unstructured":"Pelleg, D., Moore, A.: X-means: Extending K-means with efficient estimation of the number of clusters. In: Proceedings of the 17th International Conference on Machine Learning, pp. 727\u2013734 (2000)"},{"key":"28_CR25","doi-asserted-by":"crossref","unstructured":"Rousseeuw, P.J.: Silhouettes: A graphical aid to the interpretation and validation of cluster analysis. J. Comput. Appl. Math. 20(C), 53\u201365 (1987)","DOI":"10.1016\/0377-0427(87)90125-7"},{"key":"28_CR26","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1214\/aos\/1176344136","volume":"6","author":"G Schwarz","year":"1978","unstructured":"Schwarz, G.: Estimating the dimension of a model. Ann. Stat. 6, 461\u2013464 (1978)","journal-title":"Ann. Stat."},{"key":"28_CR27","first-page":"2951","volume":"4","author":"J Snoek","year":"2012","unstructured":"Snoek, J., Larochelle, H., Adams, R.P.: Practical Bayesian optimization of machine learning algorithms. Adv. Neural Inf. Process. Syst. 4, 2951\u20132959 (2012)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"28_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-642-04274-4_14","volume-title":"Artificial Neural Networks \u2013 ICANN 2009","author":"RGF Soares","year":"2009","unstructured":"Soares, R.G.F., Ludermir, T.B., De Carvalho, F.A.T.: An analysis of meta-learning techniques for ranking clustering algorithms applied to artificial data. In: Alippi, C., Polycarpou, M., Panayiotou, C., Ellinas, G. (eds.) ICANN 2009. LNCS, vol. 5768, pp. 131\u2013140. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-04274-4_14"},{"issue":"463","key":"28_CR29","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":"28_CR30","unstructured":"Tibshirani, R., Walther, G., Hastie, T.: Estimating the number of clusters in a data set via the gap statistic. J. R. Stat. Soc. Ser. B Stat. Methodol. 63(2), 411\u2013423 (2001)"},{"key":"28_CR31","unstructured":"Tukey, J.W.: Exploratory Data Analysis. Pearson Addison Wesley, Reading (1977)"},{"issue":"2","key":"28_CR32","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1023\/A:1019956318069","volume":"18","author":"R Vilalta","year":"2002","unstructured":"Vilalta, R., Drissi, Y.: A perspective view and survey of meta-learning. Artif. Intell. Rev. 18(2), 77\u201395 (2002)","journal-title":"Artif. Intell. Rev."},{"issue":"1","key":"28_CR33","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."}],"container-title":["Lecture Notes in Computer Science","Big Data Analytics and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59065-9_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,10]],"date-time":"2020-09-10T07:31:40Z","timestamp":1599723100000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-59065-9_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030590642","9783030590659"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59065-9_28","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":"11 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DaWaK","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Big Data Analytics and Knowledge Discovery","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bratislava","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","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":"14 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dawak2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.dexa.org\/dawak2020","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"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":"77","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":"15","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":"14","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":"19% - 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-5","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":"2-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)"}}]}}