Spatial-Aware Local Community Detection Guided by Dominance Relation

Abstract

The problem of finding the spatial-aware community for a given node has been defined and investigated in geosocial networks. However, existing studies suffer from two limitations: 1) the criteria of defining communities are determined by parameters, which are difficult to set, and 2) algorithms may require global information and are not suitable for situations where the network is incomplete. Therefore, we propose spatial-aware local community detection (SLCD), which finds the spatial-aware local community with only local information and defines the community based on the difference in terms of the sparseness of edges inside and outside the community. Specifically, to address the SLCD problem, we design a novel spatial aware local community detection algorithm based on dominance relation, but this algorithm incurs high cost. To further improve the efficiency, we propose a greedy algorithm. Experimental results demonstrate that the proposed greedy algorithm outperforms the comparison algorithms.