Graph based Recommendation System in Social Networks

  • Jindal H
  • Anjali A
N/ACitations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

Media content recommendation is a popular trend now days. Twitter, Facebook, and Google+ are very popular in the world. The growth of social networks has made recommendation systems one of the intensively studied research area in the last decades. Recommendation systems can be based on content filtering, collaborative filtering or both. In this paper, we propose a novel approach for media content recommendation based on collaborative filtering. Firstly the user-user social network is created using most prominent neighbor set of each user by utilizing their preference information. Then these users are clustered using their neighbor sets and the user with maximum neighbor count is chosen as cluster head. When new user searches for its cluster its similarity is calculated with all the cluster heads. The user gets recommendation based on the average ratings of his cluster members. The proposed approach is tested on the users of Movielens Dataset. The proposed approach gives a hit ratio of 89.33%, Mean Absolute Error as 0.4756 and Root Mean Square Error as 0.7671 on Movielens dataset.

Cite

CITATION STYLE

APA

Jindal, H., & Anjali, A. (2015). Graph based Recommendation System in Social Networks. International Journal of Computer Applications, 113(2), 36–40. https://doi.org/10.5120/19801-1583

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free