{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/hg-means-a-scalable-hybrid-genetic-algorithm","title":"HG-means: A scalable hybrid genetic algorithm for minimum sum-of-squares clustering","arxiv_id":"1804.09813","date":"2018-04-25","proceeding":null,"authors":["Daniel Gribel","Thibaut Vidal"],"abstract":"Minimum sum-of-squares clustering (MSSC) is a widely used clustering model,\nof which the popular K-means algorithm constitutes a local minimizer. It is\nwell known that the solutions of K-means can be arbitrarily distant from the\ntrue MSSC global optimum, and dozens of alternative heuristics have been\nproposed for this problem. However, no other algorithm has been predominantly\nadopted in the literature. This may be related to differences of computational\neffort, or to the assumption that a near-optimal solution of the MSSC has only\na marginal impact on clustering validity. In this article, we dispute this\nbelief. We introduce an efficient population-based metaheuristic that uses\nK-means as a local search in combination with problem-tailored crossover,\nmutation, and diversification operators. This algorithm can be interpreted as a\nmulti-start K-means, in which the initial center positions are carefully\nsampled based on the search history. The approach is scalable and accurate,\noutperforming all recent state-of-the-art algorithms for MSSC in terms of\nsolution quality, measured by the depth of local minima. This enhanced accuracy\nleads to clusters which are significantly closer to the ground truth than those\nof other algorithms, for overlapping Gaussian-mixture datasets with a large\nnumber of features. Therefore, improved global optimization methods appear to\nbe essential to better exploit the MSSC model in high dimension.","url_abs":"http://arxiv.org/abs/1804.09813v2","url_pdf":"http://arxiv.org/pdf/1804.09813v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"hg-means-a-scalable-hybrid-genetic-algorithm","repo_url":"https://github.com/danielgribel/hg-means","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"global-optimization","task_name":"global-optimization"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"danielgribel/hg-means","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"3eb3ecd9e7d36056743dc7bfaf427a35b9b84440223e7e8f815c9ab937703a92","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}