dc.contributor.author | Pandey, Gaurav | |
dc.contributor.author | Wang, Shuaiqiang | |
dc.contributor.editor | Czarnowski, Ireneusz | |
dc.contributor.editor | Howlett, Robert J. | |
dc.contributor.editor | Jain, Lakhmi C. | |
dc.contributor.editor | Vlacic, Ljubo | |
dc.date.accessioned | 2019-12-17T13:32:38Z | |
dc.date.available | 2019-12-17T13:32:38Z | |
dc.date.issued | 2018 | |
dc.identifier.citation | Pandey, G., & Wang, S. (2018). Listwise Recommendation Approach with Non-negative Matrix Factorization. In I. Czarnowski, R. J. Howlett, L. C. Jain, & L. Vlacic (Eds.), <i>KES-IDT 2018 : Proceedings of the 10th International KES Conference on Intelligent Decision Technologies</i> (pp. 22-32). Springer. Smart Innovation, Systems and Technologies, 97. <a href="https://doi.org/10.1007/978-3-319-92028-3_3" target="_blank">https://doi.org/10.1007/978-3-319-92028-3_3</a> | |
dc.identifier.other | CONVID_28131081 | |
dc.identifier.other | TUTKAID_78082 | |
dc.identifier.uri | https://jyx.jyu.fi/handle/123456789/66885 | |
dc.description.abstract | Matrix factorization (MF) is one of the most effective categories of recommendation algorithms, which makes predictions based on the user-item rating matrix. Nowadays many studies reveal that the ultimate goal of recommendations is to predict correct rankings of these unrated items. However, most of the pioneering efforts on ranking-oriented MF predict users’ item ranking based on the original rating matrix, which fails to explicitly present users’ preference ranking on items and thus might result in some accuracy loss. In this paper, we formulate a novel listwise user-ranking probability prediction problem for recommendations, that aims to utilize a user-ranking probability matrix to predict users’ possible rankings on all items. For this, we present LwRec, a novel listwise ranking-oriented matrix factorization algorithm. It aims to predict the missing values in the user-ranking probability matrix, aiming that each row of the final predicted matrix should have a probability distribution similar to the original one. Extensive offline experiments on two benchmark datasets against several state-of-the-art baselines demonstrate the effectiveness of our proposal. | fi |
dc.format.extent | 238 | |
dc.format.mimetype | application/pdf | |
dc.language.iso | eng | |
dc.publisher | Springer | |
dc.relation.ispartof | KES-IDT 2018 : Proceedings of the 10th International KES Conference on Intelligent Decision Technologies | |
dc.relation.ispartofseries | Smart Innovation, Systems and Technologies | |
dc.rights | In Copyright | |
dc.subject.other | collaborative filtering | |
dc.subject.other | ranking | |
dc.title | Listwise Recommendation Approach with Non-negative Matrix Factorization | |
dc.type | conferenceObject | |
dc.identifier.urn | URN:NBN:fi:jyu-201912135254 | |
dc.contributor.laitos | Informaatioteknologian tiedekunta | fi |
dc.contributor.laitos | Faculty of Information Technology | en |
dc.contributor.oppiaine | Tietojärjestelmätiede | fi |
dc.contributor.oppiaine | Information Systems Science | en |
dc.type.uri | http://purl.org/eprint/type/ConferencePaper | |
dc.date.updated | 2019-12-13T10:15:22Z | |
dc.relation.isbn | 978-3-319-92027-6 | |
dc.description.reviewstatus | peerReviewed | |
dc.format.pagerange | 22-32 | |
dc.relation.issn | 2190-3018 | |
dc.relation.numberinseries | 97 | |
dc.type.version | acceptedVersion | |
dc.rights.copyright | © Springer International Publishing AG, part of Springer Nature 2019 | |
dc.rights.accesslevel | openAccess | fi |
dc.relation.conference | International KES Conference on Intelligent Decision Technologies | |
dc.subject.yso | suosittelujärjestelmät | |
dc.subject.yso | algoritmit | |
dc.format.content | fulltext | |
jyx.subject.uri | http://www.yso.fi/onto/yso/p28483 | |
jyx.subject.uri | http://www.yso.fi/onto/yso/p14524 | |
dc.rights.url | http://rightsstatements.org/page/InC/1.0/?language=en | |
dc.relation.doi | 10.1007/978-3-319-92028-3_3 | |