arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2111.03089cs.SIcs.LG
收藏

属性网络中用于社区发现的邻近性度量

Measuring Proximity in Attributed Networks for Community Detection

Moscow Institute of Physics and Technology(莫斯科物理技术学院);Trapeznikov Institute of Control Sciences of the Russian Academy of Sciences(俄罗斯科学院特拉佩兹尼科夫控制科学研究所);Kotel’nikov Institute of Radio-engineering and Electronics (IRE) of the Russian Academy of Sciences(俄罗斯科学院科捷利尼科夫无线电工程与电子研究所(IRE))

Rinat Aynulin, Pavel Chebotarev

摘要:

图上的邻近性度量在网络分析中有各种应用,包括社区发现。以前,它们主要是在没有属性的网络背景下研究的。然而,如果考虑节点属性,这可以提供对网络结构的更多了解。在本文中,我们扩展了一些研究的邻近性措施的定义属性网络。为了说明属性,使用几种属性相似性度量。最后,得到的邻近性措施,在一些现实世界的网络使用谱聚类算法检测社区结构。

英文摘要:

Proximity measures on graphs have a variety of applications in network analysis, including community detection. Previously they have been mainly studied in the context of networks without attributes. If node attributes are taken into account, however, this can provide more insight into the network structure. In this paper, we extend the definition of some well-studied proximity measures to attributed networks. To account for attributes, several attribute similarity measures are used. Finally, the obtained proximity measures are applied to detect the community structure in some real-world networks using the spectral clustering algorithm.

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

↑