Clustering and Recommending Services based on ClubCF approach for Big Data Application

K. Jabeer Hussain*, P. Srinivasa Reddi**, Kasarapu Ramani***
* M.Tech Scholar, Department of Information Technology, Sree vidyanikethan Engineering College, India.
** Associate Professor, Department of Information Technology, Sree vidyanikethan Engineering College, India.
*** Professor & Head, Department of Information Technology, Sree vidyanikethan Engineering College, India.
Periodicity:March - May'2015
DOI : https://doi.org/10.26634/jit.4.2.3390

Abstract

The number of services emerging on the Internet are generating huge amount of data leading to big data. Storing such data using traditional storage approaches is impractical which can be solved using Big Table capable of storing number of services in the form of multi dimensional sorted map again searching for a services and to recommend it to the new users requires large computations. In the present work theses problems are solved by using the Clustering based Collaborative Filtering (ClubCF) approach and Mash Up data set with 6888 services along with their description and their functionality is considered for Clustering with the help of Agglomerative hierarchical clustering algorithm.

Keywords

Clustering, Collaborative Filtering, Recommendations, Big Data, Mash Up Data Set

How to Cite this Article?

Hussain. K. J, Reddi. P. S and Ramani. K (2015). Clustering and Recommending Services based on ClubCF approach for Big Data Application. i-manager’s Journal on Information Technology, 4(2), 27-32. https://doi.org/10.26634/jit.4.2.3390

References

[1]. Xiaoyuan Su and Taghi M. Khoshgoftaar., (2009). “A survey of Collaborative Filtering Technique” A Review article, Hindawi Publishing Corporation Advances in Artificial Intelligence, Received 9 February 2009; Accepted 3 August
[2]. A. Yamashita, H. Kawamura, and K. Suzuki, (2011). “Adaptive Fusion Method for User-based and Item-based Collaborative Filtering,” Advances in Complex Systems, Vol. 14, No. 2, pp. 133-149.
[3]. F. Chang, J. Dean, S. mawat, et al., (2008). “Big table: A distributed storage system for Structured data,” ACM Transactions. on Computer Systems, Vol. 26, No. 2, pp. 1- 39.
[4]. A. Rodriguez, W. A. Chaovalitwongse, L. Zhe L, et al., (2010). “Master defect record retrieval using networkbased feature association,” IEEE Trans. on Systems, Man, and Cybernetics, Part C: Applications and Reviews, Vol. 40, No. 3, pp. 319-329.
[5]. C. Platzer, F. Rosenberg, and S. Dustdar, (2009). “Web service clustering using multidimensional angles as proximity measures,” ACM Transactions. on Internet Technology, Vol. 9, No. 3, pp. 11:1-11:26.
[6]. G. Thilagavathi, D. Srivaishnavi, N. Aparna, et al., (2013). “A Survey on Efficient Hierarchical Algorithm used in Clustering,” International Journal of Engineering, Vol. 2, No. 9.
[7]. G. Adomavicius, and J. Zhang, (2012). “Stability of Recommendation Algorithms,” ACM Transactions. On Information Systems, Vol. 30, No. 4, pp. 23:1-23:31.
[8]. D. Julie, and K. A. Kumar, (2012). “Optimal Web Service Selection Scheme With Dynamic QoS Property Assignment,” International Journal of Advanced research in technology, Vol.2, No.2, pp. 69-75.
If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Single Article

North Americas,UK,
Middle East,Europe
India Rest of world
USD EUR INR USD-ROW
Pdf 35 35 200 20
Online 35 35 200 15
Pdf & Online 35 35 400 25

Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.