arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2301.11288cs.SIcs.LG
收藏

社交网络上顶点的多种分类方法

Classification of vertices on social networks by multiple approaches

Gachon University(嘉泉大学);Chungbuk National University(忠北国立大学);Instituto Superior de Engenharia do Porto(波尔图高等工程学院)

Hacı İsmail Aslan, Chang Choi, Hoon Ko

摘要:

由于表格格式以外的数据表达方式的出现,使得样本相互关联的拓扑组合变得突出。类似地,这些网络可以被解释为社会联系,网络图,引用影响图,蛋白质绑定等,然而,在社交网络的情况下,它是非常重要的离散社区的标签进行评估。这样的研究的原因是不可忽视的重要性,分析图网络划分的顶点通过使用网络图的拓扑特征,单独。对于这些基于交互的实体中的每一个,选择社交图、邮件数据集和两个引用集作为测试平台存储库。本文不仅评估了最有价值的方法,而且还确定了图神经网络的工作原理以及需要改进的非神经网络方法,这些方法更快,计算成本更低。同时,本文还利用所试网络的拓扑特征,给出了一个预测图神经网络变异的极限。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑