{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T16:24:01Z","timestamp":1778171041464,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662444146","type":"print"},{"value":"9783662444153","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44415-3_4","type":"book-chapter","created":{"date-parts":[[2014,8,13]],"date-time":"2014-08-13T00:40:31Z","timestamp":1407890431000},"page":"32-41","source":"Crossref","is-referenced-by-count":118,"title":["Balanced K-Means for Clustering"],"prefix":"10.1007","author":[{"given":"Mikko I.","family":"Malinen","sequence":"first","affiliation":[]},{"given":"Pasi","family":"Fr\u00e4nti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10994-009-5103-0","volume":"75","author":"D. Aloise","year":"2009","unstructured":"Aloise, D., Deshpande, A., Hansen, P., Popat, P.: NP-hardness of Euclidean sum-of-squares clustering. Mach. Learn.\u00a075, 245\u2013248 (2009)","journal-title":"Mach. Learn."},{"key":"4_CR2","unstructured":"Althoff, C.T., Ulges, A., Dengel, A.: Balanced clustering for content-based image browsing. In: GI-Informatiktage 2011. Gesellschaft f\u00fcr Informatik e.V. (March 2011)"},{"key":"4_CR3","first-page":"1027","volume-title":"SODA 2007: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"D. Arthur","year":"2007","unstructured":"Arthur, D., Vassilvitskii, S.: k-means++: the advantages of careful seeding. In: SODA 2007: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1027\u20131035. Society for Industrial and Applied Mathematics, Philadelphia (2007)"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Banerjee, A., Ghosh, J.: On scaling up balanced clustering algorithms. In: Proceedings of the SIAM International Conference on Data Mining, pp. 333\u2013349 (2002)","DOI":"10.1137\/1.9781611972726.20"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1109\/TNN.2004.824416","volume":"15","author":"A. Banerjee","year":"2004","unstructured":"Banerjee, A., Ghosh, J.: Frequency sensitive competitive learning for balanced clustering on high-dimensional hyperspheres. IEEE Transactions on Neural Networks\u00a015, 719 (2004)","journal-title":"IEEE Transactions on Neural Networks"},{"key":"4_CR6","unstructured":"Bradley, P.S., Bennett, K.P., Demiriz, A.: Constrained k-means clustering. Tech. rep., MSR-TR-2000-65, Microsoft Research (2000)"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Burkhard, R., Dell\u2019Amico, M., Martello, S.: Assignment Problems (Revised reprint). SIAM (2012)","DOI":"10.1137\/1.9781611972238"},{"key":"4_CR8","unstructured":"Chen, Y., Zhang, Y., Ji, X.: Size regularized cut for data clustering. In: Advances in Neural Information Processing Systems (2005)"},{"key":"4_CR9","unstructured":"Demiriz, A., Bennett, K.P., Bradley, P.S.: Using assignment constraints to avoid empty clusters in k-means clustering. In: Basu, S., Davidson, I., Wagstaff, K. (eds.) Constrained Clustering: Advances in Algorithms, Theory, and Applications. Chapman & Hall\/CRC Data Mining and Knowledge Discovery Series (2008)"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"1568","DOI":"10.1109\/29.35395","volume":"37","author":"W.H. Equitz","year":"1989","unstructured":"Equitz, W.H.: A New Vector Quantization Clustering Algorithm. IEEE Trans. Acoust., Speech, Signal Processing\u00a037, 1568\u20131575 (1989)","journal-title":"IEEE Trans. Acoust., Speech, Signal Processing"},{"issue":"4","key":"4_CR11","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1007\/s100440070007","volume":"3","author":"P. Fr\u00e4nti","year":"2000","unstructured":"Fr\u00e4nti, P., Kivij\u00e4rvi, J.: Randomized local search algorithm for the clustering problem. Pattern Anal. Appl.\u00a03(4), 358\u2013369 (2000)","journal-title":"Pattern Anal. Appl."},{"issue":"5","key":"4_CR12","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1016\/j.patcog.2005.09.012","volume":"39","author":"P. Fr\u00e4nti","year":"2006","unstructured":"Fr\u00e4nti, P., Virmajoki, O.: Iterative shrinking method for clustering problems. Pattern Recognition\u00a039(5), 761\u2013765 (2006)","journal-title":"Pattern Recognition"},{"issue":"11","key":"4_CR13","doi-asserted-by":"publisher","first-page":"1875","DOI":"10.1109\/TPAMI.2006.227","volume":"28","author":"P. Fr\u00e4nti","year":"2006","unstructured":"Fr\u00e4nti, P., Virmajoki, O., Hautam\u00e4ki, V.: Fast agglomerative clustering using a k-nearest neighbor graph. IEEE Trans. on Pattern Analysis and Machine Intelligence\u00a028(11), 1875\u20131881 (2006)","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"issue":"9","key":"4_CR14","doi-asserted-by":"crossref","first-page":"1074","DOI":"10.1109\/43.159993","volume":"11","author":"L. Hagen","year":"1992","unstructured":"Hagen, L., Kahng, A.B.: New spectral methods for ratio cut partitioning and clustering. IEEE Transactions on Computer-Aided Design\u00a011(9), 1074\u20131085 (1992)","journal-title":"IEEE Transactions on Computer-Aided Design"},{"issue":"4","key":"4_CR15","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"Karmarkar, N.: A new polynomial time algorithm for linear programming. Combinatorica\u00a04(4), 373\u2013395 (1984)","journal-title":"Combinatorica"},{"issue":"2","key":"4_CR16","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.patrec.2010.08.008","volume":"32","author":"Y. Kawahara","year":"2011","unstructured":"Kawahara, Y., Nagano, K., Okamoto, Y.: Submodular fractional programming for balanced clustering. Pattern Recognition Letters\u00a032(2), 235\u2013243 (2011)","journal-title":"Pattern Recognition Letters"},{"issue":"5","key":"4_CR17","doi-asserted-by":"publisher","first-page":"1498","DOI":"10.1109\/JSEN.2012.2227704","volume":"13","author":"Y. Liao","year":"2013","unstructured":"Liao, Y., Qi, H., Li, W.: Load-Balanced Clustering Algorithm With Distributed Self-Organization for Wireless Sensor Networks. IEEE Sensors Journal\u00a013(5), 1498\u20131506 (2013)","journal-title":"IEEE Sensors Journal"},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/S0031-3203(02)00060-2","volume":"36","author":"A. Likas","year":"2003","unstructured":"Likas, A., Vlassis, N., Verbeek, J.: The global k-means clustering algorithm. Pattern Recognition\u00a036, 451\u2013461 (2003)","journal-title":"Pattern Recognition"},{"key":"4_CR19","unstructured":"MacQueen, J.: Some methods of classification and analysis of multivariate observations. In: Proc. 5th Berkeley Symp. Mathemat. Statist. Probability, vol.\u00a01, pp. 281\u2013296 (1967)"},{"issue":"2","key":"4_CR20","first-page":"171","volume":"9","author":"R. Nallusamy","year":"2010","unstructured":"Nallusamy, R., Duraiswamy, K., Dhanalaksmi, R., Parthiban, P.: Optimization of non-linear multiple traveling salesman problem using k-means clustering, shrink wrap algorithm and meta-heuristics. International Journal of Nonlinear Science\u00a09(2), 171\u2013177 (2010)","journal-title":"International Journal of Nonlinear Science"},{"key":"4_CR21","first-page":"727","volume-title":"Proceedings of the Seventeenth International Conference on Machine Learning","author":"D. Pelleg","year":"2000","unstructured":"Pelleg, D., Moore, A.: X-means: Extending k-means with efficient estimation of the number of clusters. In: Proceedings of the Seventeenth International Conference on Machine Learning, pp. 727\u2013734. Morgan Kaufmann, San Francisco (2000)"},{"issue":"2","key":"4_CR22","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/BF03025891","volume":"9","author":"G. Strang","year":"1987","unstructured":"Strang, G.: Karmarkars algorithm and its place in applied mathematics. The Mathematical Intelligencer\u00a09(2), 4\u201310 (1987)","journal-title":"The Mathematical Intelligencer"},{"key":"4_CR23","unstructured":"Yao, L., Cui, X., Wang, M.: An energy-balanced clustering routing algorithm for wireless sensor networks. In: 2009 WRI World Congress on Computer Science and Information Engineering, vol.\u00a03. IEEE (2006)"},{"issue":"8","key":"4_CR24","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1016\/j.knosys.2010.06.003","volume":"23","author":"S. Zhu","year":"2010","unstructured":"Zhu, S., Wang, D., Li, T.: Data clustering with size constraints. Knowledge-Based Systems\u00a023(8), 883\u2013889 (2010)","journal-title":"Knowledge-Based Systems"}],"container-title":["Lecture Notes in Computer Science","Structural, Syntactic, and Statistical Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44415-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T11:23:36Z","timestamp":1558956216000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44415-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662444146","9783662444153"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44415-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}