Hongyan Mao, Ningkang Jiang, Wen Su, Linpeng Huang
{"title":"面向普适应用的上下文感知建模框架","authors":"Hongyan Mao, Ningkang Jiang, Wen Su, Linpeng Huang","doi":"10.1109/CSC.2012.14","DOIUrl":null,"url":null,"abstract":"It is a challenge to recommend Web services under multiple contexts. To address this challenge, we propose a context-aware collaborative filtering (CaCF) approach for service recommendation. Three types of contextual information, i.e. time, location and interest of user, are considered. In this approach, users' interests are extracted from service invocation records and represented as term-weight vectors. Neighbors are chosen according to the Cosine similarities of these vectors. Then, neighbors are filtered into close neighbors by location and time. At last, these close neighbors recommend service to a target user. We evaluate our method through comparing with other service recommendation approaches. The experimental results show that it achieves better precision and satisfaction rate than other two methods.","PeriodicalId":183800,"journal":{"name":"2012 International Conference on Cloud and Service Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A Context-aware Modeling Framework for Pervasive Applications\",\"authors\":\"Hongyan Mao, Ningkang Jiang, Wen Su, Linpeng Huang\",\"doi\":\"10.1109/CSC.2012.14\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is a challenge to recommend Web services under multiple contexts. To address this challenge, we propose a context-aware collaborative filtering (CaCF) approach for service recommendation. Three types of contextual information, i.e. time, location and interest of user, are considered. In this approach, users' interests are extracted from service invocation records and represented as term-weight vectors. Neighbors are chosen according to the Cosine similarities of these vectors. Then, neighbors are filtered into close neighbors by location and time. At last, these close neighbors recommend service to a target user. We evaluate our method through comparing with other service recommendation approaches. The experimental results show that it achieves better precision and satisfaction rate than other two methods.\",\"PeriodicalId\":183800,\"journal\":{\"name\":\"2012 International Conference on Cloud and Service Computing\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-11-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 International Conference on Cloud and Service Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSC.2012.14\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Cloud and Service Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSC.2012.14","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Context-aware Modeling Framework for Pervasive Applications
It is a challenge to recommend Web services under multiple contexts. To address this challenge, we propose a context-aware collaborative filtering (CaCF) approach for service recommendation. Three types of contextual information, i.e. time, location and interest of user, are considered. In this approach, users' interests are extracted from service invocation records and represented as term-weight vectors. Neighbors are chosen according to the Cosine similarities of these vectors. Then, neighbors are filtered into close neighbors by location and time. At last, these close neighbors recommend service to a target user. We evaluate our method through comparing with other service recommendation approaches. The experimental results show that it achieves better precision and satisfaction rate than other two methods.