A Clustering-Based Similarity Measurement for Collaborative Filtering

Similarity measurement is a crucial process in collaborative filtering. User similarity is computed solely based on the numerical ratings of users. In this paper, we argue that the social information of users should be also taken into consideration to improve the performance of traditional similarity measurements. To achieve this, we propose a clustering-based similarity measurement approach incorporating user social information. In order to cluster the users effectively, we propose a novel distance metric based on taxonomy tree which can easily process the numerical and categorical information of users. Meanwhile, we also address how to determine the contribution of different types of information in the distance metric. After clustering the users, we introduce the incorporating strategy of our proposed similarity measurement. We perform a series of experiments on a real world dataset and compare the performance of our approach against that of traditional approaches. Experiments demonstrate that the proposed approach considerably outperforms the traditional approaches.

[1]  Elisa Bertino,et al.  Efficient k -Anonymization Using Clustering Techniques , 2007, DASFAA.

[2]  Young U. Ryu,et al.  Personalized Recommendation over a Customer Network for Ubiquitous Shopping , 2009, IEEE Transactions on Services Computing.

[3]  Param Vir Singh,et al.  A Hidden Markov Model for Collaborative Filtering , 2010, MIS Q..

[4]  Hidetomo Ichihashi,et al.  Collaborative Filtering Using Principal Component Analysis and Fuzzy Clustering , 2001, Web Intelligence.

[5]  John Riedl,et al.  GroupLens: an open architecture for collaborative filtering of netnews , 1994, CSCW '94.

[6]  Joshua Zhexue Huang,et al.  Extensions to the k-Means Algorithm for Clustering Large Data Sets with Categorical Values , 1998, Data Mining and Knowledge Discovery.

[7]  John Riedl,et al.  Item-based collaborative filtering recommendation algorithms , 2001, WWW '01.

[8]  Gang Yu,et al.  JacUOD: A New Similarity Measurement for Collaborative Filtering , 2012, Journal of Computer Science and Technology.

[9]  Gediminas Adomavicius,et al.  Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions , 2005, IEEE Transactions on Knowledge and Data Engineering.

[10]  Yongmoo Suh,et al.  A new similarity function for selecting neighbors for each target item in collaborative filtering , 2013, Knowl. Based Syst..

[11]  Qiang Yang,et al.  Scalable collaborative filtering using cluster-based smoothing , 2005, SIGIR '05.

[12]  Michael R. Lyu,et al.  Effective missing data prediction for collaborative filtering , 2007, SIGIR.

[13]  Douglas B. Terry,et al.  Using collaborative filtering to weave an information tapestry , 1992, CACM.

[14]  Stefano Battiston,et al.  A model of a trust-based recommendation system on a social network , 2006, Autonomous Agents and Multi-Agent Systems.

[15]  Huseyin Polat,et al.  A comparison of clustering-based privacy-preserving collaborative filtering schemes , 2013, Appl. Soft Comput..

[16]  Fernando Ortega,et al.  A collaborative filtering similarity measure based on singularities , 2012, Inf. Process. Manag..

[17]  Kyong Joo Oh,et al.  The collaborative filtering recommendation based on SOM cluster-indexing CBR , 2003, Expert Syst. Appl..

[18]  Cihan Kaleli An entropy-based neighbor selection approach for collaborative filtering , 2014, Knowl. Based Syst..

[19]  Chun-Chia Lee,et al.  AIMED- A Personalized TV Recommendation System , 2006, EuroITV.