{"title":"基于偏好漂移项聚类的动态推荐系统改进","authors":"Charinya Wangwatcharakul, S. Wongthanavasu","doi":"10.1109/JCSSE.2018.8457395","DOIUrl":null,"url":null,"abstract":"The recommender system is an efficient tool for online application, which exploits historical user rating on item to make recommendations on items to users. This paper aims to enhance dynamic recommender systems under volatile user preference drifts. It proposed an algorithm to solve sparse data by using Gaussian mixture model to fill in data matrix for sparsity reduction and improve more completely ratings prediction. Subsequently, it utilizes item clustering and linear regression technique to predict the future interests of users in category based and additionally uses the nearest neighbor method to prevent over-fitting. The experimental results show that the proposed approach provides the better performance on rating prediction when compared with the state-of-the-art dynamic recommendation algorithms.","PeriodicalId":338973,"journal":{"name":"2018 15th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Improving Dynamic Recommender System Based on Item Clustering for Preference Drifts\",\"authors\":\"Charinya Wangwatcharakul, S. Wongthanavasu\",\"doi\":\"10.1109/JCSSE.2018.8457395\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The recommender system is an efficient tool for online application, which exploits historical user rating on item to make recommendations on items to users. This paper aims to enhance dynamic recommender systems under volatile user preference drifts. It proposed an algorithm to solve sparse data by using Gaussian mixture model to fill in data matrix for sparsity reduction and improve more completely ratings prediction. Subsequently, it utilizes item clustering and linear regression technique to predict the future interests of users in category based and additionally uses the nearest neighbor method to prevent over-fitting. The experimental results show that the proposed approach provides the better performance on rating prediction when compared with the state-of-the-art dynamic recommendation algorithms.\",\"PeriodicalId\":338973,\"journal\":{\"name\":\"2018 15th International Joint Conference on Computer Science and Software Engineering (JCSSE)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 15th International Joint Conference on Computer Science and Software Engineering (JCSSE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/JCSSE.2018.8457395\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 15th International Joint Conference on Computer Science and Software Engineering (JCSSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/JCSSE.2018.8457395","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Improving Dynamic Recommender System Based on Item Clustering for Preference Drifts
The recommender system is an efficient tool for online application, which exploits historical user rating on item to make recommendations on items to users. This paper aims to enhance dynamic recommender systems under volatile user preference drifts. It proposed an algorithm to solve sparse data by using Gaussian mixture model to fill in data matrix for sparsity reduction and improve more completely ratings prediction. Subsequently, it utilizes item clustering and linear regression technique to predict the future interests of users in category based and additionally uses the nearest neighbor method to prevent over-fitting. The experimental results show that the proposed approach provides the better performance on rating prediction when compared with the state-of-the-art dynamic recommendation algorithms.