Session details: System software and security: RS - recommender systems: theory, user interactions and applications track

2018 ◽  
Keyword(s):  
Systems Theory ◽  
Recommender Systems ◽  
System Software ◽  
User Interactions

scholarly journals A Soft-Rough Set Based Approach for Handling Contextual Sparsity in Context-Aware Video Recommender Systems

Mathematics ◽  
2019 ◽  
Vol 7 (8) ◽  
pp. 740 ◽  
Author(s):  
Syed Manzar Abbas ◽  
Khubaib Amjad Alam ◽  
Shahaboddin Shamshirband
Keyword(s):  
Recommender Systems ◽  
Rough Sets ◽  
Selection Process ◽  
Contextual Information ◽  
Context Aware ◽  
User Interactions ◽  
Information Selection ◽  
Proposed Model ◽  
Research Challenge ◽  
Selection Of

Context-aware video recommender systems (CAVRS) seek to improve recommendation performance by incorporating contextual features along with the conventional user-item ratings used by video recommender systems. In addition, the selection of influential and relevant contexts has a significant effect on the performance of CAVRS. However, it is not guaranteed that, under the same contextual scenario, all the items are evaluated by users for providing dense contextual ratings. This problem cause contextual sparsity in CAVRS because the influence of each contextual factor in traditional CAVRS assumes the weights of contexts homogeneously for each of the recommendations. Hence, the selection of influencing contexts with minimal conflicts is identified as a potential research challenge. This study aims at resolving the contextual sparsity problem to leverage user interactions at varying contexts with an item in CAVRS. This problem may be investigated by considering a formal approximation of contextual attributes. For the purpose of improving the accuracy of recommendation process, we have proposed a novel contextual information selection process using Soft-Rough Sets. The proposed model will select a minimal set of influencing contexts using a weights assign process by Soft-Rough sets. Moreover, the proposed algorithm has been extensively evaluated using “LDOS-CoMoDa” dataset, and the outcome signifies the accuracy of our approach in handling contextual sparsity by exploiting relevant contextual factors. The proposed model outperforms existing solutions by identifying relevant contexts efficiently based on certainty, strength, and relevancy for effective recommendations.

scholarly journals Feature Selection for Recommender Systems with Quantum Computing

Entropy ◽  
2021 ◽  
Vol 23 (8) ◽  
pp. 970
Author(s):  
Riccardo Nembrini ◽  
Maurizio Ferrari Dacrema ◽  
Paolo Cremonesi
Keyword(s):  
Feature Selection ◽  
Quantum Computing ◽  
Recommender Systems ◽  
Domain Knowledge ◽  
Optimization Problems ◽  
Quantum Computer ◽  
Mathematical Formulation ◽  
Easy Access ◽  
Quantum Computers ◽  
User Interactions

The promise of quantum computing to open new unexplored possibilities in several scientific fields has been long discussed, but until recently the lack of a functional quantum computer has confined this discussion mostly to theoretical algorithmic papers. It was only in the last few years that small but functional quantum computers have become available to the broader research community. One paradigm in particular,quantum annealing, can be used to sample optimal solutions for a number of NP-hard optimization problems represented with classical operations research tools, providing an easy access to the potential of this emerging technology. One of the tasks that most naturally fits in this mathematical formulation is feature selection. In this paper, we investigate how to design a hybrid feature selection algorithm for recommender systems that leverages the domain knowledge and behavior hidden in the user interactions data. We represent the feature selection as an optimization problem and solve it on a real quantum computer, provided by D-Wave. The results indicate that the proposed approach is effective in selecting a limited set of important features and that quantum computers are becoming powerful enough to enter the wider realm of applied science.

scholarly journals Improve the Performance of Advice Systems Based on Cooperative Liquidation Using Trust Relationships

2019 ◽  
Vol 27 (1) ◽  
pp. 87-106
Author(s):  
EEva Diab Hriekes ◽  
Yosser AlSayed Souleiman AlAtassi
Keyword(s):  
Social Context ◽  
Collaborative Filtering ◽  
Recommender Systems ◽  
Information Overload ◽  
User Preferences ◽  
User Interactions ◽  
Trust Relationships ◽  
Recommendation Accuracy ◽  
User Reputation ◽  
User Ratings

Recommender systems are one of the recent inventions to deal with information overload problem and provide users with personalized recommendations that may be of their interests. Collaborative filtering is the most popular and widely used technique to build recommender systems and has been successfully employed in many applications. However, collaborative filtering suffers from several inherent issues that affect the recommendation accuracy such as: data sparsity and cold start problems caused by the lack of user ratings, so the recommendation results are often unsatisfactory. To address these problems, we propose a recommendation method called “MFGLT” that enhance the recommendation accuracy of collaborative filtering method using trust-based social networks by leveraging different  user's situations (as a trustor and as a trustee) in these networks to model user preferences. Specifically, we propose model-based method that uses matrix factorization technique and exploit both local social context represented by modeling explicit user interactions and implicit user interactions with other users, and also the global social context represented by the user reputation in the whole social network for making recommendations. Experimental results based on real-world dataset demonstrate that our approach gives better performance than the other trust-aware recommendation approaches, in terms of prediction accuracy.  

Sign in / Sign up

Export Citation Format

Share Document