{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,15]],"date-time":"2024-03-15T15:13:43Z","timestamp":1710515623184},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,6,10]],"date-time":"2017-06-10T00:00:00Z","timestamp":1497052800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Classif"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s00357-017-9231-0","type":"journal-article","created":{"date-parts":[[2017,6,10]],"date-time":"2017-06-10T06:52:38Z","timestamp":1497077558000},"page":"165-190","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On Strategies to Fix Degenerate k-means Solutions"],"prefix":"10.1007","volume":"34","author":[{"given":"Daniel","family":"Aloise","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nielsen Castelo","family":"Damasceno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nenad","family":"Mladenovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel Nobre","family":"Pinheiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,10]]},"reference":[{"key":"9231_CR1","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s10994-009-5103-0","volume":"75","author":"D ALOISE","year":"2009","unstructured":"ALOISE, D., DESHPANDE, A., HANSEN, P., and POPAT, P. (2009), \u201cNP-Hardness of Euclidean Sum-of-Squares Clustering\u201d, Machine Learning, 75, 245\u2013249.","journal-title":"Machine Learning"},{"issue":"1-2","key":"9231_CR2","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s10107-010-0349-7","volume":"131","author":"D ALOISE","year":"2012","unstructured":"ALOISE, D., HANSEN, P., and LIBERTI, L. (2012), \u201cAn Improved Column Generation Algorithm for Minimum Sum-of-Squares Clustering\u201d, Mathematical Programming, 131(1-2), 195\u2013220.","journal-title":"Mathematical Programming"},{"key":"9231_CR3","unstructured":"ARTHUR, D., and VASSILVITSKII, S. (2007). \u201cK-means++: The Advantages of Careful Seeding\u201d, In 2007 ACM-SIAM Symposium on Discrete Algorithms (SODA\u201907), pp. 1027\u20131035."},{"issue":"4","key":"9231_CR4","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1007\/s11336-012-9283-3","volume":"77","author":"SJ BLANCHARD","year":"2012","unstructured":"BLANCHARD, S.J., ALOISE, D., and DESARBO, W.S. (2012), \u201cThe Heterogeneous PMedian Problem for Categorization Based Clustering\u201d, Psychometrika, 77(4), 741\u2013762.","journal-title":"Psychometrika"},{"key":"9231_CR5","first-page":"91","volume":"98","author":"PS BRADLEY","year":"1998","unstructured":"BRADLEY, P.S., and FAYYAD, U.M. (1998), \u201cRefining Initial Points for k-Means Clustering\u201d, in International Conference on Machine Learning (ICML), Vol. 98, pp. 91\u201399.","journal-title":"in International Conference on Machine Learning (ICML)"},{"issue":"1","key":"9231_CR6","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/s101070050054","volume":"85","author":"J BRIMBERG","year":"1999","unstructured":"BRIMBERG, J., and MLADENOVI\u0106, N. (1999), \u201cDegeneracy in the Multi-Source Weber Problem\u201d, Mathematical Programming, 85(1), 213\u2013220.","journal-title":"Mathematical Programming"},{"issue":"4","key":"9231_CR7","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/s11336-007-9013-4","volume":"72","author":"MJ BRUSCO","year":"2007","unstructured":"BRUSCO, M.J., and STEINLEY, D. (2007), \u201cA Comparison of Heuristic Procedures for MinimumWithin-Cluster Sums of Squares Partitioning\u201d, Psychometrika, 72(4), 583\u2013600.","journal-title":"Psychometrika"},{"key":"9231_CR8","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/s10898-014-0175-1","volume":"63","author":"E CARRIZOSA","year":"2015","unstructured":"CARRIZOSA, E., ALGUWAIZANI, A., HANSEN, P., and MLADENOVI\u0106, N. (2015), \u201cNew Heuristic for Harmonic Means Clustering\u201d, Journal of Global Optimization, 63, 427\u2013443.","journal-title":"Journal of Global Optimization"},{"key":"9231_CR9","unstructured":"CHOROMANSKA, A., and MONTELEONI, C. (2012), \u201cOnline Clustering with Experts\u201d, in International Conference on Artificial Intelligence and Statistics, pp. 227\u2013235."},{"issue":"1","key":"9231_CR10","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1137\/1006005","volume":"6","author":"L COOPER","year":"1964","unstructured":"COOPER, L. (1964), \u201cHeuristic Methods for Location-Allocation Problems\u201d, Siam Review, 6(1), 37\u201353.","journal-title":"Siam Review"},{"key":"9231_CR11","unstructured":"DING, Y., ZHAO, Y., SHEN, X., MUSUVATHI, M., and MYTKOWICZ, T. (2015), \u201cYinyang k-means: A Drop-in Replacement of the Classic k-Means with Consistent Speedup\u201d, in 32nd International Conference on Machine Learning (ICML-15), pp. 579\u2013587."},{"key":"9231_CR12","unstructured":"EILON, S., WATSON-GANDY, C., and CHRISTOFIDES, N. (1971), Distributed Management, New York: Hafner."},{"key":"9231_CR13","unstructured":"FORGY, E. (1965), \u201cCluster Analysis of Multivariate Data: Efficiency vs. Interpretability of Classifications\u201d, Biometrics, 21, 768."},{"key":"9231_CR14","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/S0031-3203(99)00216-2","volume":"34","author":"P HANSEN","year":"2001","unstructured":"HANSEN, P., and Mladenovi\u0107, N. (2001), \u201cJ-Means: A New Local Search Heuristic for Minimum Sum of Squares Clustering\u201d, Pattern Recognition, 34, 405\u2013413.","journal-title":"Pattern Recognition"},{"issue":"2","key":"9231_CR15","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s00357-005-0018-3","volume":"22","author":"P HANSEN","year":"2005","unstructured":"HANSEN, P., NGAI, E., CHEUNG, B.K., and MLADENOVIC, N. (2005), \u201cAnalysis of Global k-Means, An Incremental Heuristic for Minimum Sum-of-Squares Clustering\u201d, Journal of Classification, 22(2), 287\u2013310.","journal-title":"Journal of Classification"},{"key":"9231_CR16","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/1111237.1111238","volume":"25","author":"CA HAVERLY","year":"1978","unstructured":"HAVERLY, C.A. (1978), \u201cStudies of the Behavior of Recursion for the Pooling Problem\u201d, ACM SIGMAP Bulletin, (25), 19\u201328.","journal-title":"ACM SIGMAP Bulletin"},{"issue":"5","key":"9231_CR17","doi-asserted-by":"crossref","first-page":"1124","DOI":"10.1111\/j.1540-5915.1991.tb01910.x","volume":"22","author":"K HELSEN","year":"1991","unstructured":"HELSEN, K., and GREEN, P.E. (1991), \u201cA Computational Study of Replicated Clustering with an Application toMarket Segmentation\u201d, Decision Sciences, 22(5), 1124\u20131141.","journal-title":"Decision Sciences"},{"issue":"2","key":"9231_CR18","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1007\/s00357-015-9178-y","volume":"32","author":"J HOFMANS","year":"2015","unstructured":"HOFMANS, J., CEULEMANS, E., STEINLEY, D., and VAN MECHELEN, I. (2015), \u201cOn the Added Value of Bootstrap Analysis for k-Means Clustering\u201d, Journal of Classification, 32(2), 268\u2013284.","journal-title":"Journal of Classification"},{"key":"9231_CR19","unstructured":"INABA, M., KATOH, N., and IMAI, H. (1994), \u201cApplications ofWeighted Voronoi Diagrams and Randomization to Variance-Based k-Clustering\u201d, in Proceedings of the 10th ACM Symposium on Computational Geometry, pp. 332\u2013339."},{"key":"9231_CR20","volume-title":"The Art of Computer Systems Performance Analysis","author":"R JAIN","year":"2008","unstructured":"JAIN, R. (2008), The Art of Computer Systems Performance Analysis, New York: John Wiley and Sons."},{"key":"9231_CR21","unstructured":"LICHMAN, M. (2013), UCI Machine Learning Repository, Irvine, CA: University of California, School of Information and Computer Science, http:\/\/archive.ics.uci.edu\/ml ."},{"key":"9231_CR22","unstructured":"MACQUEEN, J. (1967), \u201cSome Methods for Classification and Analysis of Multivariate Observations\u201d, in Proceedings of 5 th Berkeley Symposium on Mathematical Statistics and Probability, Vol. 2, Berkely, CA, pp. 281\u2013297."},{"key":"9231_CR23","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1007\/978-3-642-00202-1_24","volume":"5431","author":"M MAHAJAN","year":"2009","unstructured":"MAHAJAN, M., NIMBHORKAR, P., and VARADARAJAN, K. (2009), \u201cThe Planar k-Means Problem is NP-Hard\u201d, Lecture Notes in Computer Science, 5431, 274\u2013285.","journal-title":"Lecture Notes in Computer Science"},{"issue":"2-3","key":"9231_CR24","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1561\/0600000058","volume":"8","author":"J MAIRAL","year":"2012","unstructured":"MAIRAL, J., BACH, F., and PONCE, J. (2012), \u201cSparse Modeling for Image and Vision Processing\u201d, Foundations and Trends in Computer Graphics and Vision, 8(2-3), 85\u2013283.","journal-title":"Foundations and Trends in Computer Graphics and Vision"},{"key":"9231_CR25","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1109\/RBME.2009.2035356","volume":"2","author":"JN MAK","year":"2009","unstructured":"MAK, J.N., and WOLPAW, J.R. (2009), \u201cClinical Applications of Brain-Computer Interfaces: Current State and Future Prospects\u201d, IEEE Reviews in Biomedical Engineering, 2, 187\u2013199.","journal-title":"IEEE Reviews in Biomedical Engineering"},{"key":"9231_CR26","first-page":"151","volume":"2010","author":"R NUGENT","year":"2010","unstructured":"NUGENT, R., DEAN, N., and AYERS, E. (2010), \u201cSkill Set Profile Clustering: The Empty k-Means Algorithm with Automatic Specification of Starting Cluster Centers\u201d, in Educational Data Mining 2010, pp. 151\u2013160.","journal-title":"Educational Data Mining"},{"issue":"2","key":"9231_CR27","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/s10898-014-0171-5","volume":"61","author":"B ORDIN","year":"2015","unstructured":"ORDIN, B., and BAGIROV, A.M. (2015), \u201cA Heuristic Algorithm for Solving the Minimum Sum-of-Squares Clustering Problems\u201d, Journal of Global Optimization, 61(2), 341\u2013361.","journal-title":"Journal of Global Optimization"},{"issue":"2","key":"9231_CR28","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/S0167-9473(02)00224-4","volume":"43","author":"J PACHECO","year":"2003","unstructured":"PACHECO, J., and VALENCIA, O. (2003), \u201cDesign of Hybrids for the Minimum Sum-of-Squares Clustering Problem\u201d, Computational Statistics and Data Analysis, 43(2), 235\u2013248.","journal-title":"Computational Statistics and Data Analysis"},{"key":"9231_CR29","doi-asserted-by":"crossref","unstructured":"RUSPINI, E. (1970), \u201cNumerical Method for Fuzzy Clustering\u201d, Information Sciences, 2, 319\u2013350.","DOI":"10.1016\/S0020-0255(70)80056-1"},{"issue":"1","key":"9231_CR30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1348\/000711005X48266","volume":"59","author":"D STEINLEY","year":"2006","unstructured":"STEINLEY, D. (2006), \u201cK-Means Clustering: A Half-Century Synthesis\u201d, British Journal of Mathematical and Statistical Psychology, 59(1), 1\u201334.","journal-title":"British Journal of Mathematical and Statistical Psychology"},{"issue":"1","key":"9231_CR31","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s00357-007-0003-0","volume":"24","author":"D STEINLEY","year":"2007","unstructured":"STEINLEY, D., and BRUSCO, M.J. (2007), \u201cInitializing k-Means Batch Clustering: A Critical Evaluation of Several Techniques\u201d, Journal of Classification, 24(1), 99\u2013121.","journal-title":"Journal of Classification"},{"issue":"1","key":"9231_CR32","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1016\/j.patcog.2013.07.012","volume":"47","author":"PD TAO","year":"2014","unstructured":"TAO, P.D. et al. (2014), \u201cNew and Efficient Dca Based Algorithms for Minimum Sum-of-Squares Clustering\u201d, Pattern Recognition, 47(1), 388\u2013401.","journal-title":"Pattern Recognition"},{"key":"9231_CR33","unstructured":"TEBOULLE, M. (2007), \u201cA Unified Continous Optimization Framework for Center-Based Clustering Methods\u201d, Journal of Machine Learning Research, (8), 65\u2013102."},{"key":"9231_CR34","doi-asserted-by":"crossref","unstructured":"WARD JR., J.H. (1963), \u201cHierarchical Grouping to Optimize an Objective Function\u201d, Journal of the American Statistical Association, 58(301), 236\u2013244.","DOI":"10.1080\/01621459.1963.10500845"},{"key":"9231_CR35","doi-asserted-by":"crossref","unstructured":"WU, X., and KUMAR, V. (2009), The Top Ten Algorithms in Data Mining, CRC Press.","DOI":"10.1201\/9781420089653"}],"container-title":["Journal of Classification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00357-017-9231-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00357-017-9231-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00357-017-9231-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,25]],"date-time":"2019-09-25T21:32:57Z","timestamp":1569447177000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00357-017-9231-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,10]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["9231"],"URL":"https:\/\/doi.org\/10.1007\/s00357-017-9231-0","relation":{},"ISSN":["0176-4268","1432-1343"],"issn-type":[{"value":"0176-4268","type":"print"},{"value":"1432-1343","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,6,10]]}}}