Sciweavers

701 search results - page 51 / 141
» Self Bounding Learning Algorithms
Sort
View
SIGIR
2002
ACM
13 years 9 months ago
A new family of online algorithms for category ranking
We describe a new family of topic-ranking algorithms for multi-labeled documents. The motivation for the algorithms stems from recent advances in online learning algorithms. The a...
Koby Crammer, Yoram Singer
JMLR
2010
125views more  JMLR 2010»
13 years 4 months ago
Regret Bounds for Gaussian Process Bandit Problems
Bandit algorithms are concerned with trading exploration with exploitation where a number of options are available but we can only learn their quality by experimenting with them. ...
Steffen Grünewälder, Jean-Yves Audibert,...
DAC
2006
ACM
14 years 3 months ago
Mining global constraints for improving bounded sequential equivalence checking
In this paper, we propose a novel technique on mining relationships in a sequential circuit to discover global constraints. In contrast to the traditional learning methods, our mi...
Weixin Wu, Michael S. Hsiao
ICDM
2003
IEEE
101views Data Mining» more  ICDM 2003»
14 years 3 months ago
Interactive Visualization and Navigation in Large Data Collections using the Hyperbolic Space
We propose the combination of two recently introduced methods for the interactive visual data mining of large collections of data. Both, Hyperbolic Multi-Dimensional Scaling (HMDS...
Jörg A. Walter, Jörg Ontrup, Daniel Wess...
ML
2002
ACM
145views Machine Learning» more  ML 2002»
13 years 9 months ago
Boosting Methods for Regression
In this paper we examine ensemble methods for regression that leverage or "boost" base regressors by iteratively calling them on modified samples. The most successful lev...
Nigel Duffy, David P. Helmbold