Sciweavers

481 search results - page 45 / 97
» Learning relational probability trees
Sort
View
ICML
2009
IEEE
14 years 8 months ago
BoltzRank: learning to maximize expected ranking gain
Ranking a set of retrieved documents according to their relevance to a query is a popular problem in information retrieval. Methods that learn ranking functions are difficult to o...
Maksims Volkovs, Richard S. Zemel
ICML
2006
IEEE
14 years 8 months ago
Cost-sensitive learning with conditional Markov networks
There has been a recent, growing interest in classification and link prediction in structured domains. Methods such as conditional random fields and relational Markov networks sup...
Prithviraj Sen, Lise Getoor
ICML
2005
IEEE
14 years 8 months ago
A graphical model for chord progressions embedded in a psychoacoustic space
Chord progressions are the building blocks from which tonal music is constructed. Inferring chord progressions is thus an essential step towards modeling long term dependencies in...
David Barber, Douglas Eck, Jean-François Pa...
NIPS
2004
13 years 9 months ago
The Convergence of Contrastive Divergences
This paper analyses the Contrastive Divergence algorithm for learning statistical parameters. We relate the algorithm to the stochastic approximation literature. This enables us t...
Alan L. Yuille
JMLR
2007
87views more  JMLR 2007»
13 years 7 months ago
A Probabilistic Analysis of EM for Mixtures of Separated, Spherical Gaussians
We show that, given data from a mixture of k well-separated spherical Gaussians in Rd, a simple two-round variant of EM will, with high probability, learn the parameters of the Ga...
Sanjoy Dasgupta, Leonard J. Schulman