Classification of vertices on social networks by multiple approaches

Abstract

Due to the advent of the expressions of data other than tabular formats, the topological compositions which make samples interrelated came into prominence. Analogically, those networks can be interpreted as social connections, dataflow maps, citation influence graphs, protein bindings, etc. However, in the case of social networks, it is highly crucial to evaluate the labels of discrete communities. The reason underneath for such a study is the non-negligible importance of analyzing graph networks to partition the vertices by using the topological features of network graphs, solely. For each of these interaction-based entities, a social graph, a mailing dataset, and two citation sets are selected as the testbench repositories. This paper, it was not only assessed the most valuable method but also determined how graph neural networks work and the need to improve against non-neural network approaches which are faster and computationally cost-effective. Also, this paper showed a limit to be excesses by prospective graph neural network variations by using the topological features of networks trialed.

arXiv commentThis is a paper whose final and definite form is published open access by 'Mathematical Biosciences and Engineering' (ISSN: 1551-0018)

References in corpus (12)

• A Comprehensive Survey on Graph Neural Networks
• Cooperative Game Theory Approaches for Network Partitioning
• Geometric deep learning: going beyond Euclidean data
• Knowledge Graphs
• Molecular Graph Convolutions: Moving Beyond Fingerprints
• Simplifying Graph Convolutional Networks
• Predict then Propagate: Graph Neural Networks meet Personalized PageRank
• Estimating Node Importance in Knowledge Graphs Using Graph Neural Networks
• Deep Graph Infomax
• Graph Neural Networks in TensorFlow and Keras with Spektral
• A brief introduction to Spectral Graph Theory
• Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification?