{"title":"基于现场感知分解机的电子商务商品推荐","authors":"Peng Yan, Xiaocong Zhou, Yitao Duan","doi":"10.1145/2813448.2813511","DOIUrl":null,"url":null,"abstract":"The RecSys 2015 contest [1] seeks the best solution to a top-N e-commerce item recommendation problem. This paper describes the team Random Walker's approach to this challenge, which won the 3rd place in the contest. Our solution consists of the following components. Firstly, we cast the top-N recommendation task into a binary classification problem and extract original features from the raw data. Secondly, we learn derived features using field-aware factorization machines (FFM) and gradient boosting decision tree (GBDT). Lastly, we train 2 FFM models with different feature sets and combine them by a non-linear weighted blending. This solution is the result of numerous tests and the scheme turns out to be effective. Our final solution achieved a score of 61075.2, ranking in the third place on the public leaderboard.","PeriodicalId":324873,"journal":{"name":"Proceedings of the 2015 International ACM Recommender Systems Challenge","volume":"IA-21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"E-Commerce Item Recommendation Based on Field-aware Factorization Machine\",\"authors\":\"Peng Yan, Xiaocong Zhou, Yitao Duan\",\"doi\":\"10.1145/2813448.2813511\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The RecSys 2015 contest [1] seeks the best solution to a top-N e-commerce item recommendation problem. This paper describes the team Random Walker's approach to this challenge, which won the 3rd place in the contest. Our solution consists of the following components. Firstly, we cast the top-N recommendation task into a binary classification problem and extract original features from the raw data. Secondly, we learn derived features using field-aware factorization machines (FFM) and gradient boosting decision tree (GBDT). Lastly, we train 2 FFM models with different feature sets and combine them by a non-linear weighted blending. This solution is the result of numerous tests and the scheme turns out to be effective. Our final solution achieved a score of 61075.2, ranking in the third place on the public leaderboard.\",\"PeriodicalId\":324873,\"journal\":{\"name\":\"Proceedings of the 2015 International ACM Recommender Systems Challenge\",\"volume\":\"IA-21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-09-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2015 International ACM Recommender Systems Challenge\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2813448.2813511\",\"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 2015 International ACM Recommender Systems Challenge","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2813448.2813511","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
E-Commerce Item Recommendation Based on Field-aware Factorization Machine
The RecSys 2015 contest [1] seeks the best solution to a top-N e-commerce item recommendation problem. This paper describes the team Random Walker's approach to this challenge, which won the 3rd place in the contest. Our solution consists of the following components. Firstly, we cast the top-N recommendation task into a binary classification problem and extract original features from the raw data. Secondly, we learn derived features using field-aware factorization machines (FFM) and gradient boosting decision tree (GBDT). Lastly, we train 2 FFM models with different feature sets and combine them by a non-linear weighted blending. This solution is the result of numerous tests and the scheme turns out to be effective. Our final solution achieved a score of 61075.2, ranking in the third place on the public leaderboard.