Cited by 2,845Advanced Graph Neural NetworksComplex Network Analysis TechniquesFace and Expression Recognition

Structural Deep Network Embedding

Wang, Daixin, Cui, Peng, Zhu, Wenwu·2016·Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Abstract

Network embedding is an important method to learn low-dimensional representations of vertexes in networks, aiming to capture and preserve the network structure. Almost all the existing network embedding methods adopt shallow models. However, since the underlying network structure is complex, shallow models cannot capture the highly non-linear network structure, resulting in sub-optimal network representations. Therefore, how to find a method that is able to effectively capture the highly non-linear network structure and preserve the global and local structure is an open yet important problem. To solve this problem, in this paper we propose a Structural Deep Network Embedding method, namely SDNE. More specifically, we first propose a semi-supervised deep model, which has multiple layers of non-linear functions, thereby being able to capture the highly non-linear network structure. Then we propose to exploit the first-order and second-order proximity jointly to preserve the network structure. The second-order proximity is used by the unsupervised component to capture the global network structure. While the first-order proximity is used as the supervised information in the supervised component to preserve the local network structure. By jointly optimizing them in the semi-supervised deep model, our method can preserve both the local and global network structure and is robust to sparse networks. Empirically, we conduct the experiments on five real-world networks, including a language network, a citation network and three social networks. The results show that compared to the baselines, our method can reconstruct the original network significantly better and achieves substantial gains in three applications, i.e. multi-label classification, link prediction and visualization.

Integrity signals

Registry

Crossref · 10.1145/2939672.2939753

Cites

39 of 39 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • DNGR and SDNE only consider node structural information and ignore node feature information.

    “DNGR [59] and SDNE [60] only consider node structural information which is about the connectivity between pairs of nodes. They ignore nodes may contain feature information that depicts the attributes of nodes themselves.”

    From A Comprehensive Survey on Graph Neural Networks (2021) · cites this paper as [60]

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Wang, D., Cui, P., & Zhu, W.
Affiliations
Tsinghua University (CN)
Venue
Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
Publisher
ACM
Published
2016-08-13
Pages
1225-1234
OpenAlex
W2393319904
Cited by
2,845
References
39
Citations by year
2026: 63 · 2025: 154 · 2024: 236 · 2023: 329 · 2022: 389 · 2021: 468 · 2020: 485 · 2019: 390 · 2018: 242 · 2017: 83 · 2016: 5
FWCI
129.32
Type
conference paper
Language
en
Open access
closed
Locations
ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) (publishedVersion)
Funders
  • National Natural Science Foundation of China (6137002 61531006 61472444 61210008)
  • National Program on Key Basic Research Project (2015CB352300)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Advanced Graph Neural Networks
  • Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Face and Expression Recognition
Keywords
graph embedding, semi-supervised deep learning, sparse networks, network inference, multi-label classification, link prediction, network visualization

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