Bayesian Co-clustering

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2008, Pages 530-539

  Shan, Hanhuai ^a   Banerjee, Arindam ^a  

^a University of Minnesota   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BAYESIAN; CLUSTER STRUCTURE; CO-CLUSTERING; COLUMN CLUSTERS; DATA MATRICES; DATA-MINING TOOLS; DIRICHLET PRIOR; EXPONENTIAL FAMILY DISTRIBUTIONS; LOW DIMENSIONAL; MARKET BASKET ANALYSIS; MATRIX; MISSING VALUES; MODEL OUTPUTS; RECOMMENDATION SYSTEMS; SPARSE MATRICES; VARIATIONAL ALGORITHMS;

BAYESIAN NETWORKS; COBALT COMPOUNDS; INFERENCE ENGINES; INFORMATION MANAGEMENT; MATRIX ALGEBRA; MINING; PARAMETER ESTIMATION;

CLUSTER ANALYSIS;

EID: 67049165560     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2008.91     Document Type: Conference Paper

References (21)

1. D. Agarwal and S. Merugu. Predictive discrete latent factor models for large scale dyadic data. In KDD, pages 26-35, 2007. (Pubitemid 350229190)
2. E. Airoldi, D. Blei, S. Fienberg, and E. Xing. Mixed membership stochastic blockmodels. Technical report, arXiv:0705.4485v1 [stat.ME], 2007.
3. A. Banerjee, I. Dhillon, J. Ghosh, S. Merugu, and D.Modha. A generalized maximum entropy approach to Bregman coclustering and matrix approximation. JMLR, 8:1919-1986, 2007. (Pubitemid 47416225)
4. A. Banerjee, S. Merugu, I. Dhillon, and J. Ghosh. Clustering with Bregman divergences. JMLR, 6:1705-1749, 2005.
5. A. Banerjee and H. Shan. Latent Dirichlet conditional naive- Bayes models. In ICDM, pages 421-426, 2007.
6. O. Barndorff-Nielsen. Information and Exponential Families in Statistical Theory. Wiley Publishers, 1978.
7. D. Blei, A. Ng, and M. Jordan. Latent Dirichlet allocation. JMLR, 3:993-1022, 2003.
8. Y. Cheng and G. Church. Biclustering of expression data. In ISMB, pages 93-103, 2000.
9. A. Dempster, N. Laird, and D. Rubin. Maximum likelihood from incomplete data via the EM algorithm. JRSS, 39(1):1-38, 1977.
10. I. Dhillon, S. Mallela, and D. Modha. Information-theoretic co-clustering. In KDD, pages 89-98, 2003.
11. S. Geman and D. Geman. Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. PAMI, 6(6):721-741, 1984. (Pubitemid 15453722)
12. T. George and S. Merugu. A scalable collaborative filtering framework based on co-clustering. In ICDM, pages 625- 628, 2005. (Pubitemid 47385756)
13. J. Hartigan. Direct clustering of a data matrix. JASA, 67(337):123-129, 1972.
14. C. Kemp, J. Tenenbaum, T. Griffiths, T. Yamada, and N. Ueda. Learning systems of concepts with an infinite relational model. In AAAI, 2006.
15. S. Kirkpatrick, C. Gelatt, and M. Vecchi. Optimization by simulated annealing. Science, 220(4598):671-680, 1983.
16. Y. Kluger, R. Basri, J. Chang, and M. Gerstein. Spectral biclustering of microarray data: Coclustering genes and conditions. Genome Research, 13(4):703-716, 2003. (Pubitemid 36511928)
17. G. McLachlan and T. Krishnan. The EM Algorithm and Extensions. Wiley-Interscience, 1996.
18. R. Neal and G. Hinton. A view of the EM algorithm that justifies incremental, sparse, and other variants. In Learning in Graphical Models, pages 355-368, 1998.
19. K. Nowicki and T. Snijders. Estimation and prediction for stochastic blockstructures. JASA, 96(455):1077-1087, 2001.
20. R. Redner and H.Walker. Mixture densities, maximum likelihood and the EM algorithm. SIAM Review, 26(2):195-239, 1984. (Pubitemid 17491604)
21. J. Tenenbaum, V. Silva, and J. Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 290:2319-2323, 2000. (Pubitemid 32041577)