Flexible priors for exemplar-based clustering

Proceedings of the 24th Conference on Uncertainty in Artificial Intelligence, UAI 2008

Volumn , Issue , 2008, Pages 537-545

  Tarlow, Daniel ^a   Zemel, Richard S ^a   Frey, Brendan J ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

AFFINITY PROPAGATION; BELIEF PROPAGATION ALGORITHM; CLUSTERING METHODS; CLUSTERING PROBLEMS; CLUSTERINGS; DATA PARTITION; DATA POINTS; DIRICHLET PROCESS; DISTRIBUTION OF CLUSTER; MAX-PRODUCT; NEW MODEL; NUMBER OF CLUSTERS; SIMILARITY MEASURE;

ARTIFICIAL INTELLIGENCE;

ALGORITHMS;

EID: 80053229205     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. C. Antoniak. Mixtures of dirichlet processes with applications to bayesian nonparametric problems. The Annals of Statistics, 2:1152-1174, 1974.
2. Aristotle. Categories. The University of Adelaide Library, 2007.
3. David M. Blei and Michael I. Jordan. Variational methods for the dirichlet process. In ICML, 2004.
4. D. Dueck and B.J. Frey. Non-metric affinity propagation for unsupervised image categorization. In International Conference on Computer Vision (ICCV), 2007.
5. B.J. Frey and D. Dueck. Clustering by passing messages between data points. Science, 315:972-976, February 2007. (Pubitemid 46281181)
6. A. Efros G. Mori, X. Ren and J. Malik. Recovering human body configurations: Combining segmentation and recognition. In IEEE Computer Vision and Pattern Recognition, 2004.
7. I. Givoni and B. Frey. A binary model for affinity propagation. Submitted to Neural Computation, 2008.
8. T. L. Griffiths and Z. Ghahramani. Infinite latent feature models and the indian buffet process. In Gatsby Computational Neuroscience Unit Technical Report GCNU TR 2005-001, 2005.
9. R. Gupta, A Diwan, and S. Sarawagi. Efficient inference with cardinality-based clique potentials. In ICML, volume 227, pages 329-336, 2007.
10. A. K. Jain and R. C. Dubes. Algorithms for Clustering Data. Prentice-Hall, 1981.
11. D. Lashkari and P. Golland. Convex clustering with exemplar-based models. In Advances in Neural Information Processing Systems (NIPS), 2007.
12. D. Martin, C. Fowlkes, and J. Malik. Learning to detect natural image boundaries using brightness and texture. In Advances in Neural Information Processing Systems (NIPS), 2002.
13. Q. D. Morris, B. J. Frey, and C. J. Paige. Denoising and untangling graphs using degree priors. In NIPS, 2003.
14. Radford Neal. Markov chain sampling methods for dirichlet process mixture models. Journal of Computational and Graphical Statistics, 9(2), 2000.
15. W. M. Rand. Objective criteria for the evaluation of clustering methods. Journal of the American Statistical Association, 66:846-850, 1971.
16. X. Ren and J. Malik. Learning a classification model for segmentation. In ICCV, 2003.
17. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8):888-905, August 2000.
18. Max Welling. Flexible priors for infinite mixture models. In ICML Workshop on Nonparametric Bayesian Methods, 2006.
19. R. Xu and D. Wunsch. Survey of clustering algorithms. IEEE Transactions on Neural Networks, 16, 2005.