{"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-role-based-graph-embeddings","title":"Learning Role-based Graph Embeddings","arxiv_id":"1802.02896","date":"2018-02-07","proceeding":"IJCAI 2018 7","authors":["Nesreen K. Ahmed","Ryan Rossi","John Boaz Lee","Theodore L. Willke","Rong Zhou","Xiangnan Kong","Hoda Eldardiry"],"abstract":"Random walks are at the heart of many existing network embedding methods.\nHowever, such algorithms have many limitations that arise from the use of\nrandom walks, e.g., the features resulting from these methods are unable to\ntransfer to new nodes and graphs as they are tied to vertex identity. In this\nwork, we introduce the Role2Vec framework which uses the flexible notion of\nattributed random walks, and serves as a basis for generalizing existing\nmethods such as DeepWalk, node2vec, and many others that leverage random walks.\nOur proposed framework enables these methods to be more widely applicable for\nboth transductive and inductive learning as well as for use on graphs with\nattributes (if available). This is achieved by learning functions that\ngeneralize to new nodes and graphs. We show that our proposed framework is\neffective with an average AUC improvement of 16.55% while requiring on average\n853x less space than existing methods on a variety of graphs.","url_abs":"http://arxiv.org/abs/1802.02896v2","url_pdf":"http://arxiv.org/pdf/1802.02896v2.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-role-based-graph-embeddings","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"}},{"paper_slug":"learning-role-based-graph-embeddings","repo_url":"https://github.com/benedekrozemberczki/role2vec","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"inductive-learning","task_name":"Inductive Learning"},{"task_slug":"network-embedding","task_name":"Network Embedding"}],"methods":[{"method_slug":"deepwalk","method_name":"DeepWalk"},{"method_slug":"node2vec","method_name":"node2vec"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1802.02896","atlas_url":"https://app.syntology.ai/?focus=1802.02896","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.02896"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1802.02896\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1802.02896"},"call":"get_concepts_for_paper(arxiv_id=\"1802.02896\")"}],"by_repo":[{"repo":"benedekrozemberczki/karateclub","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"benedekrozemberczki/role2vec","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":"c6a08a5ce64ada79f285f4ddb53270f0524b77958194be26aa2265231a6c75de","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}