{"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/grarep-learning-graph-representations-with","title":"GraRep: Learning Graph Representations with Global Structural Information","arxiv_id":null,"date":"2015-10-17","proceeding":"WWW 2015 10","authors":["Shaosheng Cao","Wei Lu","Qiongkai Xu"],"abstract":"In this paper, we present {GraRep}, a novel model for learning vertex representations of weighted graphs. This model learns low dimensional vectors to represent vertices appearing in a graph and, unlike existing work, integrates global structural information of the graph into the learning process. We also formally analyze the connections between our work and several previous research efforts, including the DeepWalk model of Perozzi et al. as well as the skip-gram model with negative sampling of Mikolov et al. We conduct experiments on a language network, a social network as well as a citation network and show that our learned global representations can be effectively used as features in tasks such as clustering, classification and visualization. Empirical results demonstrate that our representation significantly outperforms other state-of-the-art methods in such tasks.","url_abs":"https://www.researchgate.net/publication/301417811_GraRep","url_pdf":"https://github.com/ShelsonCao/GraRep/blob/master/GraRep-%20Learning%20Graph%20Representations%20with%20Global%20Structural%20Information.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":"grarep-learning-graph-representations-with","repo_url":"https://github.com/benedekrozemberczki/GraRep","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null},{"paper_slug":"grarep-learning-graph-representations-with","repo_url":"https://github.com/benedekrozemberczki/karateclub","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok","spdx":"GPL-3.0"}}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"node-classification","task_name":"Node Classification"}],"methods":[{"method_slug":"deepwalk","method_name":"DeepWalk"},{"method_slug":"grarep","method_name":"GraRep"}],"datasets_introduced":[],"methods_introduced":[{"slug":"grarep","name":"GraRep","full_name":"Graph Representation with Global structure"}],"results":[{"leaderboard":"/sota/node-classification-on-20news","task":"Node Classification","dataset":"20NEWS","model":"GraRep","rank_in_archive_order":1,"of":1,"metrics":{"Accuracy":"81.44"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-blogcatalog","task":"Node Classification","dataset":"Eximtradedata","model":"GraRep","rank_in_archive_order":4,"of":5,"metrics":{"Macro-F1":"0.3093"},"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":"benedekrozemberczki/GraRep","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":"ba33604482acda189ef578da5d5150f7da9a656ec5a2c59cdbb468c413c80c21","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}