Methods › Graphs › Graph Embeddings › GraRep
Graph Representation with Global structure
GraRep
Introduced by Shaosheng Cao et al. in GraRep: Learning Graph Representations with Global Structural Information
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
The archive carries no description for this method.
In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.
Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.
Papers archive 2025-07-28
archive papers tagged: 5 · with a code link: 4 · where Syntology ran a sample: 0 (0 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran: none of the 5 tagged papers has a Syntology run on record
Page 1 of 1: papers 1 to 5 of 5, newest first by the archive's date (ties by slug), in archive order.
Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.
-
Classic Graph Structural Features Outperform Factorization-Based Graph Embedding Methods on Community Labeling 20 Jan 2022 · 1 repository · arXiv:2201.08481
-
REFINE: Random RangE FInder for Network Embedding 24 Aug 2021 · 0 repositories · arXiv:2108.10703
-
Network Representation Learning: Consolidation and Renewed Bearing 2 May 2019 · 1 repository · arXiv:1905.00987
-
Spectral Network Embedding: A Fast and Scalable Method via Sparsity 7 Jun 2018 · 1 repository · arXiv:1806.02623
-
GraRep: Learning Graph Representations with Global Structural Information 17 Oct 2015 · 2 repositories
Tasks archive 2025-07-28
10 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
Usage over time archive 2025-07-28
Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).
Categories archive 2025-07-28
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections