• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Feng Chenjiao, Song Peng, Wang Zhiqiang, Liang Jiye. A Method on Long Tail Recommendation Based on Three-Factor Probabilistic Graphical Model[J]. Journal of Computer Research and Development, 2021, 58(9): 1975-1986. DOI: 10.7544/issn1000-1239.2021.20200377
Citation: Feng Chenjiao, Song Peng, Wang Zhiqiang, Liang Jiye. A Method on Long Tail Recommendation Based on Three-Factor Probabilistic Graphical Model[J]. Journal of Computer Research and Development, 2021, 58(9): 1975-1986. DOI: 10.7544/issn1000-1239.2021.20200377

A Method on Long Tail Recommendation Based on Three-Factor Probabilistic Graphical Model

Funds: This work was supported by the National Natural Science Foundation of China (61876103, 72171137, 61906111), the Projects of Key Research and Development Plan of Shanxi Province (201903D121162), the 1331 Engineering Project of Shanxi Province, and the Open Fund of Key Laboratory of Shanxi Province (CICIP2020005).
More Information
  • Published Date: August 31, 2021
  • In the Internet era, the explosive rise of information and unprecedented data size has greatly exceeded the receivers’ receiving and handling capability. Accordingly it has become a necessity to capture important and useful information from the massive and complex data. The problem of information overload calls for a more efficient information filtering system and this explains the birth and rise of the recommendation system. In the real recommendation situations, the long tail phenomenon is typically represented, whether in the customers’ rating or their frequency of opting for the items. Actually a deep analysis on the long tail phenomenon helps to promote the e-commerce stakeholders’ performance as well as explore the customers’ preferences, which explains the increasing attention paid on the long tail recommendation. To handle the interpretability of long tail recommendation, a three-factor probabilistic graphical model is proposed. To meet the recommendation system and users’ need for interpretable item recommendation in reality, a three-factor probabilistic graphical recommendation method based on customers’ activity level, the items’unpopularity and customer-item preference level are proposed. In this method, the advantage of probabilistic graphical model in interpreting cause-result relationship is utilized and recommendation accuracy and design novelty in the algorithm can be ensured in this study. The results of experiments indicate that with the advantage of interpretability, the three-factor probabilistic graphical recommendation method can ensure prediction accuracy and perform better in providing novel recommendations.
  • Related Articles

    [1]Feng Yuhong, Wu Kunhan, Huang Zhihong, Feng Yangzhou, Chen Huanhuan, Bai Jiancong, Ming Zhong. A Set Similarity Self-Join Algorithm with FP-tree and MapReduce[J]. Journal of Computer Research and Development, 2023, 60(12): 2890-2906. DOI: 10.7544/issn1000-1239.202111239
    [2]Xu Yini, Ouyang Dantong, Liu Meng, Zhang Liming, Zhang Yonggang. Algorithm of Computing Minimal Conflict Sets Based on the Structural Feature of Fault Output[J]. Journal of Computer Research and Development, 2018, 55(11): 2386-2394. DOI: 10.7544/issn1000-1239.2018.20170381
    [3]Wang Rongquan, Ouyang Dantong, Wang Yiyuan, Liu Siguang, Zhang Liming. Solving Minimal Hitting Sets Method with SAT Based on DOEC Minimization[J]. Journal of Computer Research and Development, 2018, 55(6): 1273-1281. DOI: 10.7544/issn1000-1239.2018.20160809
    [4]Ouyang Dantong, Zhi Huayun, Liu Bowen, Zhang Liming, Zhang Yonggang. A Method of Computing Minimal Diagnoses Based on Pseudo-Failure-Degree to Create New Enumeration Tree[J]. Journal of Computer Research and Development, 2018, 55(4): 782-790. DOI: 10.7544/issn1000-1239.2018.20170016
    [5]Liu Siguang, Ouyang Dantong, Wang Yiyuan, Jia Fengyu, Zhang Liming. Algorithm of Computing Minimal Hitting Set Based on the Structural Feature of SE-Tree[J]. Journal of Computer Research and Development, 2016, 53(11): 2556-2566. DOI: 10.7544/issn1000-1239.2016.20150396
    [6]Ouyang Dantong, Jia Fengyu, Liu Siguang, Zhang Liming. An Algorithm Based on Extension Rule For Solving #SAT Using Complementary Degree[J]. Journal of Computer Research and Development, 2016, 53(7): 1596-1604. DOI: 10.7544/issn1000-1239.2016.20150032
    [7]Li Shaohua, Feng Qilong, Wang Jianxin, and Chen Jianer. Kernelization for Weighted 3-Set Packing Problem[J]. Journal of Computer Research and Development, 2012, 49(8): 17811-786.
    [8]Hong Yi, Wang Zhaoqi, Zhu Dengming, Qiu Xianjie. Generation of Fire Animation Based on Level-Set[J]. Journal of Computer Research and Development, 2010, 47(11): 1849-1856.
    [9]Ren Jinping and Lü Shuwang. Enumerations and Counting of Orthomorphic Permutations[J]. Journal of Computer Research and Development, 2006, 43(6): 1071-1075.
    [10]Yang Jinji, Su Kaile. Improvement of Local Research in SAT Problem[J]. Journal of Computer Research and Development, 2005, 42(1): 60-65.

Catalog

    Article views (437) PDF downloads (370) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return