Fair Benchmark for Unsupervised Node Representation Learning
Most machine-learning algorithms assume that instances are independent of each other. This does not hold for networked data. Node representation learning (NRL) aims to learn low-dimensional vectors to represent nodes in a network, such that all actionable patterns in topological structures and side...
Main Authors: | Zhihao Guo, Shengyuan Chen, Xiao Huang, Zhiqiang Qian, Chunsing Yu, Yan Xu, Fang Ding |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2022-10-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-4893/15/10/379 |
Similar Items
-
Assessing the effects of hyperparameters on knowledge graph embedding quality
by: Oliver Lloyd, et al.
Published: (2023-05-01) -
Unsupervised network embeddings with node identity awareness
by: Leonardo Gutiérrez-Gómez, et al.
Published: (2019-10-01) -
Attributed Graph Embedding with Random Walk Regularization and Centrality-Based Attention
by: Yuxuan Yang, et al.
Published: (2023-04-01) -
Unsupervised Graph Representation Learning with Inductive Shallow Node Embedding
by: Richárd Kiss, et al.
Published: (2024-07-01) -
Improving Link Prediction Accuracy of Network Embedding Algorithms via Rich Node Attribute Information
by: Weiwei Gu, et al.
Published: (2023-12-01)