Sciweavers

222 search results - page 30 / 45
» Experiments with random projections for machine learning
Sort
View
ICML
2003
IEEE
14 years 8 months ago
Online Ranking/Collaborative Filtering Using the Perceptron Algorithm
In this paper we present a simple to implement truly online large margin version of the Perceptron ranking (PRank) algorithm, called the OAP-BPM (Online Aggregate Prank-Bayes Poin...
Edward F. Harrington
MLMI
2005
Springer
14 years 1 months ago
The Development of the AMI System for the Transcription of Speech in Meetings
The automatic processing of speech collected in conference style meetings has attracted considerable interest with several large scale projects devoted to this area. This paper des...
Thomas Hain, Lukas Burget, John Dines, Iain McCowa...
COLT
2008
Springer
13 years 9 months ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim
ML
1998
ACM
101views Machine Learning» more  ML 1998»
13 years 7 months ago
Elevator Group Control Using Multiple Reinforcement Learning Agents
Recent algorithmic and theoretical advances in reinforcement learning (RL) have attracted widespread interest. RL algorithmshave appeared that approximatedynamic programming on an ...
Robert H. Crites, Andrew G. Barto
AI
2004
Springer
13 years 7 months ago
A selective sampling approach to active feature selection
Feature selection, as a preprocessing step to machine learning, has been very effective in reducing dimensionality, removing irrelevant data, increasing learning accuracy, and imp...
Huan Liu, Hiroshi Motoda, Lei Yu