Sciweavers

3050 search results - page 297 / 610
» On-line Algorithms in Machine Learning
Sort
View
ICML
2010
IEEE
15 years 7 months ago
Internal Rewards Mitigate Agent Boundedness
Abstract--Reinforcement learning (RL) research typically develops algorithms for helping an RL agent best achieve its goals-however they came to be defined--while ignoring the rela...
Jonathan Sorg, Satinder P. Singh, Richard Lewis
ICML
2010
IEEE
15 years 7 months ago
Risk minimization, probability elicitation, and cost-sensitive SVMs
A new procedure for learning cost-sensitive SVM classifiers is proposed. The SVM hinge loss is extended to the cost sensitive setting, and the cost-sensitive SVM is derived as the...
Hamed Masnadi-Shirazi, Nuno Vasconcelos
ICML
2010
IEEE
15 years 7 months ago
Feature Selection as a One-Player Game
This paper formalizes Feature Selection as a Reinforcement Learning problem, leading to a provably optimal though intractable selection policy. As a second contribution, this pape...
Romaric Gaudel, Michèle Sebag
ML
2000
ACM
144views Machine Learning» more  ML 2000»
15 years 6 months ago
MultiBoosting: A Technique for Combining Boosting and Wagging
MultiBoosting is an extension to the highly successful AdaBoost technique for forming decision committees. MultiBoosting can be viewed as combining AdaBoost with wagging. It is abl...
Geoffrey I. Webb
KDD
2005
ACM
143views Data Mining» more  KDD 2005»
16 years 7 months ago
SVM selective sampling for ranking with application to data retrieval
Learning ranking (or preference) functions has been a major issue in the machine learning community and has produced many applications in information retrieval. SVMs (Support Vect...
Hwanjo Yu