Sciweavers

995 search results - page 45 / 199
» Learning Useful Horn Approximations
Sort
View
ATMOS
2007
177views Optimization» more  ATMOS 2007»
13 years 11 months ago
Approximate dynamic programming for rail operations
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
Warren B. Powell, Belgacem Bouzaïene-Ayari
JMLR
2008
137views more  JMLR 2008»
13 years 9 months ago
Online Learning of Complex Prediction Problems Using Simultaneous Projections
We describe and analyze an algorithmic framework for online classification where each online trial consists of multiple prediction tasks that are tied together. We tackle the prob...
Yonatan Amit, Shai Shalev-Shwartz, Yoram Singer
EUROCOLT
1999
Springer
14 years 2 months ago
Query by Committee, Linear Separation and Random Walks
Abstract. Recent works have shown the advantage of using Active Learning methods, such as the Query by Committee (QBC) algorithm, to various learning problems. This class of Algori...
Ran Bachrach, Shai Fine, Eli Shamir
IJCNN
2006
IEEE
14 years 3 months ago
Learning to Rank by Maximizing AUC with Linear Programming
— Area Under the ROC Curve (AUC) is often used to evaluate ranking performance in binary classification problems. Several researchers have approached AUC optimization by approxi...
Kaan Ataman, W. Nick Street, Yi Zhang
ICPR
2008
IEEE
14 years 4 months ago
Prior-updating ensemble learning for discrete HMM
Ensemble learning is a variational Bayesian method in which an intractable distribution is approximated by a lower-bound. Ensemble learning results in models with better generaliz...
Gyeongyong Heo, Paul D. Gader