{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T16:26:30Z","timestamp":1743783990012},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642397868"},{"type":"electronic","value":"9783642397875"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39787-5_16","type":"book-chapter","created":{"date-parts":[[2013,7,2]],"date-time":"2013-07-02T08:22:14Z","timestamp":1372753334000},"page":"195-205","source":"Crossref","is-referenced-by-count":3,"title":["Size-Constrained Clustering Using an Initial Points Selection Method"],"prefix":"10.1007","author":[{"given":"Kai","family":"Lei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sibo","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weiwei","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qilin","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"Dubes, R.C., Jain, A.K.: Algorithms for Clustering Data. Prentice Hall (1988)"},{"key":"16_CR2","unstructured":"Bradley, P.S., Bennett, K.P., Demiriz, A.: Constrained K-Means Clustering. MSR-RT-2000-65, Microsoft Research (2000)"},{"key":"16_CR3","volume-title":"Linear Network Optimization","author":"D.P. Bertsekas","year":"1991","unstructured":"Bertsekas, D.P.: Linear Network Optimization. MIT Press, Cambridge (1991)"},{"key":"16_CR4","unstructured":"Kelly, D.J., O\u2019Neill, G.M.: The Minimum Cost Flow Problem and The Network Simplex Solution Method (September 1991)"},{"key":"16_CR5","unstructured":"Zhao, J.: Optimal Clustering: Genetic Constrained K-Means and Linear Programming Algorithms (2006)"},{"issue":"8","key":"16_CR6","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"},{"key":"16_CR7","volume-title":"Pattern Classification and Scene Analysis","author":"R.O. Duda","year":"1973","unstructured":"Duda, R.O., Hart, P.E.: Pattern Classification and Scene Analysis. John Wiley and Sons, NY (1973)"},{"key":"16_CR8","volume-title":"Algorithms for Clustering Data","author":"A.K. Jain","year":"1988","unstructured":"Jain, A.K., Dubes, R.C.: Algorithms for Clustering Data. Prentice Hall, Englewood Cliffs (1988)"},{"key":"16_CR9","unstructured":"Bradley, P.S., Fayyad, U.M.: Refing initial points for K-Means clustering. In: 15th Internat. Conf. on Machine Learning (1998)"},{"key":"16_CR10","first-page":"247","volume":"2","author":"S. Deelers","year":"2007","unstructured":"Deelers, S., Auwatanamongkol, S.: Enhancing K-Means algorithm with initial cluster centers derived from data partitioning along the data axis with the highest variance. Internat. J. Comput. Sci.\u00a02, 247\u2013252 (2007)","journal-title":"Internat. J. Comput. Sci."},{"issue":"11","key":"16_CR11","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1016\/j.patrec.2004.04.007","volume":"25","author":"S.S. Khan","year":"2004","unstructured":"Khan, S.S., Ahmad, A.: Cluster center initialization algorithm for K-Means clustering. Pattern Recognition Letters\u00a025(11), 1293\u20131302 (2004)","journal-title":"Pattern Recognition Letters"},{"issue":"1","key":"16_CR12","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s00357-007-0003-0","volume":"24","author":"D. Steinley","year":"2007","unstructured":"Steinley, D., Brusco, J.M.: Initialization K-Means Batch Clustering: A Critical Evaluation of Several Techniques. Journal of Classification\u00a024(1), 99\u2013121 (2007)","journal-title":"Journal of Classification"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1016\/S0167-8655(99)00057-4","volume":"20","author":"J.A. Lozano","year":"1999","unstructured":"Lozano, J.A., Pena, J.M., Larranaga, P.: An empirical comparison of four initialization methods for the K-Means algorithm. Pattern Recognition Lett.\u00a020, 1027\u20131040 (1999)","journal-title":"Pattern Recognition Lett."}],"container-title":["Lecture Notes in Computer Science","Knowledge Science, Engineering and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39787-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T10:08:42Z","timestamp":1557914922000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39787-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642397868","9783642397875"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39787-5_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}