• 中国精品科技期刊
  • 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]Zhou Peng, Zuo Zhiqiang. Design and Implementation of a Parallel Symbolic Execution Engine Based on Multi-Threading[J]. Journal of Computer Research and Development, 2023, 60(2): 248-261. DOI: 10.7544/issn1000-1239.202220920
    [2]Tian Zhenzhou, Wang Ningning, Wang Qing, Gao Cong, Liu Ting, Zheng Qinghua. Plagiarism Detection of Multi-Threaded Programs by Mining Behavioral motifs[J]. Journal of Computer Research and Development, 2020, 57(1): 202-213. DOI: 10.7544/issn1000-1239.2020.20180871
    [3]Wang Bohong, Liu Yi, Zhang Guozhen, Qian Depei. Debugging Multi-Core Parallel Programs by Gradually Refined Snapshot Sequences[J]. Journal of Computer Research and Development, 2017, 54(4): 821-831. DOI: 10.7544/issn1000-1239.2017.20151060
    [4]Gao Ke, Fan Dongrui, Liu Zhiyong. Decoupling Contention with VRB Mechanism for Multi-Threaded Applications[J]. Journal of Computer Research and Development, 2015, 52(11): 2577-2588. DOI: 10.7544/issn1000-1239.2015.20148178
    [5]Tang Yixuan, Wu Junmin, Chen Guoliang, Sui Xiufeng, Huang Jing. A Utility Based Cache Optimization Mechanism for Multi-Thread Workloads[J]. Journal of Computer Research and Development, 2013, 50(1): 170-180.
    [6]Shou Lidan, Hu Wei, Luo Xinyuan, Chen Ke, and Chen Gang. An Implementation of Attributive Predicate Lock in Database System[J]. Journal of Computer Research and Development, 2012, 49(10): 2260-2270.
    [7]Wen Shuguang, Xie Gaogang. libpcap-MT: A General Purpose Packet Capture Library with Multi-Thread[J]. Journal of Computer Research and Development, 2011, 48(5): 756-764.
    [8]Tian Hangpei, Gao Deyuan, Fan Xiaoya, and Zhu Yian. Memory Request Queue of Multi-Core Multi-Threading Processor for Real-Time Stream Processing[J]. Journal of Computer Research and Development, 2009, 46(10): 1634-1641.
    [9]Wu Ping, Chen Yiyun, Zhang Jian. Static Data-Race Detection for Multithread Programs[J]. Journal of Computer Research and Development, 2006, 43(2): 329-335.
    [10]Yao Nianmin, Shu Jiwu, and Zheng Weimin. The Distributed Lock Scheme in SAN[J]. Journal of Computer Research and Development, 2005, 42(2): 338-343.
  • Cited by

    Periodical cited type(5)

    1. 彭牧尧,魏建军,王乾舟,王琨. 基于最大最小蚂蚁系统的容迟网络缓存机制. 无线电通信技术. 2023(06): 1095-1103 .
    2. 刘涛. 基于机会网络节点定位算法的优化设计. 白城师范学院学报. 2021(02): 38-42 .
    3. 刘慧,钱育蓉,张振宇,杨文忠. 机会网络中基于陌生节点的竞争转发策略. 计算机工程与设计. 2021(10): 2710-2717 .
    4. 龙浩,张书奎,张力. 一种车载机会网络文件调度与数据传输算法. 计算机应用与软件. 2020(04): 82-88 .
    5. 葛宇,梁静. 基于相遇概率时效性和重复扩散感知的机会网络消息转发算法. 计算机应用. 2020(05): 1397-1402 .

    Other cited types(3)

Catalog

    Article views PDF downloads Cited by(8)

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return