Wang Gui-fen, Ren Yan, Duan Long-zhen, Zou Zhi-xin, Zhang Xu, Zhan Yun-qiao, Liang Wei-song
{"title":"一种具有项目层次-兴趣度的优化协同过滤方法","authors":"Wang Gui-fen, Ren Yan, Duan Long-zhen, Zou Zhi-xin, Zhang Xu, Zhan Yun-qiao, Liang Wei-song","doi":"10.1109/BCGIN.2011.168","DOIUrl":null,"url":null,"abstract":"Collaborative filtering algorithm is one of the most successful recommender technologies and has been widely adopted in recommender systems. However, the traditional collaborative filtering always suffers from sparsity problem of dataset. Item resource has hierarchy itself, and people's interests are centralized in several hierarchies. In addition, rating is multivariate with several factors: user's interest and item's quality etc. The proposed algorithm makes corresponding modification based on the traditional algorithm with the ideas above. Experimental results show that the algorithm can guarantee the accuracy of the system recommended by the case, effectively alleviate the data sparsity problem.","PeriodicalId":127523,"journal":{"name":"2011 International Conference on Business Computing and Global Informatization","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"An Optimized Collaborative Filtering Approach with Item Hierarchy-Interestingness\",\"authors\":\"Wang Gui-fen, Ren Yan, Duan Long-zhen, Zou Zhi-xin, Zhang Xu, Zhan Yun-qiao, Liang Wei-song\",\"doi\":\"10.1109/BCGIN.2011.168\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Collaborative filtering algorithm is one of the most successful recommender technologies and has been widely adopted in recommender systems. However, the traditional collaborative filtering always suffers from sparsity problem of dataset. Item resource has hierarchy itself, and people's interests are centralized in several hierarchies. In addition, rating is multivariate with several factors: user's interest and item's quality etc. The proposed algorithm makes corresponding modification based on the traditional algorithm with the ideas above. Experimental results show that the algorithm can guarantee the accuracy of the system recommended by the case, effectively alleviate the data sparsity problem.\",\"PeriodicalId\":127523,\"journal\":{\"name\":\"2011 International Conference on Business Computing and Global Informatization\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-07-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Conference on Business Computing and Global Informatization\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BCGIN.2011.168\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Business Computing and Global Informatization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BCGIN.2011.168","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Optimized Collaborative Filtering Approach with Item Hierarchy-Interestingness
Collaborative filtering algorithm is one of the most successful recommender technologies and has been widely adopted in recommender systems. However, the traditional collaborative filtering always suffers from sparsity problem of dataset. Item resource has hierarchy itself, and people's interests are centralized in several hierarchies. In addition, rating is multivariate with several factors: user's interest and item's quality etc. The proposed algorithm makes corresponding modification based on the traditional algorithm with the ideas above. Experimental results show that the algorithm can guarantee the accuracy of the system recommended by the case, effectively alleviate the data sparsity problem.