641 search results - page 84 / 129 » Branch and Bound Algorithm Selection by Performance Predicti... |
148
Voted
JMLR
2012
13 years 6 months ago
2012
Variable selection is an important and practical problem that arises in analysis of many high-dimensional datasets. Convex optimization procedures that arise from relaxing the NP-...
138
Voted
COLT
2010
Springer
15 years 1 months ago
2010
Springer
We develop an online algorithm called Component Hedge for learning structured concept classes when the loss of a structured concept sums over its components. Example classes inclu...
128
Voted
APWEB
2004
Springer
15 years 9 months ago
2004
Springer
Queries to data warehouses often involve hundreds of complex aggregations over large volumes of data, and so it is infeasible to compute these queries by scanning the data sources ...
119
Voted
JMLR
2002
15 years 3 months ago
2002
We extend the classical algorithms of Valiant and Haussler for learning compact conjunctions and disjunctions of Boolean attributes to allow features that are constructed from the...
133
Voted
JMLR
2010
14 years 10 months ago
2010
We introduce a variational inference framework for training the Gaussian process latent variable model and thus performing Bayesian nonlinear dimensionality reduction. This method...