{"title":"Top-N推荐的联合异构成对损失","authors":"Jin Yi, Jiajin Huang, Jin Qin, Yuan Luo","doi":"10.1145/3350546.3352517","DOIUrl":null,"url":null,"abstract":"We propose a novel pairwise unified recommendation model (short for pairwise URM). The pairwise URM combines two pairwise ranking-oriented collaborative filtering approaches, namely Collaborative Less-is-More Filtering (CLiMF) and Bayesian Personal Ranking (BPR). By sharing common latent features of users and items in BPR and CLiMF, the pairwise URM can benefit from the two methods to improve recommendation qualities. The experimental evaluation is conducted on two real-world datasets with different scales and demonstrates the positive effect of the performance of the pairwise URM.","PeriodicalId":171168,"journal":{"name":"2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Joint Heterogeneous Pair-wise Loss For Top-N Recommendation\",\"authors\":\"Jin Yi, Jiajin Huang, Jin Qin, Yuan Luo\",\"doi\":\"10.1145/3350546.3352517\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a novel pairwise unified recommendation model (short for pairwise URM). The pairwise URM combines two pairwise ranking-oriented collaborative filtering approaches, namely Collaborative Less-is-More Filtering (CLiMF) and Bayesian Personal Ranking (BPR). By sharing common latent features of users and items in BPR and CLiMF, the pairwise URM can benefit from the two methods to improve recommendation qualities. The experimental evaluation is conducted on two real-world datasets with different scales and demonstrates the positive effect of the performance of the pairwise URM.\",\"PeriodicalId\":171168,\"journal\":{\"name\":\"2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI)\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3350546.3352517\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3350546.3352517","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
提出了一种新的两两统一推荐模型(pairwise URM)。两两URM结合了两种面向两两排序的协同过滤方法,即协同Less-is-More filtering (clif)和Bayesian Personal Ranking (BPR)。通过共享BPR和clif中用户和项目的共同潜在特征,两两URM可以从两种方法中受益,从而提高推荐质量。在两个不同规模的真实数据集上进行了实验评估,验证了两两URM性能的积极效果。
Joint Heterogeneous Pair-wise Loss For Top-N Recommendation
We propose a novel pairwise unified recommendation model (short for pairwise URM). The pairwise URM combines two pairwise ranking-oriented collaborative filtering approaches, namely Collaborative Less-is-More Filtering (CLiMF) and Bayesian Personal Ranking (BPR). By sharing common latent features of users and items in BPR and CLiMF, the pairwise URM can benefit from the two methods to improve recommendation qualities. The experimental evaluation is conducted on two real-world datasets with different scales and demonstrates the positive effect of the performance of the pairwise URM.