Heterogeneous Network Embedding Based on Random Walks of Type and Inner Constraint
In heterogeneous networks, random walks based on meta-paths require prior knowledge and lack flexibility. On the other hand, random walks based on non-meta-paths only consider the number of node types, but not the influence of schema and topology between node types in real networks. To solve these p...
Main Authors: | Xiao Chen, Tong Hao, Li Han, Meng Leng, Jing Chen, Jingfeng Guo |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2022-07-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/10/15/2623 |
Similar Items
-
HeteEdgeWalk: A Heterogeneous Edge Memory Random Walk for Heterogeneous Information Network Embedding
by: Zhenpeng Liu, et al.
Published: (2023-06-01) -
Recommendation Model Based on a Heterogeneous Personalized Spacey Embedding Method
by: Qunsheng Ruan, et al.
Published: (2021-02-01) -
REHREC: Review Effected Heterogeneous Information Network Recommendation System
by: Farhad Khalilzadeh, et al.
Published: (2024-01-01) -
Graph Embedding Framework Based on Adversarial and Random Walk Regularization
by: Wei Dou, et al.
Published: (2021-01-01) -
CoarSAS2hvec: Heterogeneous Information Network Embedding with Balanced Network Sampling
by: Ling Zhan, et al.
Published: (2022-02-01)