Sciweavers

4 search results - page 1 / 1
» Accelerated sampling for the Indian Buffet Process
Sort
View
ICML
2009
IEEE
13 years 2 months ago
Accelerated sampling for the Indian Buffet Process
We often seek to identify co-occurring hidden features in a set of observations. The Indian Buffet Process (IBP) provides a nonparametric prior on the features present in each obs...
Finale Doshi-Velez, Zoubin Ghahramani
NIPS
2008
13 years 5 months ago
The Infinite Factorial Hidden Markov Model
We introduce a new probability distribution over a potentially infinite number of binary Markov chains which we call the Markov Indian buffet process. This process extends the IBP...
Jurgen Van Gael, Yee Whye Teh, Zoubin Ghahramani
TSMC
2002
110views more  TSMC 2002»
13 years 4 months ago
Complexity reduction for "large image" processing
We present a method for sampling feature vectors in large (e.g., 2000 5000 16 bit) images that finds subsets of pixel locations which represent "regions" in the image. Sa...
Nikhil R. Pal, James C. Bezdek
BMCBI
2010
216views more  BMCBI 2010»
12 years 11 months ago
Bayesian Inference of the Number of Factors in Gene-Expression Analysis: Application to Human Virus Challenge Studies
Background: Nonparametric Bayesian techniques have been developed recently to extend the sophistication of factor models, allowing one to infer the number of appropriate factors f...
Bo Chen, Minhua Chen, John William Paisley, Aimee ...