Sciweavers

995 search results - page 102 / 199
» Learning Useful Horn Approximations
Sort
View
117
Voted
ICML
2005
IEEE
16 years 1 months ago
Bayesian hierarchical clustering
We present a novel algorithm for agglomerative hierarchical clustering based on evaluating marginal likelihoods of a probabilistic model. This algorithm has several advantages ove...
Katherine A. Heller, Zoubin Ghahramani
97
Voted
SIGIR
2008
ACM
15 years 18 days ago
Query dependent ranking using K-nearest neighbor
Many ranking models have been proposed in information retrieval, and recently machine learning techniques have also been applied to ranking model construction. Most of the existin...
Xiubo Geng, Tie-Yan Liu, Tao Qin, Andrew Arnold, H...
86
Voted
CVPR
2003
IEEE
16 years 2 months ago
An Efficient Approach to Learning Inhomogeneous Gibbs Model
Inhomogeneous Gibbs model (IGM) [4] is an effective maximum entropy model in characterizing complex highdimensional distributions. However, its training process is so slow that th...
Ziqiang Liu, Hong Chen, Heung-Yeung Shum
102
Voted
NIPS
2004
15 years 2 months ago
Schema Learning: Experience-Based Construction of Predictive Action Models
Schema learning is a way to discover probabilistic, constructivist, predictive action models (schemas) from experience. It includes methods for finding and using hidden state to m...
Michael P. Holmes, Charles Lee Isbell Jr.
126
Voted
CVPR
2007
IEEE
16 years 2 months ago
What makes a good model of natural images?
Many low-level vision algorithms assume a prior probability over images, and there has been great interest in trying to learn this prior from examples. Since images are very non G...
Yair Weiss, William T. Freeman