Measuring Proximity in Attributed Networks for Community Detection

Abstract

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.

References in corpus (8)

• Community structure in social and biological networks
• Natural Scales in Geographical Patterns
• Analyzing and Modeling Real-World Phenomena with Complex Networks: A Survey of Applications
• Community Detection in Networks with Node Attributes
• Community detection in node-attributed social networks: a survey
• Developments in the theory of randomized shortest paths with a comparison of graph node distances
• The Walk Distances in Graphs
• Do logarithmic proximity measures outperform plain ones in graph clustering?