Papers › Structural Deep Network Embedding

Structural Deep Network Embedding

1 Jun 2016KDD 2016 6archive 2025-07-28

Daixin Wang1, Peng Cui1, Wenwu Zhu1

Networkembeddingisanimportantmethodtolearnlow-dimensional representations of vertexes in networks, aiming to capture and preserve the network structure. Almost all the existing network embeddingmethodsadoptshallowmodels. However,sincetheunderlyingnetworkstructureiscomplex, shallowmodelscannotcapture 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 StructuralDeepNetworkEmbeddingmethod,namelySDNE.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 bytheunsupervisedcomponenttocapturetheglobalnetworkstructure. Whilethefirst-orderproximityisusedasthesupervisedinformation 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 structureandisrobusttosparsenetworks. Empirically,weconduct 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.

PaperPDFCode

Syntology This paper has no arXiv id in the archive, and this site joins papers to Syntology's graph by arXiv id, so this page does not say whether the graph holds it.

Code

abhilash1910/Deep-Graph-Learning tfSyntology: not harvested report
abhilash1910/SpectralEmbeddings tfNOASSERTIONSyntology: not harvested report
mindspore-ai/models mindsporeSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to AdaBin: Improving Binary Neural Networks with Adaptive Binary Sets (arXiv:2208.08084; that paper's own run record: 4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified); nothing checks that they implement this paper's method. report
shenweichen/GraphEmbedding tfSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to struc2vec: Learning Node Representations from Structural Identity (arXiv:1704.03165; that paper's own run record: 3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified); nothing checks that they implement this paper's method. report
suanrong/SDNE Syntology: not harvested report
yangyucheng000/sdne mindsporeSyntology: not harvested report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Graph ClassificationLink PredictionNetwork Embedding

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Graph Classification BP-fMRI-97 SDBN Accuracy 64.8% #2 of 7 Archive leaderboard report
Graph Classification BP-fMRI-97 SDBN F1 63.7% #2 of 7 Archive leaderboard report
Graph Classification HIV-DTI-77 SDBN Accuracy 65.9% #2 of 6 Archive leaderboard report
Graph Classification HIV-DTI-77 SDBN F1 65.6% #2 of 6 Archive leaderboard report
Graph Classification HIV-fMRI-77 SDBN Accuracy 66.5% #3 of 7 Archive leaderboard report
Graph Classification HIV-fMRI-77 SDBN F1 66.7% #3 of 7 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Methods

Introduced by this paper: SDNE

SDNE

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