The Korean Journal of Applied Statistics (응용통계연구)

The Korean Statistical Society (한국통계학회)
권호 표지
DOI QR코드

DOI QR Code

Introduction to the Indian Buffet Process: Theory and Applications

인도부페 프로세스의 소개: 이론과 응용

  • Lee, Youngseon (Department of Statistics, Seoul National University) ;
  • Lee, Kyoungjae (Department of Statistics, Seoul National University) ;
  • Lee, Kwangmin (Department of Statistics, Seoul National University) ;
  • Lee, Jaeyong (Department of Statistics, Seoul National University) ;
  • Seo, Jinwook (Department of Computer Science and Engineering, Seoul National University)
  • Received : 2015.03.16
  • Accepted : 2015.03.30
  • Published : 2015.04.30
Download PDF
⟨ Previous Next ⟩

Abstract

The Indian Buffet Process is a stochastic process on equivalence classes of binary matrices having finite rows and infinite columns. The Indian Buffet Process can be imposed as the prior distribution on the binary matrix in an infinite feature model. We describe the derivation of the Indian buffet process from a finite feature model, and briefly explain the relation between the Indian buffet process and the beta process. Using a Gaussian linear model, we describe three algorithms: Gibbs sampling algorithm, Stick-breaking algorithm and variational method, with application for finding features in image data. We also illustrate the use of the Indian Buffet Process in various type of analysis such as dyadic data analysis, network data analysis and independent component analysis.

인도부페 프로세스는 유한개의 행과 무한개의 열로 이루어진 이진행렬의 분포와 관련된 확률과정이다. 무한특성모형을 유한개의 행과 무한개의 열로 이루어진 이진행렬을 이용해서 표현할 때, 이진행렬에 대한 사전분포로써 인도부페 프로세스가 이용될 수 있다. 본 논문에서는 인도부페 프로세스를 유한특성모형과 연관지어서 유도하는 방법을 소개하고, 베타프로세스와의 관련성을 간략히 설명한다. 실제 모형의 추론에 인도부페 프로세스가 이용되는 예제를 살펴보기 위해서 가우시안 선형모형에 인도부페 프로세스를 적용한 모형화 방법을 언급하고, 깁스표집 알고리즘, 막대 자르기 알고리즘, 변분방법을 이용한 추론방법을 설명한다. 그리고 이 세 가지 알고리즘을 이용하여 이미지 자료를 분석하는데 적용해본다. 나아가 쌍자료 분석, 네트워크 분석, 독립성분 분석에서 인도부페 프로세스가 어떻게 이용될 수 있는지도 알아본다.

Keywords

References

  1. Doshi-Velez, F., Miller, K. T., Gael, J. V. and Teh, Y. W. (2008). Variational inference for the Indian buffet process.
  2. Doshi-Velez, F., Knowles, D., Mohamed, S. and Ghahramamni, Z. (2009). Large Scale Nonparametric Bayesian inference: Data Parallelisation in the Indian Buffet Process, Advances in Neural Information Process-ing Systems.
  3. Doshi-Velez, F. and Ghahramani, Z. (2009). Accelerated sampling for the Indian buffet process, Proceedings of the 26th Annual International Conference on Machine Learning. ACM.
  4. Ferguson, T. S. (1973). A Bayesian analysis of some nonparametric problems, The Annals of Statistics, 209-230.
  5. Foulds, J. R. (2014). Latent Variable Modeling for Networks and Text: Algorithms, Models and Evaluation Techniques Ph.D., Thesis, Department of Computer Science, University of California, Irvine.
  6. Griffiths, T. and Ghahramani, Z. (2006). Infinite latent feature models and the Indian buffet process, In Advances in Neural Information Processing Systems, 18, 475-482.
  7. Griffiths, T. and Ghahramani, Z. (2011). The indian buffet process: An introduction and review, The Journal of Machine Learning Research, 12, 1185-1224.
  8. Knowles, D. and Ghahramani, Z. (2007). Infinite sparse factor analysis and infinite independent components analysis, Independent Component Analysis and Signal Separation, 381-388.
  9. Meeds, E., Ghahramani, Z., Neal, R. and Roweis, S. (2006). Modeling dyadic data with binary latent factors, Advances in Neural Information Processing Systems, 977-984.
  10. Ren, L., Wang, Y., Carin, L. and Dunson, D. (2011). The kernel beta process, Advances in Neural Information Processing Systems, 963-971.
  11. Paisley, J. W., Blei, D. M. and Jordan, M. I. (2012). Stick-breaking beta processes and the Poisson process, International Conference on Arti cial Intelligence and Statistics.
  12. Pitman, J. (1996). Random discrete distributions invariant under size-biased permutation, Advances in Applied Probability, 525-539.
  13. Pitman, J. and Yor, M. (1997). The two-parameter Poisson-Dirichlet distribution derived from a stable subordinator, The Annals of Probability, 855-900.
  14. Teh, Y. W., Gorur, D. and Ghahramani, Z. (2007). Stick-breaking construction for the Indian buffet process, International Conference on Artificial Intelligence and Statistics.
  15. Teh, Y. W. and Gorur, D. (2009). Indian buffet processes with power-law behavior, In Advances in Neural Information Processing Systems, 1838-1846.
  16. Ten, L., Wang, Y., Dunson, D. and Carin, L. (2011). The kernel beta process, Advances in Neural Information Processing Systems, 963-971.
  17. Thibaux, R. and Jordan, M. I. (2007). Hierarchical beta processes and the Indian buffet process, International Conference on Arti cial Intelligence and Statistics.
  18. Williamson, S., Orbanz, P. and Ghahramani, Z. (2010). Dependent Indian buffet processes, International Conference on Arti cial Intelligence and Statistics, 924-931.
  19. Zhou, M., Yang, H., Sapiro, G., Dunson, D. and Carin, L. (2011). Dependent hierarchical beta process for image interpolation and denoising, International Conference on Arti cial Intelligence and Statistics, 883-891.