• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Wang Haiyan, Xiao Yikang. Dynamic Group Discovery Based on Density Peaks Clustering[J]. Journal of Computer Research and Development, 2018, 55(2): 391-399. DOI: 10.7544/issn1000-1239.2018.20160928
Citation: Wang Haiyan, Xiao Yikang. Dynamic Group Discovery Based on Density Peaks Clustering[J]. Journal of Computer Research and Development, 2018, 55(2): 391-399. DOI: 10.7544/issn1000-1239.2018.20160928

Dynamic Group Discovery Based on Density Peaks Clustering

More Information
  • Published Date: January 31, 2018
  • Group recommendation has recently received wide attention due to its significance in real applications. As a premier step of group recommendation, group discovery is very important and discovery results will impact a lot on the performance of group recommendation. The higher similarity the groups have, the better effectiveness and stability the recommendation results will possess. However, current group discovery methods seldom consider the dynamicity of users’ tendency with variance of time context, nor do they support the existence of groups overlapping. In order to address the problems above, a dynamic group discovery method based on density peaks clustering (DGD-BDPC) is put forward in this paper. In the proposed DGD-BDPC method, quantitative users’ dynamic tendency is firstly obtained by dynamic poisson factorization. And secondly, users’ tendency under different time nodes for various items will be predicted with the employment of high order singular value decomposition (HOSVD) and user sets with high similarity will then be built according to users’ tendency. Finally, user sets will be clustered with a modification of density peaks clustering algorithm and group discovery will be realized successfully. Experimental results show that the proposed dynamic group discovery method based on density peaks clustering has higher accuracy, lower error and better stability compared with some other methods.
  • Related Articles

    [1]Wang Houzhen, Qin Wanying, Liu Qin, Yu Chunwu, Shen Zhidong. Identity Based Group Key Distribution Scheme[J]. Journal of Computer Research and Development, 2023, 60(10): 2203-2217. DOI: 10.7544/issn1000-1239.202330457
    [2]Chen Yewang, Shen Lianlian, Zhong Caiming, Wang Tian, Chen Yi, Du Jixiang. Survey on Density Peak Clustering Algorithm[J]. Journal of Computer Research and Development, 2020, 57(2): 378-394. DOI: 10.7544/issn1000-1239.2020.20190104
    [3]Zhang Qikun, Gan Yong, Wang Ruifang, Zheng Jiamin, Tan Yu’an. Inter-Cluster Asymmetric Group Key Agreement[J]. Journal of Computer Research and Development, 2018, 55(12): 2651-2663. DOI: 10.7544/issn1000-1239.2018.20170651
    [4]Xu Xiao, Ding Shifei, Sun Tongfeng, Liao Hongmei. Large-Scale Density Peaks Clustering Algorithm Based on Grid Screening[J]. Journal of Computer Research and Development, 2018, 55(11): 2419-2429. DOI: 10.7544/issn1000-1239.2018.20170227
    [5]Wang Haiyan, Dong Maowei. Latent Group Recommendation Based on Dynamic Probabilistic Matrix Factorization Model Integrated with CNN[J]. Journal of Computer Research and Development, 2017, 54(8): 1853-1863. DOI: 10.7544/issn1000-1239.2017.20170344
    [6]Gong Shufeng, Zhang Yanfeng. EDDPC: An Efficient Distributed Density Peaks Clustering Algorithm[J]. Journal of Computer Research and Development, 2016, 53(6): 1400-1409. DOI: 10.7544/issn1000-1239.2016.20150616
    [7]Zhang Qikun, Wang Ruifang, Tan Yu'an. Identity-Based Authenticated Asymmetric Group Key Agreement[J]. Journal of Computer Research and Development, 2014, 51(8): 1727-1738. DOI: 10.7544/issn1000-1239.2014.20121165
    [8]Zhu Mu, Meng Fanrong, and Zhou Yong. Density-Based Link Clustering Algorithm for Overlapping Community Detection[J]. Journal of Computer Research and Development, 2013, 50(12): 2520-2530.
    [9]Wang Feng, Zhou Yousheng, Gu Lize, Yang Yixian. A Multi-Policies Threshold Signature Scheme with Group Verifiability[J]. Journal of Computer Research and Development, 2012, 49(3): 499-505.
    [10]Cao Jia, Lu Shiwen. Research on Topology Discovery in the Overlay Multicast[J]. Journal of Computer Research and Development, 2006, 43(5): 784-790.
  • Cited by

    Periodical cited type(7)

    1. 毛伊敏,甘德瑾,廖列法,陈志刚. 基于Spark框架和ASPSO的并行划分聚类算法. 通信学报. 2022(03): 148-163 .
    2. 王永贵,林佳敏,何佳玉. 融合领导者影响与隐式信任度的群组推荐方法. 计算机工程与应用. 2022(09): 98-106 .
    3. 刘鑫,梅红岩,王嘉豪,李晓会. 图神经网络推荐方法研究. 计算机工程与应用. 2022(10): 41-49 .
    4. 刘聪,谢莉,杨慧中. 基于改进DPC的青霉素发酵过程多模型软测量建模. 化工学报. 2021(03): 1606-1615 .
    5. 刘功民,朱俊杰. WSN中利用双重接收器结合自适应加权数据融合的簇首优化聚类算法. 计算机应用与软件. 2021(05): 145-151 .
    6. 任昌鸿,安军. 改进PSO结合DSA技术的无线传感器网络均衡密度聚类方法. 计算机应用与软件. 2020(08): 122-129 .
    7. 许晓明,梅红岩,于恒,李晓会. 基于偏好融合的群组推荐方法研究综述. 小型微型计算机系统. 2020(12): 2500-2508 .

    Other cited types(13)

Catalog

    Article views (1239) PDF downloads (536) Cited by(20)

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return