{"title":"一种融合标签特征和时间上下文的个性化推荐","authors":"Ling Li","doi":"10.1109/cyberc55534.2022.00058","DOIUrl":null,"url":null,"abstract":"The rapid growth of users and items provides enormous potential for users to find their interested information. This has attracted a lot of attentions how to use both tag feature and temporal context to improve recommendation accuracy. In this paper, we calculate users’ similarity by using user-tag bipartite, so as to construct user-tag feature vector. Then, we take the temporal context into consideration to dynamically discover neighbors which have higher effect weights. Finally, we fuse the neighbor sets to collaborative filtering algorithm based on the neighborhood. We evaluate the proposed algorithm using a real-world data set and compare the performance with classical baseline methods, showing the improvements in terms of different evaluation.","PeriodicalId":234632,"journal":{"name":"2022 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Personalized Recommendation Fusing Tag Feature and Temporal Context\",\"authors\":\"Ling Li\",\"doi\":\"10.1109/cyberc55534.2022.00058\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The rapid growth of users and items provides enormous potential for users to find their interested information. This has attracted a lot of attentions how to use both tag feature and temporal context to improve recommendation accuracy. In this paper, we calculate users’ similarity by using user-tag bipartite, so as to construct user-tag feature vector. Then, we take the temporal context into consideration to dynamically discover neighbors which have higher effect weights. Finally, we fuse the neighbor sets to collaborative filtering algorithm based on the neighborhood. We evaluate the proposed algorithm using a real-world data set and compare the performance with classical baseline methods, showing the improvements in terms of different evaluation.\",\"PeriodicalId\":234632,\"journal\":{\"name\":\"2022 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/cyberc55534.2022.00058\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/cyberc55534.2022.00058","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Personalized Recommendation Fusing Tag Feature and Temporal Context
The rapid growth of users and items provides enormous potential for users to find their interested information. This has attracted a lot of attentions how to use both tag feature and temporal context to improve recommendation accuracy. In this paper, we calculate users’ similarity by using user-tag bipartite, so as to construct user-tag feature vector. Then, we take the temporal context into consideration to dynamically discover neighbors which have higher effect weights. Finally, we fuse the neighbor sets to collaborative filtering algorithm based on the neighborhood. We evaluate the proposed algorithm using a real-world data set and compare the performance with classical baseline methods, showing the improvements in terms of different evaluation.