{"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/a-binary-optimization-approach-for","title":"A Binary Optimization Approach for Constrained K-Means Clustering","arxiv_id":"1810.10134","date":"2018-10-24","proceeding":null,"authors":["Huu Le","Anders Eriksson","Thanh-Toan Do","Michael Milford"],"abstract":"K-Means clustering still plays an important role in many computer vision\nproblems. While the conventional Lloyd method, which alternates between\ncentroid update and cluster assignment, is primarily used in practice, it may\nconverge to a solution with empty clusters. Furthermore, some applications may\nrequire the clusters to satisfy a specific set of constraints, e.g., cluster\nsizes, must-link/cannot-link. Several methods have been introduced to solve\nconstrained K-Means clustering. Due to the non-convex nature of K-Means,\nhowever, existing approaches may result in sub-optimal solutions that poorly\napproximate the true clusters. In this work, we provide a new perspective to\ntackle this problem. Particularly, we reconsider constrained K-Means as a\nBinary Optimization Problem and propose a novel optimization scheme to search\nfor feasible solutions in the binary domain. This approach allows us to solve\nconstrained K-Means where multiple types of constraints can be simultaneously\nenforced. Experimental results on synthetic and real datasets show that our\nmethod provides better clustering accuracy with faster runtime compared to\nseveral commonly used techniques.","url_abs":"http://arxiv.org/abs/1810.10134v2","url_pdf":"http://arxiv.org/pdf/1810.10134v2.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":"a-binary-optimization-approach-for","repo_url":"https://github.com/intellhave/BCKM","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"}],"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":"intellhave/BCKM","kind":"listed","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":"7e7329630ccadca42951d1dabc7ed37eb2159c486d40f0ac9914ad1ac8dc6437","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}