An efficient recommender system algorithm using trust data
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Rahim, Asma | - |
dc.contributor.author | Durrani, Mehr Yahya | - |
dc.contributor.author | Gillani, Saira | - |
dc.contributor.author | Ali, Zeeshan | - |
dc.contributor.author | Ul Hasan, Najam | - |
dc.contributor.author | Kim, Mucheol | - |
dc.date.accessioned | 2021-10-19T04:40:11Z | - |
dc.date.available | 2021-10-19T04:40:11Z | - |
dc.date.issued | 2022-02 | - |
dc.identifier.issn | 0920-8542 | - |
dc.identifier.issn | 1573-0484 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/50382 | - |
dc.description.abstract | Smart services are a concept that provides services to the citizens in an efficient manner. The online shopping and recommender system can play an important role for smart cities in providing relevant item recommendations to the users. One of the famous Recommendation System strategies is known as Collaborative Filtering and provides popular suggestions to the users. The recommendation is generated by identifying a set of similar users from a user-item rating matrix using a similarity measure. The problem with the majority of the recommender systems is whether the generated recommendations are good enough because users usually find recommendations from their circle more appealing. It is important to use only those similar users that have some kind of trust among them. The accuracy of the recommendations also gets affected due to the sparsity of the user-item matrix. To handle these problems, a trust-based technique TrustASVD++ is proposed, which combines a user's trust data in the Matrix Factorization context. The proposed method combines trust values with user ratings for improved recommendations using Pearson Correlation Coefficient (PCC). PCC is compared with other state-of-the-art similarity measures, and the results obtained show that PCC outperforms all the other relevant measures. To assess the efficiency of the offered strategy, testing on numerous datasets has been carried out including Epinions, FilmTrust, and Ciao. The results illustrate the considerable improvement of the proposed method over numerous contemporary techniques. | - |
dc.format.extent | 21 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | SPRINGER | - |
dc.title | An efficient recommender system algorithm using trust data | - |
dc.type | Article | - |
dc.identifier.doi | 10.1007/s11227-021-03991-2 | - |
dc.identifier.bibliographicCitation | JOURNAL OF SUPERCOMPUTING, v.78, no.3, pp 3184 - 3204 | - |
dc.description.isOpenAccess | N | - |
dc.identifier.wosid | 000675030800001 | - |
dc.identifier.scopusid | 2-s2.0-85110907356 | - |
dc.citation.endPage | 3204 | - |
dc.citation.number | 3 | - |
dc.citation.startPage | 3184 | - |
dc.citation.title | JOURNAL OF SUPERCOMPUTING | - |
dc.citation.volume | 78 | - |
dc.type.docType | Article | - |
dc.publisher.location | 네델란드 | - |
dc.subject.keywordAuthor | Smart services | - |
dc.subject.keywordAuthor | Collaborative filtering | - |
dc.subject.keywordAuthor | Recommendation system | - |
dc.subject.keywordAuthor | Trust data | - |
dc.subject.keywordAuthor | Matrix factorization | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Hardware & Architecture | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
84, Heukseok-ro, Dongjak-gu, Seoul, Republic of Korea (06974)02-820-6194
COPYRIGHT 2019 Chung-Ang University All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.