Pointer-Based Item-to-Item Collaborative Filtering Recommendation System Using a Machine Learning Model

被引:31
作者
Iwendi, Celestine [1 ]
Ibeke, Ebuka [2 ]
Eggoni, Harshini [3 ]
Velagala, Sreerajavenkatareddy [3 ]
Srivastava, Gautam [4 ,5 ]
机构
[1] Univ Bolton, Sch Creat Technol, Bolton, England
[2] Robert Gordon Univ, Sch Creat & Cultural Business, Aberdeen, Scotland
[3] Nagarjuna Coll Engn & Technol, Dept Comp Sci & Engn, Bangalore 560300, Karnataka, India
[4] Brandon Univ, Dept Math & Comp Sci, Brandon, MB, Canada
[5] China Med Univ, Res Ctr Interneural Comp, Taiching, Taiwan
关键词
Recommender systems; keyword-item recommendation; machine learning; collaborative filtering; rating; TRUST;
D O I
10.1142/S0219622021500619
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The creation of digital marketing has enabled companies to adopt personalized item recommendations for their customers. This process keeps them ahead of the competition. One of the techniques used in item recommendation is known as item-based recommendation system or item-item collaborative filtering. Presently, item recommendation is based completely on ratings like 1-5, which is not included in the comment section. In this context, users or customers express their feelings and thoughts about products or services. This paper proposes a machine learning model system where 0, 2, 4 are used to rate products. 0 is negative, 2 is neutral, 4 is positive. This will be in addition to the existing review system that takes care of the users' reviews and comments, without disrupting it. We have implemented this model by using Keras, Pandas and Sci-kit Learning libraries to run the internal work. The proposed approach improved prediction with 79% accuracy for Yelp datasets of businesses across 11 metropolitan areas in four countries, along with a mean absolute error (MAE) of 21%, precision at 79%, recall at 80% and F1-Score at 79%. Our model shows scalability advantage and how organizations can revolutionize their recommender systems to attract possible customers and increase patronage. Also, the proposed similarity algorithm was compared to conventional algorithms to estimate its performance and accuracy in terms of its root mean square error (RMSE), precision and recall. Results of this experiment indicate that the similarity recommendation algorithm performs better than the conventional algorithm and enhances recommendation accuracy.
引用
收藏
页码:463 / 484
页数:22
相关论文
共 48 条
  • [1] Anajemba JH, 2019, 2019 COMPUTING, COMMUNICATIONS AND IOT APPLICATIONS (COMCOMAP), P411, DOI [10.1109/ComComAp46287.2019.9018789, 10.1109/comcomap46287.2019.9018789]
  • [2] Badrul S., 2001, P 10 INT C WORLD WID, P285, DOI DOI 10.1145/371920.372071
  • [3] Berkhim P., 2013, US Patent, Patent No. [8,442,978, 8442978]
  • [4] Chaolun Xia, 2010, Proceedings 2010 Sixth International Conference on Natural Computation (ICNC 2010), P242, DOI 10.1109/ICNC.2010.5582899
  • [5] A social recommender system using item asymmetric correlation
    Dakhel, Arghavan Moradi
    Malazi, Hadi Tabatabaee
    Mahdavi, Mehregan
    [J]. APPLIED INTELLIGENCE, 2018, 48 (03) : 527 - 540
  • [6] A recommender agent based on learning styles for better virtual collaborative learning experiences
    Dascalu, Maria-Iuliana
    Bodea, Constanta-Nicoleta
    Moldoveanu, Alin
    Mohora, Anca
    Lytras, Miltiadis
    Ordonez de Pablos, Patricia
    [J]. COMPUTERS IN HUMAN BEHAVIOR, 2015, 45 : 243 - 253
  • [7] Item-based top-N recommendation algorithms
    Deshpande, M
    Karypis, G
    [J]. ACM TRANSACTIONS ON INFORMATION SYSTEMS, 2004, 22 (01) : 143 - 177
  • [8] Do M.P.T., 2010, 6 INT C INF TECHN ED, P217
  • [9] Trust-Based Collaborative Filtering: Tackling the Cold Start Problem Using Regular Equivalence
    Duricic, Tomislav
    Lacic, Emanuel
    Kowald, Dominik
    Lex, Elisabeth
    [J]. 12TH ACM CONFERENCE ON RECOMMENDER SYSTEMS (RECSYS), 2018, : 446 - 450
  • [10] USING COLLABORATIVE FILTERING TO WEAVE AN INFORMATION TAPESTRY
    GOLDBERG, D
    NICHOLS, D
    OKI, BM
    TERRY, D
    [J]. COMMUNICATIONS OF THE ACM, 1992, 35 (12) : 61 - 70