{"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/ensemble-clustering-for-graphs-comparisons","title":"Ensemble Clustering for Graphs: Comparisons and Applications","arxiv_id":"1903.08012","date":"2019-03-19","proceeding":null,"authors":["Valérie Poulin","François Théberge"],"abstract":"We recently proposed a new ensemble clustering algorithm for graphs (ECG)\nbased on the concept of consensus clustering. We validated our approach by\nreplicating a study comparing graph clustering algorithms over benchmark\ngraphs, showing that ECG outperforms the leading algorithms. In this paper, we\nextend our comparison by considering a wider range of parameters for the\nbenchmark, generating graphs with different properties. We provide new\nexperimental results showing that the ECG algorithm alleviates the well-known\nresolution limit issue, and that it leads to better stability of the\npartitions. We also illustrate how the ensemble obtained with ECG can be used\nto quantify the presence of community structure in the graph, and to zoom in on\nthe sub-graph most closely associated with seed vertices. Finally, we\nillustrate further applications of ECG by comparing it to previous results for\ncommunity detection on weighted graphs, and community-aware anomaly detection.","url_abs":"http://arxiv.org/abs/1903.08012v1","url_pdf":"http://arxiv.org/pdf/1903.08012v1.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":"ensemble-clustering-for-graphs-comparisons","repo_url":"https://github.com/ftheberge/graph-partition-and-measures","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"ensemble-clustering-for-graphs-comparisons","repo_url":"https://github.com/ftheberge/Ensemble-Clustering-for-Graphs","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"anomaly-detection","task_name":"Anomaly Detection"},{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"community-detection","task_name":"Community Detection"},{"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":"ftheberge/graph-partition-and-measures","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"ftheberge/Ensemble-Clustering-for-Graphs","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":"256fc179fcad9084b69b31a46d98d8dd147937317f7163a3e26c8e32239d2eaa","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}