{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T20:33:50Z","timestamp":1783715630027,"version":"3.55.0"},"reference-count":65,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2022ZD0160102"],"award-info":[{"award-number":["2022ZD0160102"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1109\/tkde.2024.3481015","type":"journal-article","created":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T17:26:22Z","timestamp":1729013182000},"page":"253-264","source":"Crossref","is-referenced-by-count":15,"title":["Efficient Link Prediction via GNN Layers Induced by Negative Sampling"],"prefix":"10.1109","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6551-000X","authenticated-orcid":false,"given":"Yuxin","family":"Wang","sequence":"first","affiliation":[{"name":"School of Computer Science, Fudan University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-3296-2867","authenticated-orcid":false,"given":"Xiannian","family":"Hu","sequence":"additional","affiliation":[{"name":"School of Computer Science, Fudan University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-0986-457X","authenticated-orcid":false,"given":"Quan","family":"Gan","sequence":"additional","affiliation":[{"name":"Amazon, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9197-9426","authenticated-orcid":false,"given":"Xuanjing","family":"Huang","sequence":"additional","affiliation":[{"name":"School of Computer Science, Fudan University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7163-5247","authenticated-orcid":false,"given":"Xipeng","family":"Qiu","sequence":"additional","affiliation":[{"name":"School of Computer Science, Fudan University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2768-4540","authenticated-orcid":false,"given":"David","family":"Wipf","sequence":"additional","affiliation":[{"name":"Amazon, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3383313.3418486"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93417-4_38"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(03)00009-1"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2009-00335-8"},{"key":"ref7","first-page":"2713","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kipf"},{"key":"ref8","first-page":"1024","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref9","first-page":"5171","article-title":"Link prediction based on graph neural networks","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Zhang"},{"key":"ref10","first-page":"9061","article-title":"Labeling trick: A theory of using graph neural networks for multi-node representation learning","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Zhang"},{"key":"ref11","first-page":"29476","article-title":"Neural Bellman-Ford networks: A general graph neural network framework for link prediction","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Zhu"},{"key":"ref12","first-page":"1","article-title":"Graph neural networks for link prediction with subgraph sketching","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Chamberlain"},{"key":"ref13","first-page":"2321","article-title":"Asymmetric LSH (ALSH) for sublinear time maximum inner product search (MIPS)","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Shrivastava"},{"key":"ref14","first-page":"1926","article-title":"On symmetric and asymmetric LSHs for inner product search","volume-title":"Proc. 32nd Int. Conf. Mach. Learn.","author":"Neyshabur"},{"key":"ref15","first-page":"5453","article-title":"A greedy approach for budgeted maximum inner product search","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Yu"},{"key":"ref16","article-title":"Flashlight: Scalable link prediction with effective decoders","volume-title":"Proc. Learn. Graphs Conf.","author":"Wang"},{"key":"ref17","first-page":"13683","article-title":"Neo-GNNs: Neighborhood overlap-aware graph neural networks for link prediction","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Yun"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.14778\/3611479.3611499"},{"key":"ref19","first-page":"11773","article-title":"Graph neural networks inspired by classical iterative algorithms","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yang"},{"key":"ref20","article-title":"Graph attention networks","author":"Veli\u010dkovi\u0107","year":"2017"},{"key":"ref21","first-page":"5896","article-title":"Geodesic graph neural network for efficient graph representation learning","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Kong"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551831"},{"key":"ref23","article-title":"Descent steps of a relation-aware energy produce heterogeneous graph neural networks","author":"Ahn","year":"2022"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP39728.2021.9415073"},{"key":"ref25","first-page":"6837","article-title":"Elastic graph neural networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Liu"},{"key":"ref26","article-title":"A unified view on graph neural networks as graph signal denoising","author":"Ma","year":"2020"},{"key":"ref27","article-title":"A unified framework for convolution-based graph neural networks","author":"Pan","year":"2021"},{"key":"ref28","article-title":"Revisiting graph convolutional network on semi-supervised node classification from an optimization perspective","author":"Zhang","year":"2020"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449953"},{"key":"ref30","first-page":"2194","article-title":"Learning deep $\\ell _{0}$\u21130 encoders","volume-title":"Proc. AAAI Conf. Artif. Intell.","author":"Wang"},{"key":"ref31","first-page":"4776","article-title":"How powerful are K-hop message passing graph neural networks","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Feng"},{"key":"ref32","first-page":"31 376","article-title":"Understanding and extending subgraph GNNs by rethinking their symmetries","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Frasca"},{"key":"ref33","article-title":"How powerful are graph neural networks?","author":"Xu","year":"2018"},{"key":"ref34","first-page":"1","article-title":"Rethinking the expressive power of GNNs via graph biconnectivity","volume-title":"Proc. 11th Int. Conf. Learn. Representations","author":"Zhang"},{"key":"ref35","first-page":"41 019","article-title":"A complete expressiveness hierarchy for subgraph GNNs via subgraph Weisfeiler-Lehman tests","volume-title":"Proc. 40th Int. Conf. Mach. Learn.","author":"Zhang"},{"key":"ref36","first-page":"25 275","article-title":"WL meet VC","volume-title":"Proc. 40th Int. Conf. Mach. Learn.","author":"Morris"},{"key":"ref37","article-title":"Distance-restricted folklore Weisfeiler-Leman GNNs with provable cycle counting power","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Zhou"},{"key":"ref38","first-page":"2561","article-title":"On the equivalence between positional node embeddings and structural graph representations","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Srinivasan"},{"key":"ref39","first-page":"5812","article-title":"Graph contrastive learning with augmentations","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"You"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403168"},{"key":"ref41","article-title":"Link prediction with non-contrastive learning","author":"Shiao","year":"2022"},{"key":"ref42","article-title":"Pairwise learning for neural link prediction","author":"Wang","year":"2021"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3383313.3412488"},{"key":"ref44","article-title":"Adaptive graph diffusion networks with hop-wise attention","author":"Sun","year":"2020"},{"key":"ref45","article-title":"Open graph benchmark: Datasets for machine learning on graphs","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Hu"},{"key":"ref46","first-page":"1","article-title":"Does your graph need a confidence boost? Convergent boosted smoothing on graphs with tabular node features","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Chen"},{"key":"ref47","first-page":"321","article-title":"Learning with local and global consistency","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Zhou"},{"key":"ref48","article-title":"BPR: Bayesian personalized ranking from implicit feedback","author":"Rendle","year":"2012"},{"key":"ref49","first-page":"21 997","article-title":"DropGNN: Random dropouts increase the expressiveness of graph neural networks","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Papp"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009953814988"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"ref52","first-page":"1","article-title":"Query-driven active surveying for collective classification","volume-title":"Proc. Mining Learn. Graphs","author":"Namata"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref54","first-page":"2787","article-title":"Translating embeddings for modeling multi-relational data","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Bordes"},{"key":"ref55","first-page":"2071","article-title":"Complex embeddings for simple link prediction","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Trouillon"},{"key":"ref56","article-title":"Embedding entities and relations for learning and inference in knowledge bases","author":"Yang","year":"2014"},{"key":"ref57","first-page":"5453","article-title":"Representation learning on graphs with jumping knowledge networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Xu"},{"key":"ref58","first-page":"1725","article-title":"Simple and deep graph convolutional networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Chen"},{"key":"ref59","first-page":"26 911","article-title":"Learning from counterfactual links for link prediction","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Zhao"},{"key":"ref60","first-page":"1","article-title":"Neural common neighbor with completion for link prediction","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Wang"},{"key":"ref61","article-title":"GIDN: A lightweight graph inception diffusion network for high-efficient link prediction","author":"Wang","year":"2022"},{"key":"ref62","first-page":"12 012","article-title":"Linkless link prediction via relational distillation","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Guo"},{"key":"ref63","first-page":"1","article-title":"Graph-less neural networks: Teaching old MLPs new tricks via distillation","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Zhang"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1561\/2200000050"},{"key":"ref65","volume-title":"Nonlinear Programming","author":"Bertsekas","year":"1999"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/69\/10786487\/10716808-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/69\/10786487\/10716808.pdf?arnumber=10716808","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T22:06:35Z","timestamp":1733954795000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10716808\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":65,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2024.3481015","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1]]}}}