Pith. sign in

REVIEW

NodeNet: A Graph Regularised Neural Network for Node Classification

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 2006.09022 v1 pith:UNL262PF submitted 2020-06-16 cs.SI cs.LGstat.AP

classification cs.SIcs.LGstat.AP
keywords datagraphlearninglinkagesnodenetclassificationgraph-basedleverage
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Real-world events exhibit a high degree of interdependence and connections, and hence data points generated also inherit the linkages. However, the majority of AI/ML techniques leave out the linkages among data points. The recent surge of interest in graph-based AI/ML techniques is aimed to leverage the linkages. Graph-based learning algorithms utilize the data and related information effectively to build superior models. Neural Graph Learning (NGL) is one such technique that utilizes a traditional machine learning algorithm with a modified loss function to leverage the edges in the graph structure. In this paper, we propose a model using NGL - NodeNet, to solve node classification task for citation graphs. We discuss our modifications and their relevance to the task. We further compare our results with the current state of the art and investigate reasons for the superior performance of NodeNet.

Discussion (0). Continue with ORCID to comment.

Pith tools