Sciweavers

1707 search results - page 181 / 342
» A Boosting Algorithm for Regression
Sort
View
105
Voted
SIAMCO
2000
71views more  SIAMCO 2000»
15 years 3 months ago
On a Perturbation Approach for the Analysis of Stochastic Tracking Algorithms
In this paper, a perturbation expansion technique is introduced to decompose the tracking error of a general adaptive tracking algorithm in a linear regression model. This method ...
Rafik Aguech, Eric Moulines, Pierre Priouret
GIS
2009
ACM
15 years 8 months ago
Machine learning approach to report prioritization with an application to travel time dissemination
This paper looks at the problem of data prioritization, commonly found in mobile ad-hoc networks. The proposed general solution uses a machine learning approach in order to learn ...
Piotr Szczurek, Bo Xu, Jie Lin, Ouri Wolfson
117
Voted
NIPS
2007
15 years 5 months ago
Stability Bounds for Non-i.i.d. Processes
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...
Mehryar Mohri, Afshin Rostamizadeh
160
Voted
AIME
1997
Springer
15 years 7 months ago
Detecting Very Early Stages of Dementia from Normal Aging with Machine Learning Methods
We used Machine Learning (ML) methods to learn the best decision rules to distinguish normal brain aging from the earliest stages of dementia using subsamples of 198 normal and 244...
William Rodman Shankle, Subramani Mani, Michael J....
118
Voted
ICML
2008
IEEE
16 years 4 months ago
Empirical Bernstein stopping
Sampling is a popular way of scaling up machine learning algorithms to large datasets. The question often is how many samples are needed. Adaptive stopping algorithms monitor the ...
Csaba Szepesvári, Jean-Yves Audibert, Volod...