{"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/weisfeiler-lehman-neural-machine-for-link","title":"Weisfeiler-lehman neural machine for link prediction","arxiv_id":null,"date":"2017-08-01","proceeding":"KDD 2017 8","authors":["Muhan Zhang","Yixin Chen"],"abstract":"In this paper, we propose a next-generation link prediction method,\r\nWeisfeiler-Lehman Neural Machine (Wlnm), which learns topological features in the form of graph patterns that promote the\r\nformation of links. Wlnm has unmatched advantages including\r\nhigher performance than state-of-the-art methods and universal\r\napplicability over various kinds of networks. Wlnm extracts an\r\nenclosing subgraph of each target link and encodes the subgraph\r\nas an adjacency matrix. The key novelty of the encoding comes\r\nfrom a fast hashing-based Weisfeiler-Lehman (WL) algorithm that\r\nlabels the vertices according to their structural roles in the subgraph\r\nwhile preserving the subgraph’s intrinsic directionality. After that,\r\na neural network is trained on these adjacency matrices to learn a\r\npredictive model. Compared with traditional link prediction methods, Wlnm does not assume a particular link formation mechanism\r\n(such as common neighbors), but learns this mechanism from the\r\ngraph itself. We conduct comprehensive experiments to show that\r\nWlnm not only outperforms a great number of state-of-the-art\r\nlink prediction methods, but also consistently performs well across\r\nnetworks with different characteristics.","url_abs":"https://dl.acm.org/doi/pdf/10.1145/3097983.3097996","url_pdf":"https://dl.acm.org/doi/pdf/10.1145/3097983.3097996","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":"weisfeiler-lehman-neural-machine-for-link","repo_url":"https://github.com/muhanzhang/LinkPrediction","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"torch","reach":null}],"tasks":[{"task_slug":"link-prediction","task_name":"Link Prediction"},{"task_slug":"prediction","task_name":"Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"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":"muhanzhang/LinkPrediction","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"f6272d441c58fd932115d4d0772d13a45ebaa7ece6ea1d09d45c9065ecb0c1c1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}