Similarity-based Techniques for Trust Management

A network of people having established trust relations and a model for propagation of related trust scores are fundamental building blocks in many of todayŠs most successful e-commerce and recommendation systems. Many online communities are only successful if sufficient mu-tual trust between their members exists. Users want to know whom to trust and how muc

A Network Resource Allocation Recommendation Method with An Improved Similarity Measure

Recommender systems have been acknowledged as efficacious tools for managing information overload. Nevertheless, conventional algorithms adopted in such systems primarily emphasize precise recommendations and, consequently, overlook other vital aspects like the coverage, diversity, and novelty of items. This approach results in less exposure for long-tail items. In this paper, to personalize the recommendations and allocate recommendation resources more purposively, a method named PIM+RA is proposed. This method utilizes a bipartite network that incorporates self-connecting edges and weights. Furthermore, an improved Pearson correlation coefficient is employed for better redistribution. The evaluation of PIM+RA demonstrates a significant enhancement not only in accuracy but also in coverage, diversity, and novelty of the recommendation. It leads to a better balance in recommendation frequency by providing effective exposure to long-tail items, while allowing customized parameters to adjust the recommendation list bias

Alleviating the new user problem in collaborative filtering by exploiting personality information

The final publication is available at Springer via http://dx.doi.org/10.1007/s11257-016-9172-zThe new user problem in recommender systems is still challenging, and there is not yet a unique solution that can be applied in any domain or situation. In this paper we analyze viable solutions to the new user problem in collaborative filtering (CF) that are based on the exploitation of user personality information: (a) personality-based CF, which directly improves the recommendation prediction model by incorporating user personality information, (b) personality-based active learning, which utilizes personality information for identifying additional useful preference data in the target recommendation domain to be elicited from the user, and (c) personality-based cross-domain recommendation, which exploits personality information to better use user preference data from auxiliary domains which can be used to compensate the lack of user preference data in the target domain. We benchmark the effectiveness of these methods on large datasets that span several domains, namely movies, music and books. Our results show that personality-aware methods achieve performance improvements that range from 6 to 94 % for users completely new to the system, while increasing the novelty of the recommended items by 3-40 % with respect to the non-personalized popularity baseline. We also discuss the limitations of our approach and the situations in which the proposed methods can be better applied, hence providing guidelines for researchers and practitioners in the field.This work was supported by the Spanish Ministry of Economy and Competitiveness (TIN2013-47090-C3). We thank Michal Kosinski and David Stillwell for their attention regarding the dataset

Deep Learning based Recommender System: A Survey and New Perspectives

With the ever-growing volume of online information, recommender systems have been an effective strategy to overcome such information overload. The utility of recommender systems cannot be overstated, given its widespread adoption in many web applications, along with its potential impact to ameliorate many problems related to over-choice. In recent years, deep learning has garnered considerable interest in many research fields such as computer vision and natural language processing, owing not only to stellar performance but also the attractive property of learning feature representations from scratch. The influence of deep learning is also pervasive, recently demonstrating its effectiveness when applied to information retrieval and recommender systems research. Evidently, the field of deep learning in recommender system is flourishing. This article aims to provide a comprehensive review of recent research efforts on deep learning based recommender systems. More concretely, we provide and devise a taxonomy of deep learning based recommendation models, along with providing a comprehensive summary of the state-of-the-art. Finally, we expand on current trends and provide new perspectives pertaining to this new exciting development of the field.Comment: The paper has been accepted by ACM Computing Surveys. https://doi.acm.org/10.1145/328502

Multiple social network integration framework for recommendation across system domain

A recommender system is a special software that recommends items to a user based on the user’s history. A recommender system comprises users, items and a rating matrix. Rating matrix stores the interactions between users and items. The system faces a variety of problems among which three are the main concerns of this research. These problems are cold start, sparsity, and diversity. Majority of the research use a conventional framework for solving these problems. In a conventional recommender system, user profiles are generated from a single feedback source, whereas, Cross Domain Recommender Systems (CDRS) research relies on more than one source. Recently researchers have started using “Social Network Integration Framework”, that integrates social network as an additional feedback source. Although the existing framework alleviates recommendation problems better than the conventional framework, it still faces limitations. Existing framework is designed only for a single source domain and requires the same user participation in both the source and the target domain. Existing techniques are also designed to integrate knowledge from one social network only. To integrate multiple sources, this research developed a “Multiple Social Network Integration Framework”, that consists of two models and three techniques. Firstly, the Knowledge Generation Model generates interaction matrices from “n” number of source domains. Secondly, the Knowledge Linkage Model links the source domains to the target domain. The outputs of the models are inputs of the techniques. Then multiple techniques were developed to address cold start, sparsity and diversity problem using multiple source networks. Three techniques addressed the cold start problem. These techniques are Multiple Social Network integration with Equal Weights Participation (MSN-EWP), Multiple Social Network integration with Local Adjusted Weights Participation (MSNLAWP) and Multiple Social Network integration with Target Adjusted Weights Participation (MSN-TAWP). Experimental results showed that MSN-TAWP performed best by producing 47% precision improvement over popularity ranking as the baseline technique. For the sparsity problem, Multiple Social Network integration for K Nearest Neighbor identification (MSN-KNN) technique performed at least 30% better in accuracy while decreasing the error rate by 20%. Diversity problem was addressed by two combinations of the cold start and sparsity techniques. These combinations, EWP + MSN-KNN, TAWP + MSN-KNN and TAWP + MSN-KNN outperformed the rest of the diversity combinations by 56% gain in diversity with a precision loss of 1%. In conclusion, the techniques designed for multiple sources outperformed existing techniques for addressing cold start, sparsity and diversity problem. Finally, an extension of multiple social network integration framework for content-based and hybrid recommendation techniques should be considered future work