复杂网络分类问题的低秩表示
Low-Rank Representations Towards Classification Problem of Complex Networks
摘要:
复杂网络表征了社会互动、大脑活动、分子结构等,人们对复杂网络进行了广泛的研究,以便能够以图形的形式来理解和预测它们的特性。这些网络的模型和算法用于现实生活中的应用,如搜索引擎和推荐系统。一般来说,这种网络是通过构建网络顶点的低维欧几里得嵌入来建模的,其中欧几里得空间中顶点的接近度暗示了边(链接)的可能性。在这项工作中,我们研究了这种低秩表示的现实生活中的网络分类问题的性能。
英文摘要:
Complex networks representing social interactions, brain activities, molecular structures have been studied widely to be able to understand and predict their characteristics as graphs. Models and algorithms for these networks are used in real-life applications, such as search engines, and recommender systems. In general, such networks are modelled by constructing a low-dimensional Euclidean embedding of the vertices of the network, where proximity of the vertices in the Euclidean space hints the likelihood of an edge (link). In this work, we study the performance of such low-rank representations of real-life networks on a network classification problem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。