Please use this identifier to cite or link to this item: https://dspace.ctu.edu.vn/jspui/handle/123456789/39522
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHuynh, Minh Tri-
dc.contributor.authorPham, Huu Tai-
dc.contributor.authorTran, The Vu-
dc.contributor.authorHuynh, Xuan Hiep-
dc.date.accessioned2020-11-17T01:33:09Z-
dc.date.available2020-11-17T01:33:09Z-
dc.date.issued2019-
dc.identifier.urihttps://dspace.ctu.edu.vn/jspui/handle/123456789/39522-
dc.description.abstractDiscovering knowledge in archival data is the goal of researchers. One of them is collaborative filtering recommender system is developing fastly today. It may be rather effective in sparse and "long tail" datasets. Calculating to make decision based on many criteria is really necessary. Relationships, interactions between criteria need to have been fully considered, decision will be more reliable and feasible. In this paper, we propose a new approach that builds a recommender decision-making model based on importance of item, set of items with Shapley value. This model also incorporates traditional techniques and some our new approaches and was tested, evaluated on multirecsys tool we develope from some available tools and uses standardized datasets to experiment. Experimental results show that the proposed model is always satisfactory and reliable. They can be applied in appropriate contexts to minimize limitations of recommender system today and is a research way next time.vi_VN
dc.language.isoenvi_VN
dc.relation.ispartofseriesSystems and Applications;P.1-8-
dc.subjectCollaborative Filtering (CF) Recommender System (RS)vi_VN
dc.subjectMulti-Criteria (MC)vi_VN
dc.subjectInteractionvi_VN
dc.subjectDecision-Making (DM)vi_VN
dc.subjectImportancevi_VN
dc.subjectShapleyvi_VN
dc.titleItem-based recommendation with Shapley valuevi_VN
dc.typeArticlevi_VN
Appears in Collections:Tạp chí quốc tế

Files in This Item:
File Description SizeFormat 
_file_1.8 MBAdobe PDFView/Open
Your IP: 18.119.135.67


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