DeepAI AI Chat
Log In Sign Up

Active Learning Meets Optimized Item Selection

11/22/2021
by   Bernard Kleynhans, et al.
fmr
0

Designing recommendation systems with limited or no available training data remains a challenge. To that end, a new combinatorial optimization problem is formulated to generate optimized item selection for experimentation with the goal to shorten the time for collecting randomized training data. We first present an overview of the optimized item selection problem and a multi-level optimization framework to solve it. The approach integrates techniques from discrete optimization, unsupervised clustering, and latent text embeddings. We then discuss how to incorporate optimized item selection with active learning as part of randomized exploration in an ongoing fashion.

READ FULL TEXT
12/12/2012

Unsupervised Active Learning in Large Domains

Active learning is a powerful approach to analyzing data effectively. We...
11/16/2020

Sampling Approach Matters: Active Learning for Robotic Language Acquisition

Ordering the selection of training data using active learning can lead t...
09/07/2019

Active learning to optimise time-expensive algorithm selection

Hard optimisation problems such as Boolean Satisfiability typically have...
10/27/2020

What Can We Expect from Active Class Selection?

The promise of active class selection is that the proportions of classes...
11/10/2009

Active Learning for Mention Detection: A Comparison of Sentence Selection Strategies

We propose and compare various sentence selection strategies for active ...
04/16/2019

Most Frequent Itemset Optimization

In this paper we are dealing with the frequent itemset mining. We concen...