Advanced Search
    Liu Haijiao, Ma Huifang, Zhao Qiqi, Li Zhixin. Target Community Detection with User Interest Preferences and Influence[J]. Journal of Computer Research and Development, 2021, 58(1): 70-82. DOI: 10.7544/issn1000-1239.2021.20190775
    Citation: Liu Haijiao, Ma Huifang, Zhao Qiqi, Li Zhixin. Target Community Detection with User Interest Preferences and Influence[J]. Journal of Computer Research and Development, 2021, 58(1): 70-82. DOI: 10.7544/issn1000-1239.2021.20190775

    Target Community Detection with User Interest Preferences and Influence

    • Target community detection is to find the cohesive communities consistent with user’s preference. However, all the existing works either largely ignore the outer influence of the communities, or not “target-based”, i.e., they are not suitable for a target request. To solve the above problems, in this paper, the target community detection with user interest preferences and influence (TCPI) is proposed to locate the most influential and high-quality community related to user’s preference. Firstly, the node structure and attribute information are synthesized, and maximum k-cliques containing sample nodes are investigated as the core of the potential target community, and an entropy weighted attribute weight calculation method is designed to capture the attribute subspace weight of the potential target community. Secondly, the internal compactness and the external separability of the community is defined as the community quality function and the high-quality potential target community is expanded with each of the maximum k-cliques as the core. Finally, the external impact score of the community is defined, and all potential target communities are ranked according to the quality function and the external impact score of the community, and the communities with higher comprehensive quality are decided as the target communities. In addition, a pruning strategy of two-level is designed to improve the performance and efficiency of the algorithm after calculating the attribute subspace weights of all maximal k-cliques. Experimental results on synthetic networks and real-world network datasets verify the efficiency and effectiveness of the proposed method.
    • loading

    Catalog

      Turn off MathJax
      Article Contents

      /

      DownLoad:  Full-Size Img  PowerPoint
      Return
      Return