Bayesian pairwise learning to rank via one-class collaborative filtering

Research output: Contribution to journalJournal articleResearchpeer-review

Wang Zhou, Jianping Li, Yongluan Zhou, Muhammad Hammad Memon

With the ever-growing scale of social websites and online transactions, in past decade, Recommender System (RS) has become a crucial tool to overcome information overload, due to its powerful capability in information filtering and retrieval. Traditional rating prediction based RS could learn user's preference according to the explicit feedback, however, such numerical user-item ratings are always unavailable in real life. By contrast, pairwise learning algorithms could directly optimize for ranking and provide personalized recommendation from implicit feedback, although suffering from such data sparsity and slow convergence problems. Motivated by these, in this article, a novel collaborative pairwise learning to rank method referred to as BPLR is proposed, which aims to improve the performance of personalized ranking from implicit feedback. To this end, BPLR tries to partition items into positive feedback, potential feedback and negative feedback, and takes account of the neighborhood relationship between users as well as the item similarity while deriving the potential candidates, moreover, a dynamic sampling strategy is designed to reduce the computational complexity and speed up model training. Empirical experiments over four real world datasets certificate the effectiveness and efficiency of BPLR, which could speed up convergence, and outperform state-of-the-art algorithms significantly in personalized top-N recommendation.

Original languageEnglish
JournalNeurocomputing
ISSN0925-2312
DOIs
Publication statusAccepted/In press - 2019

    Research areas

  • Dynamic sampling, Pairwise learning, Personalized ranking, Potential feedback

ID: 227334433