Pith. sign in

REVIEW 1 cited by

Topological based classification of paper domains using graph convolutional networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1904.07787 v1 pith:Z7LYQR3M submitted 2019-04-10 cs.SI cs.LGstat.ML

Topological based classification of paper domains using graph convolutional networks

classification cs.SI cs.LGstat.ML
keywords classificationinformationnodepropagationtopologicalclassapproachesassociation
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

The main approaches for node classification in graphs are information propagation and the association of the class of the node with external information. State of the art methods merge these approaches through Graph Convolutional Networks. We here use the association of topological features of the nodes with their class to predict this class. Moreover, combining topological information with information propagation improves classification accuracy on the standard CiteSeer and Cora paper classification task. Topological features and information propagation produce results almost as good as text-based classification, without no textual or content information. We propose to represent the topology and information propagation through a GCN with the neighboring training node classification as an input and the current node classification as output. Such a formalism outperforms state of the art methods.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Regional based query in graph active learning

    cs.LG 2019-06 unverdicted novelty 6.0

    Proposes regional uncertainty and page-rank extended query selection for active learning on graphs, claiming superiority over standard methods at different labeling densities.