Employing singular value decomposition and similarity criteria for alleviating cold start and sparse data in context-aware recommender systems

Keyvan Vahidy Rodpysh (), Seyed Javad Mirabedini () and Touraj Banirostam ()
Additional contact information
Keyvan Vahidy Rodpysh: Islamic Azad University
Seyed Javad Mirabedini: Islamic Azad University
Touraj Banirostam: Islamic Azad University

Electronic Commerce Research, 2023, vol. 23, issue 2, No 3, 707 pages

Abstract: Abstract The recommender system’s primary purpose is to estimate the user’s desire and provide a list of items predicted from the appropriate information. Also, context-aware recommendation systems are becoming more and more favorite since they could provide more accurate or personalized recommendation information than traditional recommendation techniques. However, a context-aware recommendation system suffers from two fundamental limitations known as cold start and sparse data. Singular value decomposition has been successfully integrated with some traditional recommendation algorithms. However, the basic singular value decomposition can only extract the feature vectors of users and items, resulting in lower recommendation precision. To improve the recommendation performance and reduce the challenge of cold start and sparse data, we propose a new context-aware recommendation algorithm, named CSSVD. First, in the CSSVD matrix, using the IFPCC and DPCC similarity criteria, the item’s user property attribute matrices are created, respectively, creating the SSVD matrix for the cold start problem. In the second step, through the CWP similarity criterion on the contextual information, the context matrix is created, which according to the SSVD matrix created in the previous step, creates a three-dimensional matrix based on tensor properties, providing the problem of sparse data. We have used the IMDB and STS data collection because of implementing user features, item features, and contextual data for analyzing the recommended method. Experiential results illustrate that the proposed algorithm CSSVD is better than TF, HOSVD, BPR, and CTLSVD in terms of Precision, Recall, F-score, and NDCG measure.Results show the improvement of the recommendations to users through alleviating cold start and sparse data.

Keywords: Context-aware recommender systems; Singular value decomposition; Tensor; Similarity criteria; Cold start; Sparse data (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10660-021-09488-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:elcore:v:23:y:2023:i:2:d:10.1007_s10660-021-09488-7

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10660

DOI: 10.1007/s10660-021-09488-7

Access Statistics for this article

Electronic Commerce Research is currently edited by James Westland

More articles in Electronic Commerce Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().