318 0

Full metadata record

DC FieldValueLanguage
dc.contributor.author이기천-
dc.date.accessioned2019-12-04T00:49:27Z-
dc.date.available2019-12-04T00:49:27Z-
dc.date.issued2018-01-
dc.identifier.citationCOMPUTER SCIENCE AND INFORMATION SYSTEMS, v. 15, no. 2, page. 347-368en_US
dc.identifier.issn1820-0214-
dc.identifier.urihttp://www.doiserbia.nb.rs/Article.aspx?ID=1820-02141800003H#.XT5X3GZ7mAg-
dc.identifier.urihttps://repository.hanyang.ac.kr/handle/20.500.11754/116935-
dc.description.abstractExisting recommendation methods suffer from the data sparsity problem which means that most of users have rated only a very small number of items, often resulting in low recommendation accuracy. In addition, for cold start users evaluating only few items, rating predictions with the methods also produce low accuracy. To address these problems, we propose a novel data imputation method that effectively substitutes missing ratings with probable values (i.e., imputed values). Our method successfully improves accuracy of recommendation methods from the following three aspects: (1) exploiting a trust network, (2) imputing only a part of missing ratings, and (3) applying them to any recommendation methods. Our method employs a bidirectional connection structure within a distance level for finding reliable users in exploiting a trust network as useful information. In addition, our method imputes only some missing ratings, called fillable ratings, whose imputed values are expected to be accurate with a sufficient level of confidence. Moreover, our imputation method is independent of, thus applicable to, any recommendation methods that may include application-specific ones and the most accurate one in each domain. We conduct experiments on three real-life datasets which arise from Epinions and Ciao. Our experimental results demonstrate that our method has recommendation accuracy better than existing recommendation methods equipped with imputation methods or trust networks, especially for cold start users.en_US
dc.description.sponsorshipThis work was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIT) (No. NRF-2017R1A2B3004581), the Next-Generation Information Computing Development Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Science, ICT (NRF-2017M3C4A7069440), and the Ministry of Science, ICT and Future Planning (MSIT), Korea, under the Information Technology Research Center (ITRC) support program (IITP-2017-2013-0-00881). Professor Sang-Wook Kim is the corresponding author.en_US
dc.language.isoen_USen_US
dc.publisherCOMSIS CONSORTIUMen_US
dc.subjectRecommendation systemsen_US
dc.subjecttrust networksen_US
dc.subjectdata sparsityen_US
dc.subjectimputationen_US
dc.titleData Imputation Using a Trust Network for Recommendation via Matrix Factorizationen_US
dc.typeArticleen_US
dc.relation.no2-
dc.relation.volume15-
dc.identifier.doi10.2298/CSIS170820003H-
dc.relation.page347-368-
dc.relation.journalCOMPUTER SCIENCE AND INFORMATION SYSTEMS-
dc.contributor.googleauthorHwang, Won-Seok-
dc.contributor.googleauthorLi, Shaoyu-
dc.contributor.googleauthorKim, Sang-Wook-
dc.contributor.googleauthorLee, Kichun-
dc.relation.code2018007967-
dc.sector.campusS-
dc.sector.daehakCOLLEGE OF ENGINEERING[S]-
dc.sector.departmentDEPARTMENT OF INDUSTRIAL ENGINEERING-
dc.identifier.pidskylee-
Appears in Collections:
COLLEGE OF ENGINEERING[S](공과대학) > INDUSTRIAL ENGINEERING(산업공학과) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE