Open Access System for Information Sharing

Login Library

 

Article
Cited 5 time in webofscience Cited 8 time in scopus
Metadata Downloads
Full metadata record
Files in This Item:
There are no files associated with this item.
DC FieldValueLanguage
dc.contributor.authorChanyoung Park-
dc.contributor.authorDonghyun Kim-
dc.contributor.authorMin-Chul Yang-
dc.contributor.authorJung-Tae Lee-
dc.contributor.authorHwanjo Yu-
dc.date.accessioned2020-03-15T23:50:04Z-
dc.date.available2020-03-15T23:50:04Z-
dc.date.created2020-03-09-
dc.date.issued2020-06-
dc.identifier.issn0020-0255-
dc.identifier.urihttps://oasis.postech.ac.kr/handle/2014.oak/101443-
dc.description.abstractEliciting user preferences from purchase records for performing purchase prediction is challenging because negative feedback is not explicitly observed, and because treating all non-purchased items equally as negative feedback is unrealistic. Therefore, in this study, we present a framework that leverages the past click records of users to compensate for the missing user-item interactions of purchase records, i.e., non-purchased items. We begin by formulating various model assumptions, each one assuming a different order of user preferences among purchased, clicked-but- not-purchased, and non-clicked items, to study the usefulness of leveraging click records. We implement the model assumptions using the Bayesian personalized ranking model, which maximizes the area under the curve for bipartite ranking. However, we argue that using click records for bipartite ranking needs a meticulously designed model because of the relative unreliableness of click records compared with that of purchase records. Therefore, we ultimately propose a novel learningto-rank method, called P3Stop, for performing purchase prediction. The proposed model is customized to be robust to relatively unreliable click records by particularly focusing on the accuracy of top-ranked items. Experimental results on two real-world e-commerce datasets demonstrate that P3STop considerably outperforms the state-of-the-art implicit-feedback-based recommendation methods, especially for top-ranked items. (C) 2020 Elsevier Inc. All rights reserved.-
dc.languageEnglish-
dc.publisherELSEVIER SCIENCE INC-
dc.relation.isPartOfINFORMATION SCIENCES-
dc.titleClick-aware purchase prediction with push at the top-
dc.typeArticle-
dc.identifier.doi10.1016/j.ins.2020.02.062-
dc.type.rimsART-
dc.identifier.bibliographicCitationINFORMATION SCIENCES, v.521, pp.350 - 364-
dc.identifier.wosid000527015900021-
dc.citation.endPage364-
dc.citation.startPage350-
dc.citation.titleINFORMATION SCIENCES-
dc.citation.volume521-
dc.contributor.affiliatedAuthorChanyoung Park-
dc.contributor.affiliatedAuthorHwanjo Yu-
dc.identifier.scopusid2-s2.0-85080046449-
dc.description.journalClass1-
dc.description.journalClass1-
dc.description.isOpenAccessN-
dc.type.docTypeArticle-
dc.subject.keywordAuthorLearning-to-rank-
dc.subject.keywordAuthorMatrix factorization-
dc.subject.keywordAuthorE-commerce-
dc.subject.keywordAuthorPurchase prediction-
dc.relation.journalWebOfScienceCategoryComputer Science, Information Systems-
dc.description.journalRegisteredClassscie-
dc.description.journalRegisteredClassscopus-
dc.relation.journalResearchAreaComputer Science-

qr_code

  • mendeley

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

Related Researcher

Researcher

유환조YU, HWANJO
Dept of Computer Science & Enginrg
Read more

Views & Downloads

Browse