System Oriented Social Scrutinizer: Centered Upon Mutual Profile Erudition

Social recommender systems are getting up more attention for product advertisement and social connectivity. A good recommender               should think about the system and the user. The user will have a preference list of some items and these preferences can be useful in suggesting the things which can help the endorsing system to identify better items. In this paper, the idea of social recommender systems as a pattern matching and regular expression making is used for unification of similarities. The concept of mutual profile pattern expression can be applied on various networking platforms. In these type of shared platforms, people all around the globe share resources and interact with each other. In order to manage or scrutinize users according to their interests and likeness, the mutual profile pattern of users can be used. Further predicting of membership function is performed to show how much extent does the profile matches

A Collaborative Filtering Probabilistic Approach for Recommendation to Large Homogeneous and Automatically Detected Groups

In the collaborative filtering recommender systems (CFRS) field, recommendation to group of users is mainly focused on stablished, occasional or random groups. These groups have a little number of users: relatives, friends, colleagues, etc. Our proposal deals with large numbers of automatically detected groups. Marketing and electronic commerce are typical targets of large homogenous groups. Large groups present a major difficulty in terms of automatically achieving homogeneity, equilibrated size and accurate recommendations. We provide a method that combines diverse machine learning algorithms in an original way: homogeneous groups are detected by means of a clustering based on hidden factors instead of ratings. Predictions are made using a virtual user model, and virtual users are obtained by performing a hidden factors aggregation. Additionally, this paper selects the most appropriate dimensionality reduction for the explained RS aim. We conduct a set of experiments to catch the maximum cumulative deviation of the ratings information. Results show an improvement on recommendations made to large homogeneous groups. It is also shown the desirability of designing specific methods and algorithms to deal with automatically detected groups

KNN-based clustering for improving social recommender systems

Clustering is useful in tag based recommenders to reduce sparsity of data and by doing so to improve also accuracy of recommendation. Strategy for the selection of tags for clusters has an impact on the accuracy. In this paper we propose a KNN based approach for ranking tag neighbors for tag selection. We study the approach in comparison to several baselines by using two datasets in different domains. We show, that in both cases the approach outperforms the compared approaches. © 2013 Springer-Verlag