Task Allocation in Case-Based Recommender Systems

2011 ◽  
pp. 268-279 ◽  
Author(s):  
Fabiana Lorenzi ◽  
Daniela Scherer dos Santos ◽  
Denise de Oliveira ◽  
Ana L.C. Bazzan
Keyword(s):  
Swarm Intelligence ◽  
Recommender Systems ◽  
Recommender System ◽  
Task Allocation ◽  
User Preferences ◽  
Cooperative Agents ◽  
Over Time ◽  
Case Based

Case-based recommender systems can learn about user preferences over time and automatically suggest products that fit these preferences. In this chapter, we present such a system, called CASIS. In CASIS, we combined the use of swarm intelligence in the task allocation among cooperative agents applied to a case-based recommender system to help the user to plan a trip.

Modelling trust networks using resistive circuits for trust-aware recommender systems

2016 ◽  
Vol 43 (1) ◽  
pp. 135-144 ◽  
Author(s):  
Mehdi Hosseinzadeh Aghdam ◽  
Morteza Analoui ◽  
Peyman Kabiri
Keyword(s):  
Collaborative Filtering ◽  
Recommender Systems ◽  
Recommender System ◽  
Cold Start ◽  
User Preferences ◽  
Item Selection ◽  
Trust Networks ◽  
Trust Inference ◽  
Trust Information

Recommender systems have been widely used for predicting unknown ratings. Collaborative filtering as a recommendation technique uses known ratings for predicting user preferences in the item selection. However, current collaborative filtering methods cannot distinguish malicious users from unknown users. Also, they have serious drawbacks in generating ratings for cold-start users. Trust networks among recommender systems have been proved beneficial to improve the quality and number of predictions. This paper proposes an improved trust-aware recommender system that uses resistive circuits for trust inference. This method uses trust information to produce personalized recommendations. The result of evaluating the proposed method on Epinions dataset shows that this method can significantly improve the accuracy of recommender systems while not reducing the coverage of recommender systems.

Toward Geospatial Collaborative Tourism Recommender Systems

2018 ◽  
pp. 212-248
Author(s):  
Zahra Bahramian ◽  
Rahim Ali Abbaspour ◽  
Christophe Claramunt
Keyword(s):  
Recommender Systems ◽  
Recommender System ◽  
World Wide ◽  
Information Overload ◽  
Spatial Information ◽  
User Profile ◽  
User Preferences ◽  
Research Issues ◽  
The World ◽  
Information Finding

Tourism activities are highly dependent on spatial information. Finding the most interesting travel destinations and attractions and planning a trip are still open research issues to GIScience research applied to the tourism domain. Nowadays, huge amounts of information are available over the world wide web that may be useful in planning a visit to destinations and attractions. However, it is often time consuming for a user to select the most interesting destinations and attractions and plan a trip according to his own preferences. Tourism recommender systems (TRSs) can be used to overcome this information overload problem and to propose items taking into account the user preferences. This chapter reviews related topics in tourism recommender systems including different tourism recommendation approaches and user profile representation methods applied in the tourism domain. The authors illustrate the potential of tourism recommender systems as applied to the tourism domain by the implementation of an illustrative geospatial collaborative recommender system using the Foursquare dataset.

scholarly journals A fuzzy preference tree-based recommender system for medical database

2017 ◽  
Vol 7 (1.1) ◽  
pp. 319
Author(s):  
Pradeepini Gera ◽  
Vishnu Bhargavi Sabbisetty ◽  
Tejaswini Devarasetty ◽  
Madhusri Nukala ◽  
Navyasri Vittamsetty
Keyword(s):  
Recommender Systems ◽  
Fuzzy Set ◽  
Recommender System ◽  
Critical Path ◽  
User Preferences ◽  
Medical Database ◽  
Matching Method ◽  
Tree Structures ◽  
Medical Dataset ◽  
Fuzzy Preference

Nowadays every online site is using personalized recommender systems to suggest a right product for the customer. But existing system has tree structures and have unrequired items in the user preferences. So, it requires high memory and time. To overcome this issue,proposed a new method with increased performance. Firstly, introduced a technique for modeling fuzzy tree-established consumer pref-erences, in which fuzzy set techniques are used to express user choices. A recommendation approach to recommend tree-dependent items is then advanced. The critical path on this study is a comprehensive tree matching method, which can compare two tree-established facts and identify their corresponding components by taking into consideration of all the records on tree structures, weights, and the nodeattributes.The proposed fuzzy preference tree based recommender system is tested using a medical dataset.

PREFERENCE DOMINANCE REASONING FOR CONVERSATIONAL RECOMMENDER SYSTEMS: A COMPARISON BETWEEN A COMPARATIVE PREFERENCES AND A SUM OF WEIGHTS APPROACH

2011 ◽  
Vol 20 (04) ◽  
pp. 591-616 ◽  
Author(s):  
WALID TRABELSI ◽  
NIC WILSON ◽  
DEREK BRIDGE ◽  
FRANCESCO RICCI
Keyword(s):  
Recommender Systems ◽  
Recommender System ◽  
Lexicographic Order ◽  
User Preferences ◽  
Query Suggestion ◽  
Small Set

A conversational recommender system iteratively shows a small set of options for its user to choose between. In order to select these options, the system may analyze the queries tried by the user to derive whether one option is dominated by others with respect to the user's preferences. The system can then suggest that the user try one of the undominated options, as they represent the best options in the light of the user preferences elicited so far. This paper describes a framework for preference dominance. Two instances of the framework are developed for query suggestion in a conversational recommender system. The first instance of the framework is based on a basic quantitative preferences formalism, where options are compared using sums of weights of their features. The second is a qualitative preference formalism, using a language that generalises CP-nets, where models are a kind of generalised lexicographic order. A key feature of both methods is that deductions of preference dominance can be made efficiently, since this procedure needs to be applied for many pairs of options. We show that, by allowing the recommender to focus on undominated options, which are ones that the user is likely to be contemplating, both approaches can dramatically reduce the amount of advice the recommender needs to give to a user compared to what would be given by systems without this kind of reasoning.

On the Importance of Subtext in Recommender Systems

i-com ◽  
2015 ◽  
Vol 14 (1) ◽  
pp. 41-52 ◽  
Author(s):  
Peter Grasch ◽  
Alexander Felfernig
Keyword(s):  
Empirical Study ◽  
Recommender Systems ◽  
Recommender System ◽  
Unsolved Problem ◽  
Preference Elicitation ◽  
User Preferences ◽  
Session Length ◽  
Knowledge Based ◽  
Paralinguistic Information ◽  
Recommendation Strategy

AbstractConversational recommender systems have been shown capable of allowing users to navigate even complex and unknown application domains effectively. However, optimizing preference elicitation remains a largely unsolved problem. In this paper we introduce SPEECHREC, a speech-enabled, knowledge-based recommender system, that engages the user in a natural-language dialog, identifying not only purely factual constraints from the users’ input, but also integrating nuanced lexical qualifiers and paralinguistic information into the recommendation strategy. In order to assess the viability of this concept, we present the results of an empirical study where we compare SPEECHREC to a traditional knowledge-based recommender system and show how incorporating more granular user preferences in the recommendation strategy can increase recommendation quality, while reducing median session length by 46 %.

scholarly journals Integrating contextual sentiment analysis in collaborative recommender systems

PLoS ONE ◽  
2021 ◽  
Vol 16 (3) ◽  
pp. e0248695
Author(s):  
Nurul Aida Osman ◽  
Shahrul Azman Mohd Noah ◽  
Mohammad Darwich ◽  
Masnizah Mohd
Keyword(s):  
Sentiment Analysis ◽  
Recommender Systems ◽  
Recommender System ◽  
Information Overload ◽  
Contextual Information ◽  
User Preferences ◽  
Analysis Technique ◽  
Rating Model ◽  
Multiple Domains ◽  
Filtering Approach

Recently. recommender systems have become a very crucial application in the online market and e-commerce as users are often astounded by choices and preferences and they need help finding what the best they are looking for. Recommender systems have proven to overcome information overload issues in the retrieval of information, but still suffer from persistent problems related to cold-start and data sparsity. On the flip side, sentiment analysis technique has been known in translating text and expressing user preferences. It is often used to help online businesses to observe customers’ feedbacks on their products as well as try to understand customer needs and preferences. However, the current solution for embedding traditional sentiment analysis in recommender solutions seems to have limitations when involving multiple domains. Therefore, an issue called domain sensitivity should be addressed. In this paper, a sentiment-based model with contextual information for recommender system was proposed. A novel solution for domain sensitivity was proposed by applying a contextual information sentiment-based model for recommender systems. In evaluating the contributions of contextual information in sentiment-based recommendations, experiments were divided into standard rating model, standard sentiment model and contextual information model. Results showed that the proposed contextual information sentiment-based model illustrates better performance as compared to the traditional collaborative filtering approach.

scholarly journals Multi-stakeholder News Recommendation Using Hypergraph Learning

2020 ◽  
pp. 531-535 ◽  
Author(s):  
Alireza Gharahighehi ◽  
Celine Vens ◽  
Konstantinos Pliakos
Keyword(s):  
Recommender Systems ◽  
Recommender System ◽  
User Preferences ◽  
Multiple Stakeholders ◽  
Hypergraph Learning ◽  
News Agencies ◽  
Ranking Task ◽  
Multi Stakeholder ◽  
News Recommendation ◽  
Ranked List

AbstractRecommender systems are meant to fulfil user preferences. Nevertheless, there are multiple examples where users are not the only stakeholder in a recommendation platform. For instance, in news aggregator websites apart from readers, one can consider magazines (news agencies) or authors as other stakeholders. A multi-stakeholder recommender system generates a ranked list of items taking into account the preferences of multiple stakeholders. In this study, news recommendation is handled as a hypergraph ranking task, where relations between multiple types of objects and stakeholders are modeled in a unified hypergraph. The obtained results indicate that ranking on hypergraphs can be utilized as a natural multi-stakeholder recommender system that is able to adapt recommendations based on the importance of stakeholders.

A social recommender system by combining social network and sentiment similarity: A case study of healthcare

2016 ◽  
Vol 43 (5) ◽  
pp. 635-648 ◽  
Author(s):  
Donghui Yang ◽  
Chao Huang ◽  
Mingyang Wang
Keyword(s):  
Social Network ◽  
Social Context ◽  
Recommender Systems ◽  
Network Structure ◽  
Recommender System ◽  
User Preferences ◽  
Social Recommender System ◽  
Social Recommender Systems ◽  
The Social ◽  
New Framework

Social recommender systems aim to support user preferences and help users make better decisions in social media. The social network and the social context are two vital elements in social recommender systems. In this contribution, we propose a new framework for a social recommender system based on both network structure analysis and social context mining. Exponential random graph models (ERGMs) are able to capture and simulate the complex structure of a micro-blog network. We derive the prediction formula from ERGMs for recommending micro-blog users. Then, a primary recommendation list is created by analysing the micro-blog network structure. In the next step, we calculate the sentiment similarities of micro-blog users based on a sentiment feature set which is extracted from users’ tweets. Sentiment similarities are used to filter the primary recommendation list and find users who have similar attitudes on the same topic. The goal of those two steps is to make the social recommender system much more precise and to satisfy users’ psychological preferences. At the end, we use this new framework deal with big real-world data. The recommendation results of diabetes accounts of Weibo show that our method outperforms other social recommender systems.

scholarly journals Improving Ant Collaborative Filtering on Sparsity via Dimension Reduction

2020 ◽  
Vol 10 (20) ◽  
pp. 7245
Author(s):  
Xiaofeng Liao ◽  
Xiangjun Li ◽  
Qingyong Xu ◽  
Hu Wu ◽  
Yongji Wang
Keyword(s):  
Collaborative Filtering ◽  
Recommender Systems ◽  
User Preferences ◽  
Ant Colony ◽  
Training Data ◽  
Practical Recommendation ◽  
Preference Change ◽  
Change Over Time ◽  
Unique Type ◽  
Over Time

Recommender systems should be able to handle highly sparse training data that continues to change over time. Among the many solutions, Ant Colony Optimization, as a kind of optimization algorithm modeled on the actions of an ant colony, enjoys the favorable characteristic of being optimal, which has not been easily achieved by other kinds of algorithms. A recent work adopting genetic optimization proposes a collaborative filtering scheme: Ant Collaborative Filtering (ACF), which models the pheromone of ants for a recommender system in two ways: (1) use the pheromone exchange to model the ratings given by users with respect to items; (2) use the evaporation of existing pheromone to model the evolution of users’ preference change over time. This mechanism helps to identify the users and the items most related, even in the case of sparsity, and can capture the drift of user preferences over time. However, it reveals that many users share the same preference over items, which means it is not necessary to initialize each user with a unique type of pheromone, as was done with the ACF. Regarding the sparsity problem, this work takes one step further to improve the Ant Collaborative Filtering’s performance by adding a clustering step in the initialization phase to reduce the dimension of the rate matrix, which leads to the results that K<<#users, where K is the number of clusters, which stands for the maximum number of types of pheromone carried by all users. We call this revised version the Improved Ant Collaborative Filtering (IACF). Experiments are conducted on larger datasets, compared with the previous work, based on three typical recommender systems: (1) movie recommendations, (2) music recommendations, and (3) book recommendations. For movie recommendation, a larger dataset, MoviesLens 10M, was used, instead of MoviesLens 1M. For book recommendation and music recommendation, we used a new dataset that has a much larger size of samples from Douban and NetEase. The results illustrate that our IACF algorithm can better deal with practical recommendation scenarios that handle sparse dataset.

An efficient semantic recommender method forArabic text

2019 ◽  
Vol 37 (2) ◽  
pp. 263-280 ◽  
Author(s):  
Bilal Hawashin ◽  
Shadi Alzubi ◽  
Tarek Kanan ◽  
Ayman Mansour
Keyword(s):  
Recommender Systems ◽  
Semantic Similarity ◽  
Recommender System ◽  
User Preferences ◽  
English Text ◽  
Arabic Text ◽  
Content Type ◽  
Semantic Relationships ◽  
Value Decomposition ◽  
Semantic Aspect

PurposeThis paper aims to propose a new efficient semantic recommender method for Arabic content.Design/methodology/approachThree semantic similarities were proposed to be integrated with the recommender system to improve its ability to recommend based on the semantic aspect. The proposed similarities are CHI-based semantic similarity, singular value decomposition (SVD)-based semantic similarity and Arabic WordNet-based semantic similarity. These similarities were compared with the existing similarities used by recommender systems from the literature.FindingsExperiments show that the proposed semantic method using CHI-based similarity and using SVD-based similarity are more efficient than the existing methods on Arabic text in term of accuracy and execution time.Originality/valueAlthough many previous works proposed recommender system methods for English text, very few works concentrated on Arabic Text. The field of Arabic Recommender Systems is largely understudied in the literature. Aside from this, there is a vital need to consider the semantic relationships behind user preferences to improve the accuracy of the recommendations. The contributions of this work are the following. First, as many recommender methods were proposed for English text and have never been tested on Arabic text, this work compares the performance of these widely used methods on Arabic text. Second, it proposes a novel semantic recommender method for Arabic text. As this method uses semantic similarity, three novel base semantic similarities were proposed and evaluated. Third, this work would direct the attention to more studies in this understudied topic in the literature.

Sign in / Sign up

Export Citation Format

Share Document