Detecting semantic‐based communities in node‐attributed graphs

Abstract

In social network analysis, community detection on plain graphs has been widely studied. With the proliferation of available data, each user in the network is usually associated with additional attributes for elaborate description. However, many existing methods only concentrate on the topological structure and fail to deal with node-attributed networks. These approaches are incapable of extracting clear semantic meanings for communities detected. In this paper, we combine the topological structure and attribute information into a unified process and propose a novel algorithm to detect overlapping semantic communities. Moreover, a new metric is designed to measure the density of semantic communities. The proposed algorithm is divided into 3 phases. First, we detect local semantic subcommunities from each node's perspective using a greedy strategy on the metric. Then, a supergraph, which consists of all these subcommunities is created. Finally, we find global semantic communities on the supergraph. The experimental results on real-world data sets show the efficiency and effectiveness of our approach against other state-of-the-art methods.

Mining communities and their descriptions on attributed graphs: a survey

“…OSCom Starting from ego-networks, Du et al ( 2017), Sun et al (2018) apply a metric-based greedy strategy for detecting a set of subnetworks based on the respective attributed neighborhood, i.e. the common attributes.…”

Data-driven Product Functional Configuration: Patent Data and Hypergraph

“…Some studies were performed by subgraphs formed from a subset of the vertices of a graph and all the edges connecting pairs of vertices in the subset. Lee the overlapping situation of different communities as a basis for judging technology integration [41].…”