##
###
Node Centralities and Classification Performance for Characterizing Node Embedding Algorithms
[article]

Kento Nozawa, Masanari Kimura, Atsunori Kanemura

2018
*
arXiv
*
pre-print

*or* *five* *graph* centralities, and six datasets. ...
We examine the performance of node *embedding* algorithms with respect to *graph* centrality measures that characterize diverse *graphs*, through systematic experiments with four node *embedding* algorithms, four ...
The *embedding* dimensionality d was either 128 *or* 256. Whether to normalize *or* not to normalize *embeddings* before passing them to a classifier. ...

arXiv:1802.06368v1
fatcat:fx2zftyawzep3isknn4bralih4