Mixture models for learning low-dimensional roles in high-dimensional data

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2010, Pages 909-917

  Somaiya, Manas ^a   Jermaine, Christopher ^b   Ranka, Sanjay ^a  

^a UNIVERSITY OF FLORIDA   (United States)

^b RICE UNIVERSITY   (United States)

Author keywords

High dimensional data; MCMC; Mixture models

Indexed keywords

ACTION MOVIES; ARCHIVED DATA; BAYESIAN FRAMEWORKS; DATA POINTS; HIGH DIMENSIONAL DATA; MCMC; MIXTURE MODEL; MIXTURE MODELS; NEWS ARTICLES; RETAIL CUSTOMERS;

CUSTOMER SATISFACTION; MIXTURES; PURCHASING; RETAIL STORES;

SALES;

EID: 77956208062     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1835804.1835919     Document Type: Conference Paper

References (22)

1. C. C. Aggarwal, J. L. Wolf, P. S. Yu, C. Procopiuc, and J. S. Park. Fast algorithms for projected clustering. In SIGMOD, pages 61-72, New York, NY, USA, 1999. ACM Press.
2. R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan. Automatic subspace clustering of high dimensional data for data mining applications. In SIGMOD, pages 94-105, New York, NY, USA, 1998. ACM Press.
3. A. Asuncion and D. Newman. UCI machine learning repository. http://www.ics.uci.edu/~mlearn/MLRepository.html, 2007.
4. D. M. Blei, A. Y. Ng, and M. I. Jordan. Latent dirichlet allocation. J. Mach. Learn. Res., 3:993-1022, 2003.
5. I. Cadez, S. Gaffney, and P. Smyth. A general probabilistic framework for clustering individuals and objects. In KDD, pages 140-149, 2000.
6. I. Cadez, P. Smyth, and H. Mannila. Probabilistic modeling of transaction data with applications to profiling, visualization, and prediction. In KDD, pages 37-46, 2001.
7. A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum likelihood from incomplete data via the em algorithm. Journal of Royal Statistical Society, B-39:1-39, 1977.
8. T. Griffiths and Z. Ghahramani. Infinite latent feature models and the indian buffet process. In Y. Weiss, B. Schölkopf, and J. Platt, editors, NIPS 18, pages 475-482. MIT Press, Cambridge, MA, 2006.
9. K. Heller and Z. Ghahramani. A nonparametric bayesian approach to modeling overlapping clusters. In AISATS. The Society for Artificial Intelligence and Statistics, 2007.
10. K. A. Heller, S. Williamson, and Z. Ghahramani. Statistical models for partial membership. In ICML, pages 392-399, 2008.
11. S. Kullback and R. A. Leibler. On information and sufficiency. The Annals of Mathematical Statistics, 22(1):79-86, 1951.
12. J. S. Liu. The collapsed gibbs sampler in bayesian computations with applications to a gene regulation problem. Journal of the American Statistical Association, 89(427):958-966, 1994.
13. J. S. Liu, W. H. Wong, and A. Kong. Covariance structure of the Gibbs sampler with applications to the comparisons of estimators and augmentation schemes. Biometrika, 81(1):27-40, 1994.
14. G. J. McLachlan and K. E. Basford. Mixture Models: Inference and Applications to Clustering. Marcel Dekker, New York, 1988.
15. G. J. McLachlan and D. Peel. Finite Mixture Models. Wiley, New York, 2000.
16. J. V. Neumann. Various techniques used in connection with random digits. Applied Math Series, 1951.
17. M. F. Porter. Snowball: A language for stemming algorithms. http://www.snowball.tartarus.org/texts/introduction.html, 2001.
18. A. E. Raftery and S. Lewis. How many iterations in the gibbs sampler? In Bayesian Statistics, volume 4, pages 763-773. Oxford University Press, 1992.
19. Reuters news and video archive. http://www.reuters.com/resources/archive/ us/index.html.
20. C. P. Robert and G. Casella. Monte Carlo Statistical Methods. Springer, 2005.
21. M. Somaiya, C. Jermaine, and S. Ranka. Learning correlations using the mixture-of-subsets model. ACM Trans. Knowl. Discov. Data, 1(4):1-42, 2008.
22. M. Somaiya, C. Jermaine, and S. Ranka. Various experiments using POWER models. http://www.cise.ufl.edu/~ranka/power/, 2010.