{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:19:55Z","timestamp":1742937595047,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319591049"},{"type":"electronic","value":"9783319591056"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-59105-6_17","type":"book-chapter","created":{"date-parts":[[2017,5,16]],"date-time":"2017-05-16T07:45:06Z","timestamp":1494920706000},"page":"193-204","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Split-and-merge Tweak in Cross Entropy Clustering"],"prefix":"10.1007","author":[{"given":"Krzysztof","family":"Hajto","sequence":"first","affiliation":[]},{"given":"Konrad","family":"Kamieniecki","sequence":"additional","affiliation":[]},{"given":"Krzysztof","family":"Misztal","sequence":"additional","affiliation":[]},{"given":"Przemys\u0142aw","family":"Spurek","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,17]]},"reference":[{"key":"17_CR1","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\u20131035. Society for Industrial and Applied Mathematics (2007)"},{"issue":"5","key":"17_CR2","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1016\/0031-3203(94)00125-6","volume":"28","author":"G Celeux","year":"1995","unstructured":"Celeux, G., Govaert, G.: Gaussian parsimonious clustering models. Pattern Recognit. 28(5), 781\u2013793 (1995)","journal-title":"Pattern Recognit."},{"issue":"2","key":"17_CR3","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s003579900058","volume":"16","author":"C Fraley","year":"1999","unstructured":"Fraley, C., Raftery, A.E.: MCLUST: software for model-based cluster analysis. J. Classif. 16(2), 297\u2013306 (1999)","journal-title":"J. Classif."},{"issue":"1","key":"17_CR4","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1109\/72.554192","volume":"8","author":"GE Hinton","year":"1997","unstructured":"Hinton, G.E., Dayan, P., Revow, M.: Modeling the manifolds of images of handwritten digits. IEEE Trans. Neural Networks 8(1), 65\u201374 (1997)","journal-title":"IEEE Trans. Neural Networks"},{"issue":"8","key":"17_CR5","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":"3","key":"17_CR6","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"AK Jain","year":"1999","unstructured":"Jain, A.K., Murty, M.N., Flynn, P.J.: Data clustering: a review. ACM Comput. Surv. (CSUR) 31(3), 264\u2013323 (1999)","journal-title":"ACM Comput. Surv. (CSUR)"},{"issue":"3","key":"17_CR7","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s12530-012-9046-5","volume":"3","author":"E Lughofer","year":"2012","unstructured":"Lughofer, E.: A dynamic split-and-merge approach for evolving cluster models. Evolving Syst. 3(3), 135\u2013151 (2012)","journal-title":"Evolving Syst."},{"issue":"9","key":"17_CR8","doi-asserted-by":"publisher","first-page":"1455","DOI":"10.1016\/S0031-3203(99)00137-5","volume":"33","author":"U Maulik","year":"2000","unstructured":"Maulik, U., Bandyopadhyay, S.: Genetic algorithm-based clustering technique. Pattern Recogn. 33(9), 1455\u20131465 (2000)","journal-title":"Pattern Recogn."},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"McLachlan, G., Krishnan, T.: The EM Algorithm and Extensions, vol. 382. Wiley (2007)","DOI":"10.1002\/9780470191613"},{"key":"17_CR10","first-page":"31","volume":"24","author":"K Misztal","year":"2015","unstructured":"Misztal, K., Spurek, P., Saeed, E., Saeed, K., Tabor, J.: Cross entropy clustering approach to iris segmentation for biometrics purpose. Schedae Informaticae 24, 31\u201340 (2015)","journal-title":"Schedae Informaticae"},{"issue":"5","key":"17_CR11","doi-asserted-by":"publisher","first-page":"1127","DOI":"10.1016\/S0031-3203(01)00080-2","volume":"35","author":"S Shoham","year":"2002","unstructured":"Shoham, S.: Robust clustering by deterministic agglomeration EM of mixtures of multivariate t-distributions. Pattern Recogn. 35(5), 1127\u20131142 (2002)","journal-title":"Pattern Recogn."},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1007\/978-3-642-38628-2_78","volume-title":"Pattern Recognition and Image Analysis","author":"J Tabor","year":"2013","unstructured":"Tabor, J., Misztal, K.: Detection of elliptical shapes via cross-entropy clustering. In: Sanches, J.M., Mic\u00f3, L., Cardoso, J.S. (eds.) IbPRIA 2013. LNCS, vol. 7887, pp. 656\u2013663. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-38628-2_78"},{"issue":"9","key":"17_CR13","doi-asserted-by":"publisher","first-page":"3046","DOI":"10.1016\/j.patcog.2014.03.006","volume":"47","author":"J Tabor","year":"2014","unstructured":"Tabor, J., Spurek, P.: Cross-entropy clustering. Pattern Recogn. 47(9), 3046\u20133059 (2014)","journal-title":"Pattern Recogn."},{"issue":"9","key":"17_CR14","doi-asserted-by":"publisher","first-page":"2109","DOI":"10.1162\/089976600300015088","volume":"12","author":"N Ueda","year":"2000","unstructured":"Ueda, N., Nakano, R., Ghahramani, Z., Hinton, G.E.: SMEM algorithm for mixture models. Neural Comput. 12(9), 2109\u20132128 (2000)","journal-title":"Neural Comput."},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Xu, R., Wunsch, D.: Clustering. Wiley-IEEE Press (2009)","DOI":"10.1002\/9780470382776"},{"issue":"1","key":"17_CR16","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0031-3203(03)00140-7","volume":"37","author":"B Zhang","year":"2004","unstructured":"Zhang, B., Zhang, C., Yi, X.: Competitive EM algorithm for finite mixture models. Pattern Recogn. 37(1), 131\u2013144 (2004)","journal-title":"Pattern Recogn."},{"issue":"9","key":"17_CR17","doi-asserted-by":"publisher","first-page":"1973","DOI":"10.1016\/S0031-3203(03)00059-1","volume":"36","author":"Z Zhang","year":"2003","unstructured":"Zhang, Z., Chen, C., Sun, J., Chan, K.L.: Em algorithms for gaussian mixtures with split-and-merge operation. Pattern Recogn. 36(9), 1973\u20131983 (2003)","journal-title":"Pattern Recogn."}],"container-title":["Lecture Notes in Computer Science","Computer Information Systems and Industrial Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59105-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,16]],"date-time":"2021-05-16T00:04:01Z","timestamp":1621123441000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-59105-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319591049","9783319591056"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59105-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"17 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CISIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP International Conference on Computer Information Systems and Industrial Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bialystok","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 June 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cisim2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wi.pb.edu.pl\/cisim2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}