Methods › Graphs › Graph Embeddings › HOPE

High-Order Proximity preserved Embedding

HOPE

16 papers tagged archive 2025-07-28

Introduced by Mingdong Ou et al. in Asymmetric Transitivity Preserving Graph Embedding

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

The archive carries no description for this method.

PaperSource

Papers archive 2025-07-28

16 shown of 16, newest first. Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code; it is per sample and not a correctness claim.

Tasks archive 2025-07-28

20 shown of 33 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Graph Embedding4
Link Prediction4
Clustering2
Representation Learning2
Response Generation2
Chunking1
Community Detection1
Dialogue Act Classification1
Dialogue Generation1
Dimensionality Reduction1
Dynamic graph embedding1
GPU1
General Classification1
Graph Clustering1
Image Retrieval1
Incremental Learning1
Machine Translation1
Marketing1
Node Classification1
Object1

Usage over time archive 2025-07-28

Papers per year tagged with HOPE: 2019 to 2025, peak 4 4 0 2019: 2 papers 2019 2020: 2 papers 2020 2021: 2 papers 2021 2022: 0 papers 2022 2023: 3 papers 2023 2024: 4 papers 2024 2025: 3 papers 2025
Papers per year the archive tags with this method, by the paper's archive date (16 dated). Bars are counts, not a trend claim.

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

Graph Embeddings

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