{"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/discrete-optimal-graph-clustering","title":"Discrete Optimal Graph Clustering","arxiv_id":"1904.11266","date":"2019-04-25","proceeding":null,"authors":["Yudong Han","Lei Zhu","Zhiyong Cheng","Jingjing Li","Xiaobai Liu"],"abstract":"Graph based clustering is one of the major clustering methods. Most of it\nwork in three separate steps: similarity graph construction, clustering label\nrelaxing and label discretization with k-means. Such common practice has three\ndisadvantages: 1) the predefined similarity graph is often fixed and may not be\noptimal for the subsequent clustering. 2) the relaxing process of cluster\nlabels may cause significant information loss. 3) label discretization may\ndeviate from the real clustering result since k-means is sensitive to the\ninitialization of cluster centroids. To tackle these problems, in this paper,\nwe propose an effective discrete optimal graph clustering (DOGC) framework. A\nstructured similarity graph that is theoretically optimal for clustering\nperformance is adaptively learned with a guidance of reasonable rank\nconstraint. Besides, to avoid the information loss, we explicitly enforce a\ndiscrete transformation on the intermediate continuous label, which derives a\ntractable optimization problem with discrete solution. Further, to compensate\nthe unreliability of the learned labels and enhance the clustering accuracy, we\ndesign an adaptive robust module that learns prediction function for the unseen\ndata based on the learned discrete cluster labels. Finally, an iterative\noptimization strategy guaranteed with convergence is developed to directly\nsolve the clustering results. Extensive experiments conducted on both real and\nsynthetic datasets demonstrate the superiority of our proposed methods compared\nwith several state-of-the-art clustering approaches.","url_abs":"http://arxiv.org/abs/1904.11266v1","url_pdf":"http://arxiv.org/pdf/1904.11266v1.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":"discrete-optimal-graph-clustering","repo_url":"https://github.com/christinecui/DOGC","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"graph-clustering","task_name":"Graph Clustering"},{"task_slug":"graph-construction","task_name":"graph construction"}],"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":"christinecui/DOGC","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":"95459ef554b0b463b06130ab03cb93822c5ede6870f100c8bac3b5157ce7d1c1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}