{"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/gemsec-graph-embedding-with-self-clustering","title":"GEMSEC: Graph Embedding with Self Clustering","arxiv_id":"1802.03997","date":"2018-02-12","proceeding":null,"authors":["Benedek Rozemberczki","Ryan Davies","Rik Sarkar","Charles Sutton"],"abstract":"Modern graph embedding procedures can efficiently process graphs with millions of nodes. In this paper, we propose GEMSEC -- a graph embedding algorithm which learns a clustering of the nodes simultaneously with computing their embedding. GEMSEC is a general extension of earlier work in the domain of sequence-based graph embedding. GEMSEC places nodes in an abstract feature space where the vertex features minimize the negative log-likelihood of preserving sampled vertex neighborhoods, and it incorporates known social network properties through a machine learning regularization. We present two new social network datasets and show that by simultaneously considering the embedding and clustering problems with respect to social properties, GEMSEC extracts high-quality clusters competitive with or superior to other community detection algorithms. In experiments, the method is found to be computationally efficient and robust to the choice of hyperparameters.","url_abs":"http://arxiv.org/abs/1802.03997v1","url_pdf":"http://arxiv.org/pdf/1802.03997v1.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":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"gemsec-graph-embedding-with-self-clustering","repo_url":"https://github.com/benedekrozemberczki/GEMSEC","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"gemsec-graph-embedding-with-self-clustering","repo_url":"https://github.com/benedekrozemberczki/GRAF","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"gemsec-graph-embedding-with-self-clustering","repo_url":"https://github.com/benedekrozemberczki/karateclub","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"GPL-3.0"}}],"tasks":[],"methods":[],"datasets_introduced":[{"slug":"deezer-user-networks","name":"Deezer User Networks","full_name":""}],"methods_introduced":[],"results":[{"leaderboard":"/sota/community-detection-on-facebook-artists","task":"Community Detection","dataset":"Facebook Artists","model":"Smooth GEMSEC 2","rank_in_archive_order":1,"of":1,"metrics":{"Modularity":"0.562"},"uses_additional_data":false},{"leaderboard":"/sota/community-detection-on-facebook-athletes","task":"Community Detection","dataset":"Facebook Athletes","model":"Smooth GEMSEC 2","rank_in_archive_order":1,"of":1,"metrics":{"Modularity":"0.692"},"uses_additional_data":false},{"leaderboard":"/sota/community-detection-on-facebook-celebrities","task":"Community Detection","dataset":"Facebook Celebrities","model":"Smooth GEMSEC 2","rank_in_archive_order":1,"of":1,"metrics":{"Modularity":"0.649"},"uses_additional_data":false},{"leaderboard":"/sota/community-detection-on-facebook-companies","task":"Community Detection","dataset":"Facebook Companies","model":"Smooth GEMSEC 2","rank_in_archive_order":1,"of":1,"metrics":{"Modularity":"0.684"},"uses_additional_data":false},{"leaderboard":"/sota/community-detection-on-facebook-government","task":"Community Detection","dataset":"Facebook Government","model":"Smooth GEMSEC 2","rank_in_archive_order":1,"of":1,"metrics":{"Modularity":"0.712"},"uses_additional_data":false},{"leaderboard":"/sota/community-detection-on-facebook-media","task":"Community Detection","dataset":"Facebook Media","model":"Smooth GEMSEC 2","rank_in_archive_order":1,"of":1,"metrics":{"Modularity":"0.571"},"uses_additional_data":false},{"leaderboard":"/sota/community-detection-on-facebook-politicians","task":"Community Detection","dataset":"Facebook Politicians","model":"Smooth GEMSEC 2","rank_in_archive_order":1,"of":1,"metrics":{"Modularity":"0.859"},"uses_additional_data":false},{"leaderboard":"/sota/community-detection-on-facebook-tv-show","task":"Community Detection","dataset":"Facebook TV Show","model":"Smooth GEMSEC 2","rank_in_archive_order":1,"of":1,"metrics":{"Modularity":"0.847"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-deezer-croatia","task":"Node Classification","dataset":"Deezer Croatia","model":"GEMSEC 2","rank_in_archive_order":1,"of":1,"metrics":{"Micro-F1":"0.381"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-deezer-hungary","task":"Node Classification","dataset":"Deezer Hungary","model":"Smooth GEMSEC 2","rank_in_archive_order":1,"of":1,"metrics":{"Micro-F1":"0.409"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-deezer-romania","task":"Node Classification","dataset":"Deezer Romania","model":"GEMSEC 2","rank_in_archive_order":2,"of":2,"metrics":{"Micro-F1":"0.378"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1802.03997","atlas_url":"https://app.syntology.ai/?focus=1802.03997","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1802.03997"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1802.03997\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1802.03997"},"call":"get_concepts_for_paper(arxiv_id=\"1802.03997\")"}],"by_repo":[{"repo":"benedekrozemberczki/GEMSEC","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"benedekrozemberczki/GRAF","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"benedekrozemberczki/karateclub","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":"66dea3fc2eb3d431841f009af479c2dca60494d89d8958989747470df727a1ac","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}