Preference Aware Service Recommendation Using Collaborative Filtering Approach

Service recommendations are shown as remarkable tools for providing recommendations to users in an appropriate way. In the last few years, the number of customers, online information and services has grown very rapidly, resulting in the big data analysis problem for service recommendation system. Consequently, there is scalability and inefficiency problems associated with the traditional service recommendation system which suffers in processing or analyzing large-scale data. Moreover, most of available service recommendation system gives the same rankings and ratings of services to different users without any considerations of many user’s preferences, and hence it fails to reach user’s personalized requirements. In this paper, we have proposed a Preference-Aware Service Recommendation method, to overcome the above challenges. It aims at recommending the most appropriate and preferred services to the users and provide a personalized service recommendation list in an effective way. Here, users' preferences are captured as keywords, and a user-based Collaborative filtering approach is adopted to create appropriate recommendations. A widely-adopted distributed computing platform, Hadoop is used for the implementation of this approach, which improves its efficiency and scalability in big data environment, using the MapReduce parallel processing method. DOI: 10.17762/ijritcc2321-8169.150510

Implementation of Collaborative Filtering Approach in Preference Aware Service Recommendation

Service recommendations are shown as remarkable tools for providing recommendations to users in an appropriate way. In the last few years, the number of customers, online information and services has grown very rapidly, resulting in the big data analysis problem for service recommendation system. Consequently, there is scalability and inefficiency problems associated with the traditional service recommendation system which suffers in processing or analyzing large-scale data. Moreover, most of available service recommendation system gives the same rankings and ratings of services to different users without any considerations of many user’s preferences, and hence it fails to reach user’s personalized requirements. In this paper, we have proposed a Preference-Aware Service Recommendation method, to overcome the above challenges. It aims at recommending the most appropriate and preferred services to the users and provide a personalized service recommendation list in an effective way. Here, users' preferences are captured as keywords, and a user-based Collaborative filtering approach is adopted to create appropriate recommendations. A widely-adopted distributed computing platform, Hadoop is used for the implementation of this approach, which improves its efficiency and scalability in big data environment, using the MapReduce parallel processing method. DOI: 10.17762/ijritcc2321-8169.15034

Methods and algorithms for service selection and recommendation (preference and aggregation based)

In order for service users to get the best service that meets their requirements, they prefer to personalize their non-functional attributes, such as reliability and price. However, the personalization makes it challenging because service providers have to deal with conflicting non-functional attributes when selecting services for users. In addition, users may sometimes want to explicitly specify their trade-offs among non-functional attributes to make their preferences known to service providers. Typically, users\u27 service search requests with conflicting non-functional attributes may result in a ranked list of services that partially meet their needs. When this happens, it is natural for users to submit other similar requests, with varying preferences on non-functional attributes, in an attempt to find services that fully meet their needs. This situation produces a challenge for the users to choose an optimal service based on their preferences, from the multiple ranked lists that partially satisfy their request. Existing memory-based collaborative filtering (CF) service recommendation methods that employ this recommendation technique usually depend on non-functional attribute values obtained at service invocation to compute the similarity between users or items, and also to predict missing non-functional attributes. However, this approach is not sufficient because the non-functional attribute values of invoked services may not necessarily satisfy their personalized preferences. The main contributions of this work are threefold. First, a novel service selection method, which is based on fuzzy logic, that considers users\u27 personalized preferences and their trade-offs on non-functional attributes during service selection is presented. Second, a method that aggregates multiple ranked lists of services into a single aggregated ranked list, where top ranked services are selected for the user is also presented. Two algorithms were proposed: 1) Rank Aggregation for Complete Lists (RACoL), that aggregates complete ranked lists and 2) Rank Aggregation for Incomplete Lists (RAIL) to aggregate incomplete ranked lists. Finally, a CF-based service recommendation method that considers users\u27 personalized preference on non-functional attributes if proposed. Examples using real-world services are presented to evaluate the proposed methods and experiments are carried out to validate their performance --Abstract, page iii

Information Filtering on Coupled Social Networks

In this paper, based on the coupled social networks (CSN), we propose a hybrid algorithm to nonlinearly integrate both social and behavior information of online users. Filtering algorithm based on the coupled social networks, which considers the effects of both social influence and personalized preference. Experimental results on two real datasets, \emph{Epinions} and \emph{Friendfeed}, show that hybrid pattern can not only provide more accurate recommendations, but also can enlarge the recommendation coverage while adopting global metric. Further empirical analyses demonstrate that the mutual reinforcement and rich-club phenomenon can also be found in coupled social networks where the identical individuals occupy the core position of the online system. This work may shed some light on the in-depth understanding structure and function of coupled social networks

The state-of-the-art in personalized recommender systems for social networking

With the explosion of Web 2.0 application such as blogs, social and professional networks, and various other types of social media, the rich online information and various new sources of knowledge flood users and hence pose a great challenge in terms of information overload. It is critical to use intelligent agent software systems to assist users in finding the right information from an abundance of Web data. Recommender systems can help users deal with information overload problem efficiently by suggesting items (e.g., information and products) that match users’ personal interests. The recommender technology has been successfully employed in many applications such as recommending films, music, books, etc. The purpose of this report is to give an overview of existing technologies for building personalized recommender systems in social networking environment, to propose a research direction for addressing user profiling and cold start problems by exploiting user-generated content newly available in Web 2.0