Recommandation mobile, sensible au contexte de contenus évolutifs: Contextuel-E-Greedy

02/09/2014
by   Djallel Bouneffouf, et al.
0

We introduce in this paper an algorithm named Contextuel-E-Greedy that tackles the dynamicity of the user's content. It is based on dynamic exploration/exploitation tradeoff and can adaptively balance the two aspects by deciding which situation is most relevant for exploration or exploitation. The experimental results demonstrate that our algorithm outperforms surveyed algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/24/2017

Improving Brain Storm Optimization Algorithm via Simplex Search

Through modeling human's brainstorming process, the brain storm optimiza...
research
02/12/2017

Genetic and Memetic Algorithm with Diversity Equilibrium based on Greedy Diversification

The lack of diversity in a genetic algorithm's population may lead to a ...
research
09/06/2016

Q-Learning with Basic Emotions

Q-learning is a simple and powerful tool in solving dynamic problems whe...
research
06/01/2018

The Externalities of Exploration and How Data Diversity Helps Exploitation

Online learning algorithms, widely used to power search and content opti...
research
05/19/2020

Greedy Algorithm almost Dominates in Smoothed Contextual Bandits

Online learning algorithms, widely used to power search and content opti...
research
11/26/2017

Novel Adaptive Genetic Algorithm Sample Consensus

Random sample consensus (RANSAC) is a successful algorithm in model fitt...
research
10/30/2019

RBED: Reward Based Epsilon Decay

ε-greedy is a policy used to balance exploration and exploitation in man...

Please sign up or login with your details

Forgot password? Click here to reset