{"title":"Context-Aware Service Recommendation on High Performance Cluster","authors":"Zhiwei Yu, Victor W. Chu, R. Wong","doi":"10.1109/SCC.2013.87","DOIUrl":null,"url":null,"abstract":"Finding and recommending suitable services on mobile devices is an important topic in today's society where most people rely on their smartphones to provide solutions to their day-to-day problems or to receive prescribed services. Recent research has attempted to use role-based approaches to recommend mobile services to other members among the same context group. However, these proposed algorithms are inefficient and may not scale to cope with the huge amount of mobile traffics in the real-world. This paper proposes novel algorithms with better runtime complexity, and further extends them to Map Reduce style to take advantage of popular distributed computing platforms. Experiments running on a medium-sized high performance computing cluster demonstrate that our proposed algorithms outperform previous work in running time complexity and scalability.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE International Conference on Services Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCC.2013.87","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Finding and recommending suitable services on mobile devices is an important topic in today's society where most people rely on their smartphones to provide solutions to their day-to-day problems or to receive prescribed services. Recent research has attempted to use role-based approaches to recommend mobile services to other members among the same context group. However, these proposed algorithms are inefficient and may not scale to cope with the huge amount of mobile traffics in the real-world. This paper proposes novel algorithms with better runtime complexity, and further extends them to Map Reduce style to take advantage of popular distributed computing platforms. Experiments running on a medium-sized high performance computing cluster demonstrate that our proposed algorithms outperform previous work in running time complexity and scalability.