A spectral-based GCN for directed graphs uses redefined Laplacians to enable direct application to directed data and outperforms prior methods on semi-supervised node classification tasks.
Convolution theorem — Wikipedia, the free encyclopedia, 2019
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Spectral-based Graph Convolutional Network for Directed Graphs
A spectral-based GCN for directed graphs uses redefined Laplacians to enable direct application to directed data and outperforms prior methods on semi-supervised node classification tasks.