.png){kind=icon}
Return
Het-node2vec: second-order random walk sampling for heterogeneous graph embedding
.png){kind=icon}
OA
AI
DOI：10.1038/s41598-026-66012-3.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Many real-world problems are naturally modeled as heterogeneous graphs, where nodes and edges represent multiple types of entities and relations. Existing learning models for heterogeneous graph representation usually depend on the computation of specific, user-defined heterogeneous paths, or on the application of large, and often non-scalable, deep neural network architectures. We propose Het, an extension of the ntv algorithm, designed to embed heterogeneous graphs by capturing the topological and structural characteristics of the graph and the semantic information underlying the different types of nodes and edges; this is performed by introducing a simple stochastic node-type switching strategy in second-order random walk processes. Empirical results on synthetic graphs, as well as on benchmark and real-world biomedical graphs, show that Het achieves comparable performance with respect to state-of-the-art methods for heterogeneous graphs in node label prediction tasks.
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.9
Papers:
28.3W
Citations:
83.5W
Organization
View more organizations
Cited Papers
No cited papers available