{"title":"具有两两特征的基于会话的项目推荐","authors":"Zhe Wang, Yangbo Gao, Huan Chen, Peng Yan","doi":"10.1145/3359555.3359559","DOIUrl":null,"url":null,"abstract":"The RecSys Challenge 2019 seeks a better solution for item recommendation on short session-based data with limited user history. This paper describes the team PVZ's approach to this challenge, which won the 3rd place in the contest. Our solution consists of the following components. Firstly, we cast the hotel recommendation task as a binary classification problem. Secondly, we spend most of the time doing feature engineering and mining a series of useful features in various aspects. Then we train individual models with a different set of features and blend them with some important features using stacking method. At last, we create other new pair-wise features based on the existing model predictions and train a stacking model again which generates our final result. Our final solution achieved a public score of 0.685929 and a private score of 0.684071, ranking the third place on both sides.","PeriodicalId":255213,"journal":{"name":"Proceedings of the Workshop on ACM Recommender Systems Challenge","volume":"64 4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Session-based item recommendation with pairwise features\",\"authors\":\"Zhe Wang, Yangbo Gao, Huan Chen, Peng Yan\",\"doi\":\"10.1145/3359555.3359559\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The RecSys Challenge 2019 seeks a better solution for item recommendation on short session-based data with limited user history. This paper describes the team PVZ's approach to this challenge, which won the 3rd place in the contest. Our solution consists of the following components. Firstly, we cast the hotel recommendation task as a binary classification problem. Secondly, we spend most of the time doing feature engineering and mining a series of useful features in various aspects. Then we train individual models with a different set of features and blend them with some important features using stacking method. At last, we create other new pair-wise features based on the existing model predictions and train a stacking model again which generates our final result. Our final solution achieved a public score of 0.685929 and a private score of 0.684071, ranking the third place on both sides.\",\"PeriodicalId\":255213,\"journal\":{\"name\":\"Proceedings of the Workshop on ACM Recommender Systems Challenge\",\"volume\":\"64 4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-09-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Workshop on ACM Recommender Systems Challenge\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3359555.3359559\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Workshop on ACM Recommender Systems Challenge","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3359555.3359559","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Session-based item recommendation with pairwise features
The RecSys Challenge 2019 seeks a better solution for item recommendation on short session-based data with limited user history. This paper describes the team PVZ's approach to this challenge, which won the 3rd place in the contest. Our solution consists of the following components. Firstly, we cast the hotel recommendation task as a binary classification problem. Secondly, we spend most of the time doing feature engineering and mining a series of useful features in various aspects. Then we train individual models with a different set of features and blend them with some important features using stacking method. At last, we create other new pair-wise features based on the existing model predictions and train a stacking model again which generates our final result. Our final solution achieved a public score of 0.685929 and a private score of 0.684071, ranking the third place on both sides.