J. Liu, Zongnong Meng, Yan-Xing Hu, Yulin He, S. Shiu, Vincent W. S. Cho
{"title":"推特同行推荐的混合算法","authors":"J. Liu, Zongnong Meng, Yan-Xing Hu, Yulin He, S. Shiu, Vincent W. S. Cho","doi":"10.1145/2554850.2555138","DOIUrl":null,"url":null,"abstract":"This paper presents a hybrid algorithm in the area of peer recommendation in Twitter. Due to the big data issue on Twitter, we define a filtering strategy to reduce the number of candidates who might be recommended to the target user. Meanwhile, we refine the content-based similarity and graph-based similarity algorithms proposed by other academics. Moreover, we define a user model and weighting formula to leverage these two algorithms. According to the similarity degree between the candidates and the target user, we recommend the top k most similar candidates to the target user as our focused peers. In order to evaluate the effectiveness of our proposed algorithms and other algorithms, we conduct a personalized survey and employ measurements like recall, precision and F1 metric. The evaluation results demonstrate that our hybrid algorithm is better than the pure content-based similarity algorithm and pure graph-based similarity algorithm.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A hybrid algorithm for recommendation twitter peers\",\"authors\":\"J. Liu, Zongnong Meng, Yan-Xing Hu, Yulin He, S. Shiu, Vincent W. S. Cho\",\"doi\":\"10.1145/2554850.2555138\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a hybrid algorithm in the area of peer recommendation in Twitter. Due to the big data issue on Twitter, we define a filtering strategy to reduce the number of candidates who might be recommended to the target user. Meanwhile, we refine the content-based similarity and graph-based similarity algorithms proposed by other academics. Moreover, we define a user model and weighting formula to leverage these two algorithms. According to the similarity degree between the candidates and the target user, we recommend the top k most similar candidates to the target user as our focused peers. In order to evaluate the effectiveness of our proposed algorithms and other algorithms, we conduct a personalized survey and employ measurements like recall, precision and F1 metric. The evaluation results demonstrate that our hybrid algorithm is better than the pure content-based similarity algorithm and pure graph-based similarity algorithm.\",\"PeriodicalId\":285655,\"journal\":{\"name\":\"Proceedings of the 29th Annual ACM Symposium on Applied Computing\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-03-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 29th Annual ACM Symposium on Applied Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2554850.2555138\",\"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 29th Annual ACM Symposium on Applied Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2554850.2555138","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A hybrid algorithm for recommendation twitter peers
This paper presents a hybrid algorithm in the area of peer recommendation in Twitter. Due to the big data issue on Twitter, we define a filtering strategy to reduce the number of candidates who might be recommended to the target user. Meanwhile, we refine the content-based similarity and graph-based similarity algorithms proposed by other academics. Moreover, we define a user model and weighting formula to leverage these two algorithms. According to the similarity degree between the candidates and the target user, we recommend the top k most similar candidates to the target user as our focused peers. In order to evaluate the effectiveness of our proposed algorithms and other algorithms, we conduct a personalized survey and employ measurements like recall, precision and F1 metric. The evaluation results demonstrate that our hybrid algorithm is better than the pure content-based similarity algorithm and pure graph-based similarity algorithm.