Sciweavers

495 search results - page 55 / 99
» Approximation algorithms for budgeted learning problems
Sort
View
108
Voted
DIS
2008
Springer
15 years 4 months ago
Active Learning for High Throughput Screening
Abstract. An important task in many scientific and engineering disciplines is to set up experiments with the goal of finding the best instances (substances, compositions, designs) ...
Kurt De Grave, Jan Ramon, Luc De Raedt
117
Voted
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
15 years 4 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro
129
Voted
ICMLA
2009
15 years 10 days ago
Transformation Learning Via Kernel Alignment
This article proposes an algorithm to automatically learn useful transformations of data to improve accuracy in supervised classification tasks. These transformations take the for...
Andrew Howard, Tony Jebara
122
Voted
ML
2002
ACM
143views Machine Learning» more  ML 2002»
15 years 2 months ago
A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
Michael J. Kearns, Yishay Mansour, Andrew Y. Ng
91
Voted
TNN
2008
82views more  TNN 2008»
15 years 2 months ago
Deterministic Learning for Maximum-Likelihood Estimation Through Neural Networks
In this paper, a general method for the numerical solution of maximum-likelihood estimation (MLE) problems is presented; it adopts the deterministic learning (DL) approach to find ...
Cristiano Cervellera, Danilo Macciò, Marco ...