{"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/learning-resolution-parameters-for-graph","title":"Learning Resolution Parameters for Graph Clustering","arxiv_id":"1903.05246","date":"2019-03-12","proceeding":null,"authors":["Nate Veldt","David F. Gleich","Anthony Wirth"],"abstract":"Finding clusters of well-connected nodes in a graph is an extensively studied\nproblem in graph-based data analysis. Because of its many applications, a large\nnumber of distinct graph clustering objective functions and algorithms have\nalready been proposed and analyzed. To aid practitioners in determining the\nbest clustering approach to use in different applications, we present new\ntechniques for automatically learning how to set clustering resolution\nparameters. These parameters control the size and structure of communities that\nare formed by optimizing a generalized objective function. We begin by\nformalizing the notion of a parameter fitness function, which measures how well\na fixed input clustering approximately solves a generalized clustering\nobjective for a specific resolution parameter value. Under reasonable\nassumptions, which suit two key graph clustering applications, such a parameter\nfitness function can be efficiently minimized using a bisection-like method,\nyielding a resolution parameter that fits well with the example clustering. We\nview our framework as a type of single-shot hyperparameter tuning, as we are\nable to learn a good resolution parameter with just a single example. Our\ngeneral approach can be applied to learn resolution parameters for both local\nand global graph clustering objectives. We demonstrate its utility in several\nexperiments on real-world data where it is helpful to learn resolution\nparameters from a given example clustering.","url_abs":"http://arxiv.org/abs/1903.05246v1","url_pdf":"http://arxiv.org/pdf/1903.05246v1.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":"learning-resolution-parameters-for-graph","repo_url":"https://github.com/nveldt/LearnResParams","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"}],"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":"nveldt/LearnResParams","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":"4e0a781b44bad50ddd40a4f77aa55ebe2de6b96150c429470dc0aa4272ca1564","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}