论文信息 - Pairwise clustering using a Monte Carlo Markov Chain - 字舞流文

Pairwise clustering using a Monte Carlo Markov Chain

[1] Kurt Binder,et al. A Guide to Monte Carlo Simulations in Statistical Physics , 2000 .

[2] Carl E. Rasmussen,et al. The Infinite Gaussian Mixture Model , 1999, NIPS.

[3] Anil K. Jain,et al. Data clustering: a review , 1999, CSUR.

[4] Hui Yuan,et al. Applications of simulated annealing minimization technique to unsupervised classification of remotely sensed data , 1999, IEEE 1999 International Geoscience and Remote Sensing Symposium. IGARSS'99 (Cat. No.99CH36293).

[5] Pierre Hansen,et al. An Interior Point Algorithm for Minimum Sum-of-Squares Clustering , 1997, SIAM J. Sci. Comput..

[6] L. Wasserman,et al. Practical Bayesian Density Estimation Using Mixtures of Normals , 1997 .

[7] P. Green,et al. Corrigendum: On Bayesian analysis of mixtures with an unknown number of components , 1997 .

[8] Adrian E. Raftery,et al. Inference in model-based cluster analysis , 1997, Stat. Comput..

[9] P. Green,et al. On Bayesian Analysis of Mixtures with an Unknown Number of Components (with discussion) , 1997 .

[10] Donald E. Brown,et al. A practical application of simulated annealing to clustering , 1990, Pattern Recognit..

[11] Richard C. Dubes,et al. Experiments in projection and clustering by simulated annealing , 1989, Pattern Recognit..

[12] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.

[13] N. Metropolis,et al. Equation of State Calculations by Fast Computing Machines , 1953, Resonance.