arrow
返回

A deeper look at Graph Embedding RetroFitting

delete2023-04-01
delete1
PRE
AI
P
Piotr Bielak
J
Jakub Binkowski
A
Albert Sawczyn
K
Katsiaryna Viarenich
T
Tomasz Kajdanowicz *
DOI:10.1016/j.jocs.2023.101979delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Representation learning for graphs has attracted increasing attention in recent years. In particular, this work is focused on a new problem in this realm which is learning attributed graph embeddings. The setting considers how to update existing node representations from structural graph embedding methods when some additional node attributes are given. Recently, Graph Embedding RetroFitting (GERF) Bielak et al. was proposed to this end - a method that delivers a compound node embedding that follows both the graph structure and attribute space similarity. It uses existing structural node embeddings and retrofits them according to the neighborhood defined by the node attributes space (by optimizing the invariance loss and the attribute neighbor loss). In order to refine GERF method, we aim to include the simplification of the objective function and provide an algorithm for automatic hyperparameter estimation, whereas the experimental scenario is extended by a more robust hyperparameter search for all considered methods and a link prediction problem for evaluation of node embeddings.
Keyword:
Graph embedding
Attributed graphs
Retrofitting

期刊

Nature Computational Science 封面图
Nature Computational Science
IF:
18.3
论文数:
3.1K
被引数:
4.0K

机构

W
wroclaw university of science & technology
学者数:
7.4K
论文数: 7.1K
被引数: 2
引用论文

引用论文

Insurance activity and economic performance: Fresh evidence from asymmetric panel causality tests
err2018-10-24
err0
errOAAI
errAbdulnasser Hatemi‐J; Chi‐Chuan Lee; Chien‐Chiang Lee; Rangan Gupta
err分享
err收藏
err分享
err收藏
FILDNE: A Framework for Incremental Learning of Dynamic Networks Embeddings
err2022-01-01
err12
errOAAI
errBielak, Piotr; Tagowski, Kamil; Falkiewicz, Maciej; Kajdanowicz, Tomasz; Chawla, Nitesh V.
err分享
err收藏
没有更多内容