Test-Cost Sensitive Ensemble of Classifiers Using Reinforcement Learning
نویسندگان
چکیده
منابع مشابه
Cost-Sensitive Reinforcement Learning
We introduce cost-sensitive regression as a way to introduce information obtained by planning as background knowledge into a relational reinforcement learning algorithm. By offering a trade-off between using knowledge rich, but computationally expensive knowledge resulting from planning like approaches such as minimax search and computationally cheap, but possibly incorrect generalizations, the...
متن کاملLearning cost-sensitive active classifiers
Most classification algorithms are “passive”, in that they assign a class label to each instance based only on the description given, even if that description is incomplete. By contrast, an active classifier can — at some cost — obtain the values of some unspecified attributes, before deciding upon a class label. This can be useful, for instance, when deciding whether to gather information rele...
متن کاملPruning an ensemble of classifiers via reinforcement learning
This paper studies the problem of pruning an ensemble of classifiers from a Reinforcement Learning perspective. It contributes a new pruning approach that uses the Q-learning algorithm in order to approximate an optimal policy of choosing whether to include or exclude each classifier from the ensemble. Extensive experimental comparisons of the proposed approach against state-of-the-art pruning ...
متن کاملEnsemble Pruning Using Reinforcement Learning
Multiple Classifier systems have been developed in order to improve classification accuracy using methodologies for effective classifier combination. Classical approaches use heuristics, statistical tests, or a meta-learning level in order to find out the optimal combination function. We study this problem from a Reinforcement Learning perspective. In our modeling, an agent tries to learn the b...
متن کاملCost-Sensitive Exploration in Bayesian Reinforcement Learning
In this paper, we consider Bayesian reinforcement learning (BRL) where actions incur costs in addition to rewards, and thus exploration has to be constrained in terms of the expected total cost while learning to maximize the expected longterm total reward. In order to formalize cost-sensitive exploration, we use the constrained Markov decision process (CMDP) as the model of the environment, in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Revue d'Intelligence Artificielle
سال: 2020
ISSN: 0992-499X,1958-5748
DOI: 10.18280/ria.340204