A heterogeneous network embedding method that transforms graphs via motifs and learns node vectors from random walks and skip-gram reports gains over baselines on three of four tasks.
HARP: hierarchical representation learning for networks
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SI 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
motif2vec: Motif Aware Node Representation Learning for Heterogeneous Networks
A heterogeneous network embedding method that transforms graphs via motifs and learns node vectors from random walks and skip-gram reports gains over baselines on three of four tasks.