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

探索邻接矩阵中的有序模式以改进复杂网络上的机器学习

Exploring ordered patterns in the adjacency matrix for improving machine learning on complex networks

Institute of Physics of Sao Carlos(圣卡洛斯物理研究所);University of Sao Paulo(圣保罗大学)

Mariane B. Neiva, Odemir M. Bruno

摘要:

使用复杂网络作为理解世界及其动态的现代方法在文献中已经得到了很好的证实。邻接矩阵提供了复杂网络的一对一表示,也可以产生图的几个度量。然而,并不总是清楚这种表示是唯一的,因为矩阵中的行和行的排列可以表示相同的图。为了解决这个问题,所提出的方法采用排序算法重新排列的元素的邻接矩阵的复杂图在一个特定的顺序。然后将得到的排序邻接矩阵用作特征提取和机器学习算法的输入,以对网络进行分类。结果表明,所提出的方法优于以前的文献结果的合成和真实世界的数据。

英文摘要:

The use of complex networks as a modern approach to understanding the world and its dynamics is well-established in literature. The adjacency matrix, which provides a one-to-one representation of a complex network, can also yield several metrics of the graph. However, it is not always clear that this representation is unique, as the permutation of lines and rows in the matrix can represent the same graph. To address this issue, the proposed methodology employs a sorting algorithm to rearrange the elements of the adjacency matrix of a complex graph in a specific order. The resulting sorted adjacency matrix is then used as input for feature extraction and machine learning algorithms to classify the networks. The results indicate that the proposed methodology outperforms previous literature results on synthetic and real-world data.

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

↑