{"title":"SOFA:基于统计的协同过滤算法","authors":"Yuanjun Yao, Hao Yuan, Feng Xie, Zhen Chen","doi":"10.1109/ICNDC.2013.40","DOIUrl":null,"url":null,"abstract":"The classic user-based collaborative filtering algorithm has some shortcomes in its similarity calculation. In this paper, we propose a statistic based collaborative filtering algorithm (SOFA). The contributions are three-fold: 1) a threshold is used to filter those inaccurate similarities between users who have less intersection, 2) users' statistics, such as mean, and variance, are used for similarity measurements, 3) two similarities are aggregated for more accurate prediction. The experiments are conducted on MovieLens data set, and the results show that the proposed method performs better than traditional ones in several popular metrics, i.e. MAE, Coverage, Precision, Recall, and F-measure etc.","PeriodicalId":152234,"journal":{"name":"2013 Fourth International Conference on Networking and Distributed Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"SOFA: Statistic Based Collaborative Filtering Algorithm\",\"authors\":\"Yuanjun Yao, Hao Yuan, Feng Xie, Zhen Chen\",\"doi\":\"10.1109/ICNDC.2013.40\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The classic user-based collaborative filtering algorithm has some shortcomes in its similarity calculation. In this paper, we propose a statistic based collaborative filtering algorithm (SOFA). The contributions are three-fold: 1) a threshold is used to filter those inaccurate similarities between users who have less intersection, 2) users' statistics, such as mean, and variance, are used for similarity measurements, 3) two similarities are aggregated for more accurate prediction. The experiments are conducted on MovieLens data set, and the results show that the proposed method performs better than traditional ones in several popular metrics, i.e. MAE, Coverage, Precision, Recall, and F-measure etc.\",\"PeriodicalId\":152234,\"journal\":{\"name\":\"2013 Fourth International Conference on Networking and Distributed Computing\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 Fourth International Conference on Networking and Distributed Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICNDC.2013.40\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 Fourth International Conference on Networking and Distributed Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNDC.2013.40","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
SOFA: Statistic Based Collaborative Filtering Algorithm
The classic user-based collaborative filtering algorithm has some shortcomes in its similarity calculation. In this paper, we propose a statistic based collaborative filtering algorithm (SOFA). The contributions are three-fold: 1) a threshold is used to filter those inaccurate similarities between users who have less intersection, 2) users' statistics, such as mean, and variance, are used for similarity measurements, 3) two similarities are aggregated for more accurate prediction. The experiments are conducted on MovieLens data set, and the results show that the proposed method performs better than traditional ones in several popular metrics, i.e. MAE, Coverage, Precision, Recall, and F-measure etc.