{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T04:15:06Z","timestamp":1746591306908,"version":"3.40.5"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030461492"},{"type":"electronic","value":"9783030461508"}],"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-46150-8_16","type":"book-chapter","created":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T01:02:40Z","timestamp":1588294960000},"page":"257-273","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["k Is the Magic Number\u2014Inferring the Number of Clusters Through Nonparametric Concentration Inequalities"],"prefix":"10.1007","author":[{"given":"Sibylle","family":"Hess","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wouter","family":"Duivesteijn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,30]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Alamgir, M., von Luxburg, U.: Multi-agent random walks for local clustering on graphs. In: Proceedings ICDM, pp. 18\u201327 (2010)","DOI":"10.1109\/ICDM.2010.87"},{"issue":"3","key":"16_CR2","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1109\/TCIAIG.2014.2376982","volume":"7","author":"C Bauckhage","year":"2015","unstructured":"Bauckhage, C., Drachen, A., Sifa, R.: Clustering game behavior data. IEEE Trans. Comput. Intell. AI Games 7(3), 266\u2013278 (2015)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"key":"16_CR3","volume-title":"Pattern Recognition and Machine Learning","author":"CM Bishop","year":"2006","unstructured":"Bishop, C.M.: Pattern Recognition and Machine Learning. Springer, New York (2006)"},{"issue":"3","key":"16_CR4","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/1297332.1297334","volume":"1","author":"C B\u00f6hm","year":"2007","unstructured":"B\u00f6hm, C., Faloutsos, C., Pan, J.Y., Plant, C.: RIC: parameter-free noise-robust clustering. Trans. Knowl. Discov. Data 1(3), 10 (2007)","journal-title":"Trans. Knowl. Discov. Data"},{"key":"16_CR5","volume-title":"Spectral Graph Theory","author":"FRK Chung","year":"1997","unstructured":"Chung, F.R.K.: Spectral Graph Theory. American Mathematical Society, Providence (1997)"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Feng, Y., Hamerly, G.: PG-means: learning the number of clusters in data. In: Advances in Neural Information Processing Systems, pp. 393\u2013400 (2007)","DOI":"10.7551\/mitpress\/7503.003.0054"},{"key":"16_CR7","unstructured":"Hamerly, G., Elkan, C.: Learning the k in k-means. In: Advances in Neural Information Processing Systems, pp. 281\u2013288 (2004)"},{"key":"16_CR8","unstructured":"Hess, S., Duivesteijn, W.: k is the magic number\u2014supplementary material. arXiv (2019, to appear)"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Hess, S., Duivesteijn, W., Honysz, P., Morik, K.: The SpectACl of nonconvex clustering: a spectral approach to density-based clustering. In: Proceedings of the AAAI (2019)","DOI":"10.1609\/aaai.v33i01.33013788"},{"key":"16_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810817","volume-title":"Matrix Analysis","author":"RA Horn","year":"1985","unstructured":"Horn, R.A., Johnson, C.A.: Matrix Analysis. Cambridge University Press, Cambridge (1985)"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Hou, J., Sha, C., Chi, L., Xia, Q., Qi, N.: Merging dominant sets and DBSCAN for robust clustering and image segmentation. In: Proceedings of the ICIP, pp. 4422\u20134426 (2014)","DOI":"10.1109\/ICIP.2014.7025897"},{"key":"16_CR12","unstructured":"Kalogeratos, A., Likas, A.: Dip-means: an incremental clustering method for estimating the number of clusters. In: Advances in Neural Information Processing Systems, pp. 2393\u20132401 (2012)"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"27988","DOI":"10.1038\/srep27988","volume":"6","author":"JN Kather","year":"2016","unstructured":"Kather, J.N., et al.: Multi-class texture analysis in colorectal cancer histology. Sci. Rep. 6, 27988 (2016)","journal-title":"Sci. Rep."},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Kontkanen, P., Myllym\u00e4ki, P., Buntine, W., Rissanen, J., Tirri, H.: An MDL framework for data clustering. In: Advances in Minimum Description Length Theory and Applications. Neural Information Processing Series, pp. 323\u2013353 (2005)","DOI":"10.7551\/mitpress\/1114.003.0018"},{"issue":"1\u20132","key":"16_CR15","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Nav. Res. Logist. Q. 2(1\u20132), 83\u201397 (1955)","journal-title":"Nav. Res. Logist. Q."},{"issue":"11","key":"16_CR16","doi-asserted-by":"publisher","first-page":"2278","DOI":"10.1109\/5.726791","volume":"86","author":"Y LeCun","year":"1998","unstructured":"LeCun, Y., Bottou, L., Bengio, Y., Haffner, P.: Gradient-based learning applied to document recognition. Proc. IEEE 86(11), 2278\u20132324 (1998)","journal-title":"Proc. IEEE"},{"issue":"2","key":"16_CR17","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 square quantization in PCM. IEEE Trans. Inf. Theory 28(2), 129\u2013137 (1982)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"16_CR18","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U von Luxburg","year":"2007","unstructured":"von Luxburg, U.: A tutorial on spectral clustering. Stat. Comput. 17(4), 395\u2013416 (2007)","journal-title":"Stat. Comput."},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Maurus, S., Plant, C.: Skinny-dip: clustering in a sea of noise. In: Proceedings of the KDD, pp. 1055\u20131064 (2016)","DOI":"10.1145\/2939672.2939740"},{"key":"16_CR20","unstructured":"Ng, A.Y., Jordan, M.I., Weiss, Y.: On spectral clustering: analysis and an algorithm. In: Proceedings of the NIPS, pp. 849\u2013856 (2001)"},{"key":"16_CR21","unstructured":"Pelleg, D., Moore, A.W.: X-means: extending k-means with efficient estimation of the number of clusters. In: Proceedings of the ICML, pp. 727\u2013734 (2000)"},{"issue":"2","key":"16_CR22","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. R. Stat. Soc.: Ser. B (Stat. Methodol.) 63(2), 411\u2013423 (2001)","journal-title":"J. R. Stat. Soc.: Ser. B (Stat. Methodol.)"},{"issue":"4","key":"16_CR23","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s10208-011-9099-z","volume":"12","author":"JA Tropp","year":"2012","unstructured":"Tropp, J.A.: User-friendly tail bounds for sums of random matrices. Found. Comput. Math. 12(4), 389\u2013434 (2012)","journal-title":"Found. Comput. Math."},{"key":"16_CR24","unstructured":"Zelnik-Manor, L., Perona, P.: Self-tuning spectral clustering. In: Proceedings NIPS, pp. 1601\u20131608 (2005)"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-46150-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T09:25:45Z","timestamp":1746523545000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-46150-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030461492","9783030461508"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-46150-8_16","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":"30 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"W\u00fcrzburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"16 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ecmlpkdd2019.org\/","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":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"733","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":"130","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":"0","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":"18% - 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.04","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.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":"ECML PKDD Workshops Information: single-blind review, submissions: 200, full papers accepted: 70, short papers accepted: 46","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)"}}]}}