DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jeong, B | - |
dc.contributor.author | Lee, J | - |
dc.contributor.author | Cho, H | - |
dc.date.accessioned | 2016-04-01T02:21:42Z | - |
dc.date.available | 2016-04-01T02:21:42Z | - |
dc.date.created | 2011-03-25 | - |
dc.date.issued | 2010-03-01 | - |
dc.identifier.issn | 0020-0255 | - |
dc.identifier.other | 2010-OAK-0000023043 | - |
dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/24986 | - |
dc.description.abstract | Memory-based collaborative filtering (CF) makes recommendations based on a collection of user preferences for items. The idea underlying this approach is that the interests of an active user will more likely coincide with those of users who share similar preferences to the active user. Hence, the choice and computation of a similarity measure between users is critical to rating items. This work proposes a similarity update method that uses an iterative message passing procedure. Additionally, this work deals with a drawback of using the popular mean absolute error (MAE) for performance evaluation, namely that ignores ratings distribution. A novel modulation method and an accuracy metric are presented in order to minimize the predictive accuracy error and to evenly distribute predicted ratings over true rating scales. Preliminary results show that the proposed similarity update and prediction modulation techniques significantly improve the predicted rankings. (C) 2009 Elsevier Inc. All rights reserved. | - |
dc.description.statementofresponsibility | X | - |
dc.language | English | - |
dc.publisher | Elsevier | - |
dc.relation.isPartOf | INFORMATION SCIENCES | - |
dc.subject | Collaborative filtering | - |
dc.subject | Mean absolute error (MAE) | - |
dc.subject | Message passing | - |
dc.subject | Recommendation accuracy | - |
dc.subject | Recommender system | - |
dc.subject | Similarity measure | - |
dc.subject | RECOMMENDER SYSTEMS | - |
dc.title | Improving memory-based collaborative filtering via similarity updating and prediction modulation | - |
dc.type | Article | - |
dc.contributor.college | 산업경영공학과 | - |
dc.identifier.doi | 10.1016/J.INS.2009.10.016 | - |
dc.author.google | Jeong, B | - |
dc.author.google | Lee, J | - |
dc.author.google | Cho, H | - |
dc.relation.volume | 180 | - |
dc.relation.issue | 5 | - |
dc.relation.startpage | 602 | - |
dc.relation.lastpage | 612 | - |
dc.contributor.id | 10083567 | - |
dc.relation.journal | INFORMATION SCIENCES | - |
dc.relation.index | SCI급, SCOPUS 등재논문 | - |
dc.relation.sci | SCI | - |
dc.collections.name | Journal Papers | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | INFORMATION SCIENCES, v.180, no.5, pp.602 - 612 | - |
dc.identifier.wosid | 000273920600003 | - |
dc.date.tcdate | 2019-02-01 | - |
dc.citation.endPage | 612 | - |
dc.citation.number | 5 | - |
dc.citation.startPage | 602 | - |
dc.citation.title | INFORMATION SCIENCES | - |
dc.citation.volume | 180 | - |
dc.contributor.affiliatedAuthor | Lee, J | - |
dc.contributor.affiliatedAuthor | Cho, H | - |
dc.identifier.scopusid | 2-s2.0-72149092381 | - |
dc.description.journalClass | 1 | - |
dc.description.journalClass | 1 | - |
dc.description.wostc | 37 | - |
dc.description.scptc | 42 | * |
dc.date.scptcdate | 2018-05-121 | * |
dc.type.docType | Article | - |
dc.subject.keywordAuthor | Collaborative filtering | - |
dc.subject.keywordAuthor | Mean absolute error (MAE) | - |
dc.subject.keywordAuthor | Message passing | - |
dc.subject.keywordAuthor | Recommendation accuracy | - |
dc.subject.keywordAuthor | Recommender system | - |
dc.subject.keywordAuthor | Similarity measure | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
library@postech.ac.kr Tel: 054-279-2548
Copyrights © by 2017 Pohang University of Science ad Technology All right reserved.