Exploiting Weak Ties in Incomplete Network Datasets Using Simplified Graph Convolutional Neural Networks

2Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

This paper explores the value of weak-ties in classifying academic literature with the use of graph convolutional neural networks. Our experiments look at the results of treating weak-ties as if they were strong-ties to determine if that assumption improves performance. This is done by applying the methodological framework of the Simplified Graph Convolutional Neural Network (SGC) to two academic publication datasets: Cora and Citeseer. The performance of SGC is compared to the original Graph Convolutional Network (GCN) framework. We also examine how node removal affects prediction accuracy by selecting nodes according to different centrality measures. These experiments provide insight for which nodes are most important for the performance of SGC. When removal is based on a more localized selection of nodes, augmenting the network with both strong-ties and weak-ties provides a benefit, indicating that SGC successfully leverages local information of network nodes.

Cite

CITATION STYLE

APA

Bidoki, N. H., Mantzaris, A. V., & Sukthankar, G. (2020). Exploiting Weak Ties in Incomplete Network Datasets Using Simplified Graph Convolutional Neural Networks. Machine Learning and Knowledge Extraction, 2(2). https://doi.org/10.3390/make2020008

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free