Cited by 1,801Advanced Graph Neural NetworksGraph Theory and AlgorithmsComplex Network Analysis Techniques

Graph embedding techniques, applications, and performance: A survey

Open access
Goyal, Palash, Ferrara, Emilio·2018·Knowledge-Based Systems

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.knosys.2018.03.022

Cites

138 of 138 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 1

  1. [81][81] X. Xu, N. Yuruk, Z. Feng, T. A. Schweiger, Scan: a structural clustering algorithm for networks, in: Proceedings 13th international conference on Knowledge discovery and data mining, 2007, pp. 824-833. -

Cited by

Sorted by citations

Authors
Goyal, P., & Ferrara, E.
Affiliations
University of Southern California (US)
Corresponding author
Goyal, Palash
Venue
Knowledge-Based Systems
Publisher
Elsevier BV
Published
2018-07
Volume
151
Pages
78-94
ISSN
0950-7051 (ISSN-L)
OpenAlex
W2612872092
Cited by
1,801
References
138
Citations by year
2026: 54 · 2025: 119 · 2024: 161 · 2023: 223 · 2022: 258 · 2021: 336 · 2020: 317 · 2019: 228 · 2018: 93 · 2017: 11 · 2016: 1
FWCI
137.07
Type
journal article
Language
en
Open access
Locations
  • Knowledge-Based Systems (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Advanced Graph Neural Networks
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Graph Theory and Algorithms
  • Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
Keywords
graph embedding, factorization method, random walks, scalability, feature preservation, social networks, word co-occurrence networks, communication networks

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review