TY - JOUR
T1 - Personalized recommendation with implicit feedback via learning pairwise preferences over item-sets
AU - Pan, Weike
AU - Chen, Li
AU - Ming, Zhong
N1 - Funding Information:
Acknowledgements We thank the support of Hong Kong RGC under the Project RGC/HKBU12200415, Natural Science Foundation of China Nos. 61272365, 61502307 and 61672358
PY - 2019/2/6
Y1 - 2019/2/6
N2 - Preference learning is a fundamental problem in various smart computing applications such as personalized recommendation. Collaborative filtering as a major learning technique aims to make use of users’ feedback, for which some recent works have switched from exploiting explicit feedback to implicit feedback. One fundamental challenge of leveraging implicit feedback is the lack of negative feedback, because there is only some observed relatively “positive” feedback available, making it difficult to learn a prediction model. In this paper, we propose a new and relaxed assumption of pairwise preferences over item-sets, which defines a user’s preference on a set of items (item-set) instead of on a single item only. The relaxed assumption can give us more accurate pairwise preference relationships. With this assumption, we further develop a general algorithm called CoFiSet (collaborative filtering via learning pairwise preferences over item-sets), which contains four variants, CoFiSet(SS), CoFiSet(MOO), CoFiSet(MOS) and CoFiSet(MSO), representing “Set vs. Set,” “Many ‘One vs. One’,” “Many ‘One vs. Set”’ and “Many ‘Set vs. One”’ pairwise comparisons, respectively. Experimental results show that our CoFiSet(MSO) performs better than several state-of-the-art methods on five ranking-oriented evaluation metrics on three real-world data sets.
AB - Preference learning is a fundamental problem in various smart computing applications such as personalized recommendation. Collaborative filtering as a major learning technique aims to make use of users’ feedback, for which some recent works have switched from exploiting explicit feedback to implicit feedback. One fundamental challenge of leveraging implicit feedback is the lack of negative feedback, because there is only some observed relatively “positive” feedback available, making it difficult to learn a prediction model. In this paper, we propose a new and relaxed assumption of pairwise preferences over item-sets, which defines a user’s preference on a set of items (item-set) instead of on a single item only. The relaxed assumption can give us more accurate pairwise preference relationships. With this assumption, we further develop a general algorithm called CoFiSet (collaborative filtering via learning pairwise preferences over item-sets), which contains four variants, CoFiSet(SS), CoFiSet(MOO), CoFiSet(MOS) and CoFiSet(MSO), representing “Set vs. Set,” “Many ‘One vs. One’,” “Many ‘One vs. Set”’ and “Many ‘Set vs. One”’ pairwise comparisons, respectively. Experimental results show that our CoFiSet(MSO) performs better than several state-of-the-art methods on five ranking-oriented evaluation metrics on three real-world data sets.
KW - Collaborative filtering
KW - Implicit feedback
KW - Pairwise preferences over item-sets
KW - Top-k recommendation
UR - https://www.scopus.com/pages/publications/85040701699
U2 - 10.1007/s10115-018-1154-5
DO - 10.1007/s10115-018-1154-5
M3 - Journal article
AN - SCOPUS:85040701699
SN - 0219-1377
VL - 58
SP - 295
EP - 318
JO - Knowledge and Information Systems
JF - Knowledge and Information Systems
IS - 2
ER -