scholarly journals Towards Cognitive Recommender Systems

Algorithms ◽  
2020 ◽  
Vol 13 (8) ◽  
pp. 176
Author(s):  
Amin Beheshti ◽  
Shahpar Yakhchi ◽  
Salman Mousaeirad ◽  
Seyed Mohssen Ghafari ◽  
Srinivasa Reddy Goluguri ◽  
...  
Keyword(s):  
Recommender Systems ◽  
State Of The Art ◽  
User Preferences ◽  
Data Driven ◽  
New Approach ◽  
Domain Experts ◽  
Adaptive Mechanisms ◽  
New Type ◽  
Cognitive Activities ◽  
Time Aware

Intelligence is the ability to learn from experience and use domain experts’ knowledge to adapt to new situations. In this context, an intelligent Recommender System should be able to learn from domain experts’ knowledge and experience, as it is vital to know the domain that the items will be recommended. Traditionally, Recommender Systems have been recognized as playlist generators for video/music services (e.g., Netflix and Spotify), e-commerce product recommenders (e.g., Amazon and eBay), or social content recommenders (e.g., Facebook and Twitter). However, Recommender Systems in modern enterprises are highly data-/knowledge-driven and may rely on users’ cognitive aspects such as personality, behavior, and attitude. In this paper, we survey and summarize previously published studies on Recommender Systems to help readers understand our method’s contributions to the field in this context. We discuss the current limitations of the state of the art approaches in Recommender Systems and the need for our new approach: A vision and a general framework for a new type of data-driven, knowledge-driven, and cognition-driven Recommender Systems, namely, Cognitive Recommender Systems. Cognitive Recommender Systems will be the new type of intelligent Recommender Systems that understand the user’s preferences, detect changes in user preferences over time, predict user’s unknown favorites, and explore adaptive mechanisms to enable intelligent actions within the compound and changing environments. We present a motivating scenario in banking and argue that existing Recommender Systems: (i) do not use domain experts’ knowledge to adapt to new situations; (ii) may not be able to predict the ratings or preferences a customer would give to a product (e.g., loan, deposit, or trust service); and (iii) do not support data capture and analytics around customers’ cognitive activities and use it to provide intelligent and time-aware recommendations.

scholarly journals User-Involved Preference Elicitation for Product Search and Recommender Systems

AI Magazine ◽  
2008 ◽  
Vol 29 (4) ◽  
pp. 93 ◽  
Author(s):  
Pearl Pu ◽  
Li Chen
Keyword(s):  
Recommender Systems ◽  
State Of The Art ◽  
Preference Elicitation ◽  
Design Guidelines ◽  
User Preferences ◽  
The State ◽  
User Preference ◽  
Large Collection ◽  
Complete Model ◽  
Product Search

We address user system interaction issues in product search and recommender systems: how to help users select the most preferential item from a large collection of alternatives. As such systems must crucially rely on an accurate and complete model of user preferences, the acquisition of this model becomes the central subject of our paper. Many tools used today do not satisfactorily assist users to establish this model because they do not adequately focus on fundamental decision objectives, help them reveal hidden preferences, revise conflicting preferences, or explicitly reason about tradeoffs. As a result, users fail to find the outcomes that best satisfy their needs and preferences. In this article, we provide some analyses of common areas of design pitfalls and derive a set of design guidelines that assist the user in avoiding these problems in three important areas: user preference elicitation, preference revision, and explanation interfaces. For each area, we describe the state-of-the-art of the developed techniques and discuss concrete scenarios where they have been applied and tested.

scholarly journals From Community Detection to Mentor Selection in Rating-Free Collaborative Filtering

2011 ◽  
Vol 2011 ◽  
pp. 1-19
Author(s):  
Armelle Brun ◽  
Sylvain Castagnos ◽  
Anne Boyer
Keyword(s):  
Collaborative Filtering ◽  
Recommender Systems ◽  
Community Detection ◽  
Local Community ◽  
State Of The Art ◽  
New Approach ◽  
Detection Algorithms ◽  
Local Community Detection ◽  
The Web ◽  
Filtering Approach

The number of items that users can now access when navigating on the Web is so huge that these might feel lost. Recommender systems are a way to cope with this profusion of data by suggesting items that fit the users needs. One of the most popular techniques for recommender systems is the collaborative filtering approach that relies on the preferences of items expressed by users, usually under the form of ratings. In the absence of ratings, classical collaborative filtering techniques cannot be applied. Fortunately, the behavior of users, such as their consultations, can be collected. In this paper, we present a new approach to perform collaborative filtering when no rating is available but when user consultations are known. We propose to take inspiration from local community detection algorithms to form communities of users and deduce the set of mentors of a given user. We adapt one state-of-the-art algorithm so as to fit the characteristics of collaborative filtering. Experiments conducted show that the precision achieved is higher then the baseline that does not perform any mentor selection. In addition, our model almost offsets the absence of ratings by exploiting a reduced set of mentors.

scholarly journals Towards Comprehensive Recommender Systems: Time-Aware Unified Recommendations Based on Listwise Ranking of Implicit Cross-Network Data

2020 ◽  
Vol 34 (01) ◽  
pp. 189-197
Author(s):  
Dilruk Perera ◽  
Roger Zimmermann
Keyword(s):  
Recommender Systems ◽  
Web Applications ◽  
Auxiliary Information ◽  
Optimization Criterion ◽  
User Preferences ◽  
Implicit Feedback ◽  
Multiple Time ◽  
Ranking Problem ◽  
Target Network ◽  
Time Aware

The abundance of information in web applications make recommendation essential for users as well as applications. Despite the effectiveness of existing recommender systems, we find two major limitations that reduce their overall performance: (1) inability to provide timely recommendations for both new and existing users by considering the dynamic nature of user preferences, and (2) not fully optimized for the ranking task when using implicit feedback. Therefore, we propose a novel deep learning based unified cross-network solution to mitigate cold-start and data sparsity issues and provide timely recommendations for new and existing users. Furthermore, we consider the ranking problem under implicit feedback as a classification task, and propose a generic personalized listwise optimization criterion for implicit data to effectively rank a list of items. We illustrate our cross-network model using Twitter auxiliary information for recommendations on YouTube target network. Extensive comparisons against multiple time aware and cross-network baselines show that the proposed solution is superior in terms of accuracy, novelty and diversity. Furthermore, experiments conducted on the popular MovieLens dataset suggest that the proposed listwise ranking method outperforms existing state-of-the-art ranking techniques.

scholarly journals Improving Top-NRecommendation Performance Using Missing Data

2015 ◽  
Vol 2015 ◽  
pp. 1-13 ◽  
Author(s):  
Xiangyu Zhao ◽  
Zhendong Niu ◽  
Kaiyi Wang ◽  
Ke Niu ◽  
Zhongqiang Liu
Keyword(s):  
Missing Data ◽  
Recommender Systems ◽  
Matrix Factorization ◽  
State Of The Art ◽  
User Preferences ◽  
Missing Not At Random ◽  
Main Challenge ◽  
Recommendation Algorithms ◽  
Random Part ◽  
Problem Data

Recommender systems become increasingly significant in solving the information explosion problem. Data sparse is a main challenge in this area. Massive unrated items constitute missing data with only a few observed ratings. Most studies consider missing data as unknown information and only use observed data to learn models and generate recommendations. However, data are missing not at random. Part of missing data is due to the fact that users choose not to rate them. This part of missing data is negative examples of user preferences. Utilizing this information is expected to leverage the performance of recommendation algorithms. Unfortunately, negative examples are mixed with unlabeled positive examples in missing data, and they are hard to be distinguished. In this paper, we propose three schemes to utilize the negative examples in missing data. The schemes are then adapted with SVD++, which is a state-of-the-art matrix factorization recommendation approach, to generate recommendations. Experimental results on two real datasets show that our proposed approaches gain better top-Nperformance than the baseline ones on both accuracy and diversity.

scholarly journals A Novel Time-Aware Hybrid Recommendation Scheme Combining User Feedback and Collaborative Filtering

2020 ◽  
Vol 2020 ◽  
pp. 1-16
Author(s):  
Hongzhi Li ◽  
Dezhi Han
Keyword(s):  
Collaborative Filtering ◽  
Recommender Systems ◽  
Clustering Algorithm ◽  
Information Overload ◽  
User Feedback ◽  
User Preferences ◽  
User Preference ◽  
Logistic Regression Algorithm ◽  
Hybrid Recommendation ◽  
Time Aware

Nowadays, recommender systems are used widely in various fields to solve the problem of information overload. Collaborative filtering and content-based models are representative solutions in recommender systems; however, the content-based model has some shortcomings, such as single kind of recommendation results and lack of effective perception of user preferences, while for the collaborative filtering model, there is a cold start problem, and such a model is greatly affected by its adopted clustering algorithm. To address these issues, a hybrid recommendation scheme is proposed in this paper, which is based on both collaborative filtering and content-based. In this scheme, we propose the concept of time impact factor, and a time-aware user preference model is built based on it. Also, user feedback on recommendation items is utilized to improve the accuracy of our proposed recommendation model. Finally, the proposed hybrid model combines the results of content recommendation and collaborative filtering based on the logistic regression algorithm.

scholarly journals Unified learning to enhance adaptive behavior of simulation objects

SIMULATION ◽  
2018 ◽  
Vol 94 (11) ◽  
pp. 979-992
Author(s):  
Hyo-Cheol Lee ◽  
Seok-Won Lee
Keyword(s):  
Real World ◽  
Military Training ◽  
The Other ◽  
Data Driven ◽  
Learning Approach ◽  
Simulation Environment ◽  
New Approach ◽  
Domain Experts ◽  
Training Simulation ◽  
Game Simulation

Modeling and simulation are methods of validating new systems that are risky to be directly deployed in the real world. During the simulation, the simulation environment continuously changes and simulation objects correspondingly behave according to the changing situations. In general, modeling the behavior for all possible situations is extremely difficult when the rationale is unknown. Therefore, in order to adapt to the changing situation, it is important to recognize the rationale behind the behaviors of the simulation object. However, in many cases, even though the rationale is unknown or difficult to recognize, the simulation requires reasonable behaviors such as a commander’s decision in a war game simulation and a driver’s behavior in rush hours. In this study, we propose a new approach to determine the behavior of simulation objects under changing situations. The proposal is a unified learning approach that integrates two methods, data-driven and knowledge-driven approaches, which allow simulation objects to learn behavioral knowledge from experience as well as from domain experts performing the simulation and reuse verified knowledge. By combining both approaches, we supplement the shortcomings of one method with the strengths of the other. To verify our method, we apply the proposed approach to a military training simulation.

scholarly journals A^3NCF: An Adaptive Aspect Attention Model for Rating Prediction

2018 ◽  
Author(s):  
Zhiyong Cheng ◽  
Ying Ding ◽  
Xiangnan He ◽  
Lei Zhu ◽  
Xuemeng Song ◽  
...  
Keyword(s):  
Recommender Systems ◽  
Large Scale ◽  
Topic Model ◽  
State Of The Art ◽  
Representation Learning ◽  
Weight Vector ◽  
User Preferences ◽  
Attention Model ◽  
Item Characteristics ◽  
Rating Prediction

Current recommender systems consider the various aspects of items for making accurate recommendations. Different users place different importance to these aspects which can be thought of as a preference/attention weight vector. Most existing recommender systems assume that for an individual, this vector is the same for all items. However, this assumption is often invalid, especially when considering a user's interactions with items of diverse characteristics. To tackle this problem, in this paper, we develop a novel aspect-aware recommender model named A$^3$NCF, which can capture the varying aspect attentions that a user pays to different items. Specifically, we design a new topic model to extract user preferences and item characteristics from review texts. They are then used to 1) guide the representation learning of users and items, and 2) capture a user's special attention on each aspect of the targeted item with an attention network. Through extensive experiments on several large-scale datasets, we demonstrate that our model outperforms the state-of-the-art review-aware recommender systems in the rating prediction task.

A new approach based on graph matching and evolutionary approach for sport scheduling problem

2020 ◽  
pp. 1-16
Author(s):  
Meriem Khelifa ◽  
Dalila Boughaci ◽  
Esma Aïmeur
Keyword(s):  
Graph Matching ◽  
State Of The Art ◽  
Travel Cost ◽  
Round Robin ◽  
New Approach ◽  
Traveling Tournament Problem ◽  
Significant Interest ◽  
National League ◽  
Better Than

The Traveling Tournament Problem (TTP) is concerned with finding a double round-robin tournament schedule that minimizes the total distances traveled by the teams. It has attracted significant interest recently since a favorable TTP schedule can result in significant savings for the league. This paper proposes an original evolutionary algorithm for TTP. We first propose a quick and effective constructive algorithm to construct a Double Round Robin Tournament (DRRT) schedule with low travel cost. We then describe an enhanced genetic algorithm with a new crossover operator to improve the travel cost of the generated schedules. A new heuristic for ordering efficiently the scheduled rounds is also proposed. The latter leads to significant enhancement in the quality of the schedules. The overall method is evaluated on publicly available standard benchmarks and compared with other techniques for TTP and UTTP (Unconstrained Traveling Tournament Problem). The computational experiment shows that the proposed approach could build very good solutions comparable to other state-of-the-art approaches or better than the current best solutions on UTTP. Further, our method provides new valuable solutions to some unsolved UTTP instances and outperforms prior methods for all US National League (NL) instances.

scholarly journals Assessing a Multi-Objective Genetic Algorithm with a Simulated Environment for Energy-Saving of Air Conditioning Systems with User Preferences

Symmetry ◽  
2021 ◽  
Vol 13 (2) ◽  
pp. 344
Author(s):  
Alejandro Humberto García Ruiz ◽  
Salvador Ibarra Martínez ◽  
José Antonio Castán Rocha ◽  
Jesús David Terán Villanueva ◽  
Julio Laria Menchaca ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Energy Consumption ◽  
Energy Saving ◽  
User Satisfaction ◽  
Air Conditioning ◽  
State Of The Art ◽  
User Preferences ◽  
The State ◽  
Nsga Ii ◽  
Air Conditioning System

Electricity is one of the most important resources for the growth and sustainability of the population. This paper assesses the energy consumption and user satisfaction of a simulated air conditioning system controlled with two different optimization algorithms. The algorithms are a genetic algorithm (GA), implemented from the state of the art, and a non-dominated sorting genetic algorithm II (NSGA II) proposed in this paper; these algorithms control an air conditioning system considering user preferences. It is worth noting that we made several modifications to the objective function’s definition to make it more robust. The energy-saving optimization is essential to reduce CO2 emissions and economic costs; on the other hand, it is desirable for the user to feel comfortable, yet it will entail a higher energy consumption. Thus, we integrate user preferences with energy-saving on a single weighted function and a Pareto bi-objective problem to increase user satisfaction and decrease electrical energy consumption. To assess the experimentation, we constructed a simulator by training a backpropagation neural network with real data from a laboratory’s air conditioning system. According to the results, we conclude that NSGA II provides better results than the state of the art (GA) regarding user preferences and energy-saving.

scholarly journals Analysis of Synthetic Voltage vs. Capacity Datasets for Big Data Li-ion Diagnosis and Prognosis

Energies ◽  
2021 ◽  
Vol 14 (9) ◽  
pp. 2371
Author(s):  
Matthieu Dubarry ◽  
David Beck
Keyword(s):  
Cobalt Oxide ◽  
State Of The Art ◽  
Data Driven ◽  
Nickel Aluminum ◽  
Li Ion Battery ◽  
Diagnosis And Prognosis ◽  
Detailed Statistical Analysis ◽  
Li Ion ◽  
Synthetic Datasets ◽  
Nickel Manganese

The development of data driven methods for Li-ion battery diagnosis and prognosis is a growing field of research for the battery community. A big limitation is usually the size of the training datasets which are typically not fully representative of the real usage of the cells. Synthetic datasets were proposed to circumvent this issue. This publication provides improved datasets for three major battery chemistries, LiFePO4, Nickel Aluminum Cobalt Oxide, and Nickel Manganese Cobalt Oxide 811. These datasets can be used for statistical or deep learning methods. This work also provides a detailed statistical analysis of the datasets. Accurate diagnosis as well as early prognosis comparable with state of the art, while providing physical interpretability, were demonstrated by using the combined information of three learnable parameters.

Sign in / Sign up

Export Citation Format

Share Document