Classification of vertices on social networks by multiple approaches

Abstract

<abstract><p>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 for such a study is the importance of analyzing graph networks to partition the vertices by only using the topological features of network graphs. For each interaction-based entity, a social graph, a mailing dataset, and two citation sets are selected as the testbench repositories. The research mainly focused on evaluating the significance of three artificial intelligence approaches on four different datasets consisting of vertices and edges. Overall, one of these methods so-called "harmonic functions", resulted in the best form to classify those constituents of graph-shaped datasets. This research not only accessed 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 in this paper, we will show that there is a limit to be accessed by prospective graph neural network variations by using the topological features of trialed networks.</p></abstract>