{"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/gscan-graph-stability-clustering-for","title":"GSCAN: Graph Stability Clustering for Applications With Noise Using Edge-Aware Excess-of-Mass","arxiv_id":null,"date":"2024-04-17","proceeding":"Proceedings of the Second Learning on Graphs Conference, PMLR, 2024 2024 4","authors":["Etzion Harari","Naphtali Abudarham","Roee Litman"],"abstract":"Graph Clustering is required for the identification of communities and groups within a given network. In recent years, various attempts have been made to develop tools suitable for this purpose. Most recently, these attempts are based on the latest advancements in deep learning and especially in Graph Neural Networks (GNN). While some methods take into account the graph intrinsic topological structure throughout, surprisingly, the leading clustering methods ignore this during the final cluster assignment stage, which leads to sub-optimal results. In this paper, we propose GSCAN: a Graph Stability Clustering for Applications with Noise, which is based both on node features and on the graph structure. We base our approach on the celebrated method of Exess-of-Mass (EoM), which is based the principle of maximizing cluster stability. This method has additional desirable properties like resilience to outliers and the fact it doesn’t require an a-priory definition of the number of clusters. We extend EoM to work on the \\ast intrinsic\\ast graph structure and propose two possible post-processes to deal with one of EoM’s shortcomings - its tendency to over-flagging data-points as outliers. These post processes harness the graph topology and lead to superior performance, even compared to leading clustering approaches that are trained end-to-end. We show that the proposed approach can be implemented in a fast and scalable manner. Our claims are backed on three well-known benchmark datasets. Our code is available here: https://github.com/GraphEoM/GSCAN","url_abs":"https://proceedings.mlr.press/v231/harari24a.html","url_pdf":"https://proceedings.mlr.press/v231/harari24a/harari24a.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":"gscan-graph-stability-clustering-for","repo_url":"https://github.com/GraphEoM/GSCAN","is_official":0,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"graph-clustering","task_name":"Graph Clustering"}],"methods":[{"method_slug":"base","method_name":"BASE"},{"method_slug":"eom","method_name":"EoM"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/graph-clustering-on-citeseer","task":"Graph Clustering","dataset":"Citeseer","model":"DAEGC+GSCAN†","rank_in_archive_order":9,"of":9,"metrics":{"ARI":"38.2","F score":"64.7","F1":"64.7","NMI":"39.9"},"uses_additional_data":false},{"leaderboard":"/sota/graph-clustering-on-cora","task":"Graph Clustering","dataset":"Cora","model":"DAEGC+GSCAN†","rank_in_archive_order":9,"of":9,"metrics":{"ARI":"49.6","F score":"71.7","F1":"71.7","NMI":"52.4"},"uses_additional_data":false},{"leaderboard":"/sota/graph-clustering-on-pubmed","task":"Graph Clustering","dataset":"Pubmed","model":"DAEGC+GSCAN†","rank_in_archive_order":7,"of":7,"metrics":{"ARI":"31.0","F score":"67.6","NMI":"31.7"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"GraphEoM/GSCAN","kind":"named_in_paper","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1906.06532"],"harvested_for_calls":[{"arxiv_id":"1906.06532","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1906.06532"},"call":"get_harvested_code_for_paper(arxiv_id=\"1906.06532\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"cee6e481c7502eb48a8e8a65365788a531f797fa4315841556a291d36d7d4f22","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}