Sciweavers

9886 search results - page 1346 / 1978
» Learning Compressible Models
Sort
View
ICML
2004
IEEE
16 years 8 months ago
Variational methods for the Dirichlet process
Variational inference methods, including mean field methods and loopy belief propagation, have been widely used for approximate probabilistic inference in graphical models. While ...
David M. Blei, Michael I. Jordan
ICML
2004
IEEE
16 years 8 months ago
Automated hierarchical mixtures of probabilistic principal component analyzers
Many clustering algorithms fail when dealing with high dimensional data. Principal component analysis (PCA) is a popular dimensionality reduction algorithm. However, it assumes a ...
Ting Su, Jennifer G. Dy
WWW
2009
ACM
16 years 7 months ago
Predicting click through rate for job listings
Click Through Rate (CTR) is an important metric for ad systems, job portals, recommendation systems. CTR impacts publisher's revenue, advertiser's bid amounts in "p...
Manish S. Gupta
KDD
2006
ACM
183views Data Mining» more  KDD 2006»
16 years 7 months ago
Discovering interesting patterns through user's interactive feedback
In this paper, we study the problem of discovering interesting patterns through user's interactive feedback. We assume a set of candidate patterns (i.e., frequent patterns) h...
Dong Xin, Xuehua Shen, Qiaozhu Mei, Jiawei Han
CVPR
2010
IEEE
16 years 3 months ago
Automatic Discovery of Meaningful Object Parts with Latent CRFs
Object recognition is challenging due to high intra-class variability caused, e.g., by articulation, viewpoint changes, and partial occlusion. Successful methods need to strike a...
Paul Schnitzspan, Stefan Roth, Bernt Schiele
« Prev « First page 1346 / 1978 Last » Next »