Using reinforcement learning to find an optimal set of features

DOI10.1016/J.CAMWA.2013.06.031zbMath1381.68243OpenAlexW1975777241MaRDI QIDQ316296

Sattar Hashemi, Seyed Mehdi Hazrati Fard, Ali Hamzeh

Publication date: 27 September 2016

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2013.06.031

zbMATH Keywords

Markov decision processreinforcement learningfeature selectiontemporal difference

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Markov and semi-Markov decision processes (90C40)

Uses Software

• Torch
• foba

Cites Work

• Wrappers for feature subset selection
• An algorithm for a selective nearest neighbor decision rule (Corresp.)
• Asymptotic Properties of Nearest Neighbor Rules Using Edited Data
• 10.1162/153244303322753616
• Random forests
• Finite-time analysis of the multiarmed bandit problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Using reinforcement learning to find an optimal set of features