{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,26]],"date-time":"2026-07-26T14:02:03Z","timestamp":1785074523669,"version":"3.55.0"},"reference-count":63,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Knowledge-Based Systems"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.knosys.2026.116482","type":"journal-article","created":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T15:21:08Z","timestamp":1782400868000},"page":"116482","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Learning-free continuous-attribute graph embedding via locality-sensitive hashing"],"prefix":"10.1016","volume":"349","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0975-4613","authenticated-orcid":false,"given":"Wei","family":"Wu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yan","family":"Peng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ling","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xuan","family":"Tan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiongrui","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhenzhong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7829-1539","authenticated-orcid":false,"given":"Fangfang","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chuan","family":"Luo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.knosys.2026.116482_b1","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2025.113522","article-title":"Radial adaptive node embedding hashing for cross-modal retrieval","volume":"319","author":"Chen","year":"2025","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.knosys.2026.116482_b2","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2024.112784","article-title":"Explainable next POI recommendation based on spatial-temporal disentanglement representation and pseudo profile generation","volume":"309","author":"Zeng","year":"2025","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.knosys.2026.116482_b3","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2025.113035","article-title":"Graph attention contrastive learning with missing modality for multimodal recommendation","volume":"311","author":"Zhao","year":"2025","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.knosys.2026.116482_b4","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2025.113657","article-title":"Decoupled signed link prediction method based on graph neural network","volume":"320","author":"Zhou","year":"2025","journal-title":"Knowl.-Based Syst."},{"issue":"9","key":"10.1016\/j.knosys.2026.116482_b5","first-page":"2539","article-title":"Weisfeiler-Lehman graph kernels","volume":"12","author":"Shervashidze","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"10.1016\/j.knosys.2026.116482_b6","series-title":"KDD","first-page":"1365","article-title":"Deep graph kernels","author":"Yanardag","year":"2015"},{"issue":"5","key":"10.1016\/j.knosys.2026.116482_b7","doi-asserted-by":"crossref","first-page":"936","DOI":"10.1109\/TKDE.2017.2782278","article-title":"K-ary tree hashing for fast graph classification","volume":"30","author":"Wu","year":"2018","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"5","key":"10.1016\/j.knosys.2026.116482_b8","doi-asserted-by":"crossref","first-page":"1591","DOI":"10.1109\/TCYB.2017.2708979","article-title":"Hashing for adaptive real-time graph stream classification with concept drifts","volume":"48","author":"Chi","year":"2018","journal-title":"IEEE Trans. Cybern."},{"issue":"6","key":"10.1016\/j.knosys.2026.116482_b9","doi-asserted-by":"crossref","first-page":"3599","DOI":"10.1109\/TCYB.2022.3159661","article-title":"A novel representation learning for dynamic graphs based on graph convolutional networks","volume":"53","author":"Gao","year":"2023","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.knosys.2026.116482_b10","series-title":"ICML","first-page":"321","article-title":"Marginalized kernels between labeled graphs","author":"Kashima","year":"2003"},{"key":"10.1016\/j.knosys.2026.116482_b11","series-title":"ICDM","article-title":"Shortest-path kernels on graphs","author":"Borgwardt","year":"2005"},{"key":"10.1016\/j.knosys.2026.116482_b12","series-title":"ICDM","first-page":"721","article-title":"gSpan: Graph-based substructure pattern mining","author":"Yan","year":"2002"},{"key":"10.1016\/j.knosys.2026.116482_b13","series-title":"NeurIPS","first-page":"1","article-title":"A graph similarity for deep learning","author":"Ok","year":"2020"},{"key":"10.1016\/j.knosys.2026.116482_b14","series-title":"ICML","first-page":"24737","article-title":"Path neural networks: Expressive and accurate graph neural networks","author":"Michel","year":"2023"},{"key":"10.1016\/j.knosys.2026.116482_b15","series-title":"NeurIPS","first-page":"4776","article-title":"How powerful are K-hop message passing graph neural networks","author":"Feng","year":"2022"},{"key":"10.1016\/j.knosys.2026.116482_b16","series-title":"ICLR","article-title":"Graph attention networks","author":"Veli\u010dkovi\u0107","year":"2018"},{"key":"10.1016\/j.knosys.2026.116482_b17","series-title":"ICLR","article-title":"Semi-supervised classification with graph convolutional networks","author":"Kipf","year":"2017"},{"key":"10.1016\/j.knosys.2026.116482_b18","series-title":"NIPS","first-page":"1024","article-title":"Inductive representation learning on large graphs","author":"Hamilton","year":"2017"},{"key":"10.1016\/j.knosys.2026.116482_b19","series-title":"STOC","first-page":"604","article-title":"Approximate nearest neighbors: towards removing the curse of dimensionality","author":"Indyk","year":"1998"},{"key":"10.1016\/j.knosys.2026.116482_b20","series-title":"SDM","first-page":"652","article-title":"On classification of graph streams","author":"Aggarwal","year":"2011"},{"key":"10.1016\/j.knosys.2026.116482_b21","series-title":"ICDM","first-page":"399","article-title":"Nested subtree hash kernels for large-scale graph classification over streams","author":"Li","year":"2012"},{"key":"10.1016\/j.knosys.2026.116482_b22","series-title":"NeurIPS","article-title":"Beyond node-centric modeling: Sketching signed networks with simplicial complexes","author":"Wu","year":"2025"},{"key":"10.1016\/j.knosys.2026.116482_b23","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/s10994-015-5517-9","article-title":"Propagation kernels: Efficient graph kernels from propagated information","volume":"102","author":"Neumann","year":"2016","journal-title":"Mach. Learn."},{"key":"10.1016\/j.knosys.2026.116482_b24","series-title":"ICDM","first-page":"1095","article-title":"Faster kernels for graphs with continuous attributes via hashing","author":"Morris","year":"2016"},{"key":"10.1016\/j.knosys.2026.116482_b25","series-title":"SIGIR","first-page":"1609","article-title":"SCHash: Speedy simplicial complex neural networks via randomized hashing","author":"Tan","year":"2023"},{"key":"10.1016\/j.knosys.2026.116482_b26","series-title":"NIPS","first-page":"1753","article-title":"Spectral hashing","author":"Weiss","year":"2009"},{"issue":"7","key":"10.1016\/j.knosys.2026.116482_b27","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1016\/j.ijar.2008.11.006","article-title":"Semantic hashing","volume":"50","author":"Salakhutdinov","year":"2009","journal-title":"Internat. J. Approx. Reason."},{"key":"10.1016\/j.knosys.2026.116482_b28","series-title":"STOC","first-page":"327","article-title":"Min-wise independent permutations","author":"Broder","year":"1998"},{"key":"10.1016\/j.knosys.2026.116482_b29","series-title":"STOC","first-page":"380","article-title":"Similarity estimation techniques from rounding algorithms","author":"Charikar","year":"2002"},{"key":"10.1016\/j.knosys.2026.116482_b30","series-title":"NIPS","first-page":"3419","article-title":"Discrete graph hashing","author":"Liu","year":"2014"},{"key":"10.1016\/j.knosys.2026.116482_b31","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2023.109462","article-title":"Deep collaborative graph hashing for discriminative image retrieval","volume":"139","author":"Zhang","year":"2023","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.knosys.2026.116482_b32","series-title":"KDD","first-page":"2062","article-title":"GHashing: Semantic graph hashing for approximate similarity search in graph databases","author":"Qin","year":"2020"},{"key":"10.1016\/j.knosys.2026.116482_b33","series-title":"WWW","first-page":"2946","article-title":"Massive text normalization via an efficient randomized algorithm","author":"Jiang","year":"2022"},{"key":"10.1016\/j.knosys.2026.116482_b34","series-title":"STOC","first-page":"1116","article-title":"Edge sampling and graph parameter estimation via vertex neighborhood accesses","author":"T\u011btek","year":"2022"},{"key":"10.1016\/j.knosys.2026.116482_b35","series-title":"KDD","first-page":"1744","article-title":"High-order proximity preserving information network hashing","author":"Lian","year":"2018"},{"key":"10.1016\/j.knosys.2026.116482_b36","series-title":"KDD","first-page":"4391","article-title":"Embedding compression with hashing for efficient representation learning in large-scale graph","author":"Yeh","year":"2022"},{"key":"10.1016\/j.knosys.2026.116482_b37","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2022.109236","article-title":"Compact network embedding for fast node classification","volume":"136","author":"Shen","year":"2023","journal-title":"Pattern Recognit."},{"issue":"5","key":"10.1016\/j.knosys.2026.116482_b38","doi-asserted-by":"crossref","first-page":"2941","DOI":"10.1109\/TCYB.2023.3243763","article-title":"MPSketch: Message passing networks via randomized hashing for efficient attributed network embedding","volume":"54","author":"Wu","year":"2024","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.knosys.2026.116482_b39","series-title":"WWW","first-page":"2910","article-title":"Hashing-accelerated graph neural networks for link prediction","author":"Wu","year":"2021"},{"key":"10.1016\/j.knosys.2026.116482_b40","series-title":"KDD","first-page":"1162","article-title":"NodeSketch: Highly-efficient graph embeddings via recursive sketching","author":"Yang","year":"2019"},{"issue":"11","key":"10.1016\/j.knosys.2026.116482_b41","first-page":"2615","article-title":"Hash kernels for structured data.","volume":"10","author":"Shi","year":"2009","journal-title":"J. Mach. Learn. Res."},{"key":"10.1016\/j.knosys.2026.116482_b42","series-title":"NeurIPS","first-page":"6436","article-title":"Wasserstein Weisfeiler-Lehman graph kernels","author":"Togninalli","year":"2019"},{"issue":"7","key":"10.1016\/j.knosys.2026.116482_b43","first-page":"3270","article-title":"Tree-based kernel for graphs with continuous attributes","volume":"29","author":"Da San Martino","year":"2017","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"10.1016\/j.knosys.2026.116482_b44","series-title":"SDM","first-page":"975","article-title":"A tree-based kernel for graphs","author":"Da San Martino","year":"2012"},{"key":"10.1016\/j.knosys.2026.116482_b45","series-title":"ICLR","article-title":"How powerful are graph neural networks?","author":"Xu","year":"2019"},{"issue":"1","key":"10.1016\/j.knosys.2026.116482_b46","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1109\/TPAMI.2022.3154319","article-title":"Improving graph neural network expressivity via subgraph isomorphism counting","volume":"45","author":"Bouritsas","year":"2022","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.knosys.2026.116482_b47","series-title":"SIGIR","first-page":"1211","article-title":"Learning to transfer graph embeddings for inductive graph based recommendation","author":"Wu","year":"2020"},{"key":"10.1016\/j.knosys.2026.116482_b48","doi-asserted-by":"crossref","DOI":"10.1016\/j.neunet.2024.106830","article-title":"Node classification in the heterophilic regime via diffusion-jump GNNs","volume":"181","author":"Begga","year":"2025","journal-title":"Neural Netw."},{"key":"10.1016\/j.knosys.2026.116482_b49","doi-asserted-by":"crossref","DOI":"10.1016\/j.inffus.2025.103186","article-title":"Leveraging long-range nodes in multi-view graph contrastive learning","volume":"122","author":"He","year":"2025","journal-title":"Inf. Fusion"},{"key":"10.1016\/j.knosys.2026.116482_b50","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2025.113112","article-title":"Cross-domain recommendation via knowledge distillation","volume":"311","author":"Li","year":"2025","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.knosys.2026.116482_b51","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2025.113766","article-title":"Noise-enhanced graph contrastive learning for multimodal recommendation systems","volume":"324","author":"Shi","year":"2025","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.knosys.2026.116482_b52","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1098\/rsta.1909.0016","article-title":"Functions of positive and negative type and their connection with the theory of integral equations","volume":"209","author":"Mercer","year":"1909","journal-title":"Philos. Trans. R. Soc. Lond."},{"issue":"301","key":"10.1016\/j.knosys.2026.116482_b53","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","article-title":"Probability inequalities for sums of bounded random variables","volume":"58","author":"Hoeffding","year":"1963","journal-title":"J. Amer. Statist. Assoc."},{"key":"10.1016\/j.knosys.2026.116482_b54","series-title":"AAAI","first-page":"4602","article-title":"Weisfeiler and leman go neural: Higher-order graph neural networks","author":"Morris","year":"2019"},{"issue":"9","key":"10.1016\/j.knosys.2026.116482_b55","first-page":"12","article-title":"A reduction of a graph to a canonical form and an algebra arising during this reduction","volume":"2","author":"Weisfeiler","year":"1968","journal-title":"Nauchno-Technicheskaya Informatsia"},{"key":"10.1016\/j.knosys.2026.116482_b56","series-title":"Benchmark data sets for graph kernels","author":"Kersting","year":"2016"},{"key":"10.1016\/j.knosys.2026.116482_b57","series-title":"ICML","first-page":"10362","article-title":"Score-based generative modeling of graphs via the system of stochastic differential equations","author":"Jo","year":"2022"},{"key":"10.1016\/j.knosys.2026.116482_b58","series-title":"ICDM","first-page":"797","article-title":"Towards expressive graph representations for graph neural networks","author":"Mao","year":"2024"},{"key":"10.1016\/j.knosys.2026.116482_b59","series-title":"AAAI","first-page":"19995","article-title":"DHAKR: learning deep hierarchical attention-based kernelized representations for graph classification","author":"Qian","year":"2025"},{"key":"10.1016\/j.knosys.2026.116482_b60","series-title":"Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence","first-page":"3254","article-title":"DHTAGK: deep hierarchical transitive-aligned graph kernels for graph classification","author":"Qin","year":"2025"},{"key":"10.1016\/j.knosys.2026.116482_b61","series-title":"NeurIPS","article-title":"Interpretable and parameter efficient graph neural additive models with random Fourier features","author":"Reddy","year":"2025"},{"key":"10.1016\/j.knosys.2026.116482_b62","series-title":"SIGIR","first-page":"665","article-title":"Interpretable graph similarity computation via differentiable optimal alignment of node embeddings","author":"Doan","year":"2021"},{"key":"10.1016\/j.knosys.2026.116482_b63","series-title":"KDD","first-page":"1225","article-title":"Structural deep network embedding","author":"Wang","year":"2016"}],"container-title":["Knowledge-Based Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705126012086?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705126012086?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,26]],"date-time":"2026-07-26T13:29:14Z","timestamp":1785072554000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0950705126012086"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":63,"alternative-id":["S0950705126012086"],"URL":"https:\/\/doi.org\/10.1016\/j.knosys.2026.116482","relation":{},"ISSN":["0950-7051"],"issn-type":[{"value":"0950-7051","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Learning-free continuous-attribute graph embedding via locality-sensitive hashing","name":"articletitle","label":"Article Title"},{"value":"Knowledge-Based Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.knosys.2026.116482","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"116482"}}