• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
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

Funds: This work was supported by the National Natural Science Foundation of China (61762078, 61363058,61966004), the Research Fund of Guangxi Key Laboratory of Multi-Source Information Mining & Security (MIMS18-08), and the Research Fund of Northwest Normal University Young Teachers Research Capacity Promotion Plan (NWNU-LKQN2019-2).
More Information
  • Published Date: December 31, 2020
  • 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.
  • Related Articles

    [1]Guo Yuhan, Liu Yongwu. Bimodal Cooperative Matching Algorithm for the Dynamic Ride-Sharing Problem[J]. Journal of Computer Research and Development, 2022, 59(7): 1533-1552. DOI: 10.7544/issn1000-1239.20210373
    [2]Jin Pengfei, Chang Xueqin, Fang Ziquan, Li Miao. Location-Aware Joint Influence Maximizaton in Geo-Social Networks Using Multi-Target Combinational Optimization[J]. Journal of Computer Research and Development, 2022, 59(2): 294-309. DOI: 10.7544/issn1000-1239.20210891
    [3]Yu Runlong, Zhao Hongke, Wang Zhong, Ye Yuyang, Zhang Peining, Liu Qi, Chen Enhong. Negatively Correlated Search with Asymmetry for Real-Parameter Optimization Problems[J]. Journal of Computer Research and Development, 2019, 56(8): 1746-1757. DOI: 10.7544/issn1000-1239.2019.20190198
    [4]Fu Yiqi, Dong Wei, Yin Liangze, Du Yuqing. Software Defect Prediction Model Based on the Combination of Machine Learning Algorithms[J]. Journal of Computer Research and Development, 2017, 54(3): 633-641. DOI: 10.7544/issn1000-1239.2017.20151052
    [5]Wang Bin. A Discrete Particle Swarm Optimization-based Algorithm for Polygonal Approximation of Digital Curves[J]. Journal of Computer Research and Development, 2010, 47(11): 1886-1892.
    [6]Fan Xiaoqin, Jiang Changjun, Fang Xianwen, Ding Zhijun. Dynamic Web Service Selection Based on Discrete Particle Swarm Optimization[J]. Journal of Computer Research and Development, 2010, 47(1): 147-156.
    [7]Li Xin, Huang Xuanjing, and Wu Lide. Combined Multiple Classifiers Based on TBL Algorithm and Their Application in Question Classification[J]. Journal of Computer Research and Development, 2008, 45(3): 535-541.
    [8]Li Heng, Zhu Jingbo, and Yao Tianshun. Combined Multiple Classifiers Based on a Stacking Algorithm and Their Application to Chinese Text Chunking[J]. Journal of Computer Research and Development, 2005, 42(5): 844-848.
    [9]Zeng Liping and Huang Wenqi. A New Local Search Algorithm for the Job Shop Scheduling Problem[J]. Journal of Computer Research and Development, 2005, 42(4): 582-587.
    [10]Zhao Wenbo, Wang Liming, Huang Deshuang. Structure Optimization of Radial Basis Probabilistic Neural Networks by the Maximum Absolute Error Combined with the Micro-Genetic Algorithm[J]. Journal of Computer Research and Development, 2005, 42(2): 179-187.
  • Cited by

    Periodical cited type(3)

    1. 黄阳,周旭,杨志邦,余婷,张吉,曾源远,李肯立. 基于缓存的时变道路网最短路径查询算法. 计算机研究与发展. 2022(02): 376-389 . 本站查看
    2. 李永刚. 基于云计算的数据信息加密安全存储仿真研究. 电子设计工程. 2021(11): 132-135 .
    3. 刘铎,杨涓,谭玉娟. 边缘存储的发展现状与挑战. 中兴通讯技术. 2019(03): 15-22 .

    Other cited types(7)

Catalog

    Article views (919) PDF downloads (579) Cited by(10)

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return