Infinite latent feature models and the Indian buffet process
Ghahramani, Zoubin, Griffiths, Thomas L.
–Neural Information Processing Systems
We define a probability distribution over equivalence classes of binary matrices with a finite number of rows and an unbounded number of columns. This distribution is suitable for use as a prior in probabilistic models that represent objects using a potentially infinite array of features. We identify a simple generative process that results in the same distribution over equivalence classes, which we call the Indian buffet process. We illustrate the use of this distribution as a prior in an infinite latent feature model, deriving a Markov chain Monte Carlo algorithm for inference in this model and applying the algorithm to an image dataset.
Neural Information Processing Systems
Dec-31-2006
- Country:
- Asia > Middle East
- Jordan (0.04)
- North America > United States
- California > San Francisco County
- San Francisco (0.14)
- Massachusetts > Middlesex County
- Cambridge (0.05)
- New York (0.04)
- Rhode Island > Providence County
- Providence (0.04)
- California > San Francisco County
- Asia > Middle East
- Technology: