Collaborative Recommendation for Scenic Spots Based on Distance

被引:0
作者
Jiang, YiMing [1 ]
Chen, Jinlong [2 ]
Yang, Minghao [3 ]
机构
[1] Guilin Univ Elect Technol, Guangxi Key Lab Trusted Software, Guilin 541004, Guangxi, Peoples R China
[2] Guilin Univ Elect Technol, Guangxi Key Lab Cryptog & Informat Secur, Guilin 541004, Guangxi, Peoples R China
[3] Chinese Acad Sci, Key Lab Pattern Recognit, Inst Automat, Beijing 100190, Peoples R China
来源
ICCAI '19 - PROCEEDINGS OF THE 2019 5TH INTERNATIONAL CONFERENCE ON COMPUTING AND ARTIFICIAL INTELLIGENCE | 2019年
关键词
Scenic spots recommendation; distance; collaborative recommenddation; prediction; ITEM;
D O I
10.1145/3330482.3330512
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In the collaborative filtering recommendation algorithm, the similarity calculation plays an important role in the recommendation quality. For the traditional collaborative filtering recommendation algorithm, the similarity calculation is performed by a single user score, and the user's demand for the item cannot be accurately reflected. In order to solve this problem, the research proposes a distance-based scenic recommendation algorithm. The algorithm introduces the distance between the user and the item when performing the similarity calculation, then calculating the user's score on target scenic spots for recommendation. The experimental results show that, compared with the traditional collaborative filtering recommendation algorithm based on user score, the result of the distance-based scenic spot recommendation algorithm have some improvement in root-mean-square error, mean-absolute error, coverage, precision and f-measure.
引用
收藏
页码:138 / 142
页数:5
相关论文
共 50 条
  • [41] A robust personalized location recommendation based on ensemble learning
    Zhu, Jun
    Han, Lixin
    Gou, Zhinan
    Yang, Yi
    Yuan, Xiaofeng
    Li, Jingxian
    Li, Shu
    EXPERT SYSTEMS WITH APPLICATIONS, 2021, 167
  • [42] Expected distance based on random walks
    Camby, E.
    Caporossi, G.
    Paiva, M. H. M.
    Segatto, M. E. V.
    JOURNAL OF MATHEMATICAL CHEMISTRY, 2018, 56 (02) : 618 - 629
  • [43] Expected distance based on random walks
    E. Camby
    G. Caporossi
    M. H. M. Paiva
    M. E. V. Segatto
    Journal of Mathematical Chemistry, 2018, 56 : 618 - 629
  • [44] Intrusion Detection based on Distance Combination
    Beauquier, Joffroy
    Hu, Yongjie
    PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY, VOL 25, 2007, 25 : 172 - 180
  • [45] Distance functions based on neighbourhood sequences
    Nagy, B
    PUBLICATIONES MATHEMATICAE-DEBRECEN, 2003, 63 (03): : 483 - 493
  • [46] Similarity and distance in case based reasoning
    Burkhard, HD
    FUNDAMENTA INFORMATICAE, 2001, 47 (3-4) : 201 - 215
  • [47] Modalities of coordination inside innovative collaborative projects: between face-to-face interactions and interactions at a distance
    Bernela, Bastien
    Levy, Rachel
    REVUE D ECONOMIE REGIONALE ET URBAINE, 2016, (02): : 289 - 324
  • [48] A graph-based recommendation approach for highly interactive platforms
    Ficel, Hemza
    Haddad, Mohamed Ramzi
    Zghal, Hajer Baazaoui
    EXPERT SYSTEMS WITH APPLICATIONS, 2021, 185
  • [49] A Study on the Accuracy of Prediction in Recommendation System Based on Similarity Measures
    AL-Bakri, Nadia Fadhil
    Hashim, Soukaena Hassan
    BAGHDAD SCIENCE JOURNAL, 2019, 16 (01) : 263 - 269
  • [50] Deep learning based web service recommendation methods: A survey
    Mecheri, Karima
    Klai, Sihem
    Souici-Meslati, Labiba
    JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2023, 44 (06) : 9879 - 9899