Collaborative Filtering Web Based Service Recommender System

(1)

Collaborative Filtering Web Based Service Recommender System

N.Akhilandeshwari¹,M.Sridevi² M.Tech Student¹, Associate Professor² Department of Computer Science and Engineering,

Anurag Group Of Institutions

Abstract-As numerous web services are increasing, selecting and recommending a web serviceto a user(handler)has become vital. Using collaborative filtering technique, we propose a system that can find optimal web service list for the service users based on their history. Collaborative filtering (CF) filters informationby means of the recommendations of other users who share same interests of the target user. Cosine similarity approach is used for selection of better web service. It uses similarity measure algorithm in order to compute web services similarity that enables web service recommendations. In this proposed system, to improve prediction precisionHybrid Clustering technique is used. For estimating the system’s performance, experiments are conducted on Cosine using Hybrid clustering technique.

Keywords: Recommendation Systems, Web Services, Collaborative Filtering, Cosine Similarity, Hybrid Clustering Technique, memory based, Quality of Service.

______________________________________________________________________________

1. INTRODUCTION

Network application components areWeb services (WS).It is created, searched also used by users on the Web [1].

As there are huge web services available over the internet, selecting and referencing a web service to a user has become challenge [2]. The challenge here is not web service discovery but web service selection and reference. It helps users to find optimal web services [5] [3] [4] [6]. Effective web service referencing depends on non-functional and functional requirements.The functionalitiesdone via a service comes under functional requirements. Quality of service signifies the non-functional features of web services. As web services are expanding, providing a better Quality of service has become a challenge for the service providers. QoS may referredas response time, reliability, performance, round trip time, availability, security, scalability etcRecommendation System is used to reference a web service to a user.The recommendation system collects information of different items and gives references to a particular user who has not experienced it.Collaborative filtering recommendation is one among the five recommendation methods [7]. References are made to a user by finding similar users who show similar interest of that of an active user in Collaborative Recommendation [8].Collaborative filtering recommends any product to an active user based on his past history. It is impossible for active user to useentire services. So, Quality of service values of those are not known.There are drawbacks in CollaborativeFiltering like cold start problem, scalability, data sparsity. When most of the information is not present it leads to data sparsity problem. If a product is new in the market, then it may not have rankings. This leads to cold start problem.When users evaluate the service themselves the following drawbacks occur. Firstly, it consumes time and cost of users. Secondly there are many web services from which it is difficult to select one.This paper uses memory-based CF algorithms and recommends a suitable web service for the target user to remove the mentioned drawbacks. The collaborative filtering calculates similarities among users or items. After finding similarity between users and items, Top K recommendation algorithm is used to reference top K ranked web services to a target user.

2. RELATED WORK

CFis techniquein recommender system. It is a process of finding analogous handlers and analogous WS and

(2)

referencing what analogoususers are interested.CF recommends any product to an active user based on his past history. A user cannot useall theservices. So QoS values of those services are not known. It is necessary to calculate the qos values for selecting the appropriate web services. Rich proposed the CF. It makes calculations about the interests of a user by collecting information from similar user who expresses similar interest of that of an active user.

First it finds the similar users for an active user for making a user-item matrix and then makes predictions. The user gives his opinion by rating items. Collaborative filtering is based on user-item matrix. It gives personalized recommendations. Collaborative filtering consists of two processes.Predictionmakes predictions based on user’s interests [9].Recommendationrecommends an optimal set of web services for active user. This is called Top–N recommendation (TN recommendation) [9].

Users\Web Services X Y Z

G 2200ms ? 2100ms

I 1400ms 2300ms ?

F 2100ms ? 1800ms

The above table shows the user-web services matrix in which G, I, F are users and X, Y, Z are web services. The figuresabove show the RT (Qos) values.If a user has not used the service it is indicated by Question mark.

Collaborative filtering methodologies are of two types.

Model based Collaborative filtering learns a model in order to make predictions. The model is built by learning information from a huge database related to a parameter or attribute. The model is built by using either statistical methods or machine learning techniques. Then instead of using huge database it makes recommendations by using the model. The most common Model based CF is Matrix Factorization. It is used in Quality of service valuesprediction [10]. Other Model based techniques are clustering patterns[13],latent semantic patterns [14,15],latent factor patterns [16].

Memory Based CF makes predictions based on data stored in memory. Memory based CF is divided into NN algorithm and top N recommendation algorithms. NN algorithm is used most often. A neighbor is referred to as a user who is alike to the active handler in respect to preferences. Top N (TN) recommendation is used to reference topmost N ranked web services to a target user.

Consistent with nearest neighbor based algorithms the memory based recommendations are divided into two[11]

User based Filtering will take a particular user, finds user who are similar to that particular user centered on handlerrankings and recommends items to that user.[17][18]

Item based Filteringwill take a particular item, finds user who liked that item and searches other items that similar users like.[19][20]

3. PROPOSED METHODOLOGY 3.1 System Architecture

Thearchitecture [12] of recommendation system is given below. In this the input is a group of WS in which Quality of services is major concern. First, when the user queries reach, the find similar users method is invoked. If we have to find set of similar web services then design process is invoked. A database of collected Quality of service is maintained to find the likenessesamong the target handler and set of anotherhandler. The qoscalculation method

(3)

obtains the unknown values of the target handler. The lower quality WS are removed by pruning. The qosbased selection method is invoked to recommend the best web service to the target user.

3.2Cosine-based correlation

where X=X_u∩ 𝑋𝑣is the group of WSused by users uand vand Y= 𝑌^𝑠∩ 𝑌^𝑞is the group of handlers who usedtwo services s and q. (1) is for calculating the likenessamonghandlers, whereas (2), calculates the likenessamidWS.

Correspondence values analyzed by (1) and (2) remain in the interval -1 to 1.

3.2.1 Cosine-Based Similarity

In cosine similarity, two items are assumed as two paths. It computes the cosine angleamidthese paths and it measures the resemblance among them.

Collected Qos data

Web Service Monitor

Web Services Find

similar users

QoS Prediction

Pruning

Qos Based Selection Design

Process

(4)

3.3Hybrid Clustering Algorithm

The Algorithm is used to select a group of analogous item or group of analogousneighbors for end users. Hybrid clustering technique usesuser-based similarity and item-based similarity and gives the output S(x). K is the top selected web services from the existing ones.

The procedure of user-based clustering is given below

4. CONCLUSION

In this paper, a brief description of recommendation system is given. Cosine similarity is used for recommending web services. Similarity is found between different users and different web services. Hybrid Clustering algorithm is used for forecasting the unknownQoS values. Based on these two, the WS are recommended to the end user andestimate accuracy is improved.

5.REFERENCES

1. Zhang L.J, Cai H, Zhang J, “Services Computing- Core Enabling Technology of the Modern Services”

Industry Tsinghua University Press,07.

2. Ishikawa F, Klein, Honiden S “Towards network aware service composition in the cloud,” in Proc. Of the 21^st ACM World Wide Web Conference, pp. 959-968. 2012

3. Lyu M.R., Ma H, Zheng Z, “Wsrec: A Collaborative filtering-based web service recommender system,” in Proc. Of the ICWS, pp.437-444, 2009

4. Liu X, Sun H, Guo X,” Temporal qos aware web service recommendation via non-negative tensor factorization,” in Proc. Of the 23^rd International www conference, pp. 585-596, 2014

(5)

5. Q.Yu, Z. Zheng, X. Chen , “Web Service Recommendation via exploiting location and qos information,”

IEEE Trans. Parallel Distributed Systems, vol. 25, no. 7, 2014, pp 1913-1924.

6. M P Singh, R M Sreenath, “Agent Based service selection,” vol 1, no.3, 2003, pp. 261-279.

7. Jadhav D, Peerzade S, Vanitha, “A Review on web service recommendation System using collaborative filtering” IPASJ International Journal of Computer Science, vol. 3, Issue 3, 2015

8. Rich E, “User modelling via stereotypes”, cognitive science, vol 3, no. 4,1979

9. Konstan J, Sarwar B, Reidl J, “Item based collaborative filtering recommendation algorithms” International www conference,2001, pp.285-95

10. Li Y, Wu Z, Lo W, “An extended matrix factorization approach for qos prediction in service selection,” in Proc. Of the 9^th IEEE International Conference on Service Computing, pp. 162-69,2012

11. Zhang J, Shao L, Xei B, “Personalized qos prediction for web service via collaborative filtering,” in Proc.

Of the IEEE International Conferences on web services, pp. 439-446, 2007

12. Liang Chen, Zibin Zheng, Jian Wu, “Predicting Quality of service for selection by neighborhood-based collaborative filtering,” in IEEE Transactions on systems, man and Cybernetics’: systems, 2013, vol.43 13. Lin C, Xue G, Xi W, Yu Y, “Scalable collaborative filtering using cluster-based smoothing,” in Proc. 28^th

International ACM SIGIR Conference on Research and devp in information Retrieval, pp. 114-121, 2005.

14. Hofmann T, “collaborative filtering via gaussian probabilistic latent semantic analysis,” in Proc. 26^th International ACM SIGIR Conference on Research and development in information Retrieval, pp. 259-66, 2003.

15. T Hofmann, “Latent semantic models for collaborative filtering,” ACM Transactions on information system, 2014, Vol. 22, No. 1, pp. 89-115.

16. Canny J, “collaborative filtering with privacy via factor analysis,” in Proc. Of 25^th international ACM SIGIR Conference, pp. 238-45. 2002.

17. Kadie C, Breese J S, “Empirical Analysis of predictive algorithms for collaborative filtering,” pp.43-52, 1998, in Proc. Of the 14^th Annual conference uncertainty in Artificial Intelligence.

18. Reidl J, Borchers A, “An algorithmic framework for performing collaborative filtering,” in Proc. 22^nd International ACM SIGIR Conference on research and development in information retrieval, pp.230-37, 1999

19. Karypis G, Deshpande M, “Item based top N recommendation algorithms,” ACM Transactions on information system, 2004, Vol. 22, No. 1, pp. 143-177.

20. Smith B, York J, “Amazon.com recommendations: Item-Item Collaborative Filtering,” IEEE Internet Computing, Vol.7, No.1, 2003, pp.76-78.