{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/structural-deep-network-embedding","title":"Structural Deep Network Embedding","arxiv_id":null,"date":"2016-06-01","proceeding":"KDD 2016 6","authors":["Daixin Wang1","Peng Cui1","Wenwu Zhu1"],"abstract":"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 ﬁnd 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 speciﬁcally, we ﬁrst 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 ﬁrst-order and second-order proximity jointly to preserve the network structure. The second-order proximity is used bytheunsupervisedcomponenttocapturetheglobalnetworkstructure. Whiletheﬁrst-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 ﬁve 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 signiﬁcantly better and achieves substantial gains in three applications, i.e. multi-label classiﬁcation, link prediction and visualization.","url_abs":"https://www.kdd.org/kdd2016/papers/files/rfp0191-wangAemb.pdf","url_pdf":"https://www.kdd.org/kdd2016/papers/files/rfp0191-wangAemb.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"structural-deep-network-embedding","repo_url":"https://github.com/abhilash1910/Deep-Graph-Learning","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"structural-deep-network-embedding","repo_url":"https://github.com/abhilash1910/SpectralEmbeddings","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":{"status":"ok","spdx":"NOASSERTION"}},{"paper_slug":"structural-deep-network-embedding","repo_url":"https://github.com/mindspore-ai/models/tree/master/research/gnn/sdne","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"structural-deep-network-embedding","repo_url":"https://github.com/shenweichen/GraphEmbedding","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":null},{"paper_slug":"structural-deep-network-embedding","repo_url":"https://github.com/suanrong/SDNE","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null},{"paper_slug":"structural-deep-network-embedding","repo_url":"https://github.com/yangyucheng000/sdne","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null}],"tasks":[{"task_slug":"graph-classification","task_name":"Graph Classification"},{"task_slug":"link-prediction","task_name":"Link Prediction"},{"task_slug":"network-embedding","task_name":"Network Embedding"}],"methods":[{"method_slug":"sdne","method_name":"SDNE"}],"datasets_introduced":[],"methods_introduced":[{"slug":"sdne","name":"SDNE","full_name":"Structural Deep Network Embedding"}],"results":[{"leaderboard":"/sota/graph-classification-on-bp-fmri-97","task":"Graph Classification","dataset":"BP-fMRI-97","model":"SDBN","rank_in_archive_order":2,"of":7,"metrics":{"Accuracy":"64.8%","F1":"63.7%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-hiv-dti-77","task":"Graph Classification","dataset":"HIV-DTI-77","model":"SDBN","rank_in_archive_order":2,"of":6,"metrics":{"Accuracy":"65.9%","F1":"65.6%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-hiv-fmri-77","task":"Graph Classification","dataset":"HIV-fMRI-77","model":"SDBN","rank_in_archive_order":3,"of":7,"metrics":{"Accuracy":"66.5%","F1":"66.7%"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"abhilash1910/Deep-Graph-Learning","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"abhilash1910/SpectralEmbeddings","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"mindspore-ai/models","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2208.08084"],"harvested_for_calls":[{"arxiv_id":"2208.08084","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2208.08084"},"call":"get_harvested_code_for_paper(arxiv_id=\"2208.08084\")"}]},{"repo":"shenweichen/GraphEmbedding","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1704.03165"],"harvested_for_calls":[{"arxiv_id":"1704.03165","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1704.03165"},"call":"get_harvested_code_for_paper(arxiv_id=\"1704.03165\")"}]},{"repo":"suanrong/SDNE","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"yangyucheng000/sdne","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"5bb4783ceeec9123d681792f117073efbcef1d778d20cda853364a58b9e750b0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}