Sciweavers

1393 search results - page 104 / 279
» Machine Learning by Function Decomposition
Sort
View
135
Voted
ICML
2004
IEEE
16 years 2 months ago
Learning Bayesian network classifiers by maximizing conditional likelihood
Bayesian networks are a powerful probabilistic representation, and their use for classification has received considerable attention. However, they tend to perform poorly when lear...
Daniel Grossman, Pedro Domingos
ECML
2007
Springer
15 years 8 months ago
An Unsupervised Learning Algorithm for Rank Aggregation
Many applications in information retrieval, natural language processing, data mining, and related fields require a ranking of instances with respect to a specified criteria as op...
Alexandre Klementiev, Dan Roth, Kevin Small
86
Voted
COLT
1992
Springer
15 years 6 months ago
Toward Efficient Agnostic Learning
In this paper we initiatean investigationof generalizationsof the ProbablyApproximatelyCorrect (PAC) learningmodelthat attemptto significantlyweakenthe target functionassumptions.T...
Michael J. Kearns, Robert E. Schapire, Linda Selli...
ICML
2009
IEEE
16 years 2 months ago
Learning structurally consistent undirected probabilistic graphical models
In many real-world domains, undirected graphical models such as Markov random fields provide a more natural representation of the dependency structure than directed graphical mode...
Sushmita Roy, Terran Lane, Margaret Werner-Washbur...
122
Voted
ICML
2007
IEEE
16 years 2 months ago
Bayesian actor-critic algorithms
We1 present a new actor-critic learning model in which a Bayesian class of non-parametric critics, using Gaussian process temporal difference learning is used. Such critics model ...
Mohammad Ghavamzadeh, Yaakov Engel