How many clusters? An information-theoretic perspective

Neural Computation

Volumn 16, Issue 12, 2004, Pages 2483-2506

  Still, Susanne ^a   Bialek, William ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 10044254422     PISSN: 08997667     EISSN: None     Source Type: Journal    
DOI: 10.1162/0899766042321751     Document Type: Review

References (21)

1. Balasubramanian, V. (1997). Statistical inference, Occam's razor, and statistical mechanics on the space of probability distributions. Neural Computation, 9, 349-368.
2. Blatt, M., Wiseman S., & Domany, E. (1996). Superparamagnetic clustering of data. Phys. Rev. Lett., 76, 3251-3254.
3. Bock, H.-H. (1996). Probability models and hypotheses testing in partitioning cluster analysis. In P. Arabie, L. J. Hubert, & G. De Soete (Eds.), Clustering and classification (pp. 378-453). Singapore: World Scientific.
4. Buhmann, J. M., & Held, M. (2000). Model selection in clustering by uniform convergence bounds. In S. A. Solla, T. K. Leen, & K.-R. Müller (Eds.), Advances in neural information processing systems, 12. Cambridge, MA: MIT Press.
5. Eisen, M., Spellman, P. T., Brown P. O., & Botstein, D. (1998). Cluster analysis and display of genome-wide expression patterns. Proc. Nat. Acad. Sci. (USA), 95, 14863.
6. Fraley, C., & Raftery, A. (2002). Model-based clustering, discriminant analysis, and density estimation. J. Am. Stat. Assoc., 97, 611.
7. Gordon, A. D. (1999). Classification. London: Chapman and Hall/CRC Press.
8. Hall, P., & Hannan, E. J. (1988). On stochastic complexity and nonparametric density estimation. Biometrika, 75, 705-714.
9. Horn D., & Gottlieb, A. (2002). Algorithm for data clustering in pattern recognition problems based on quantum mechanics. Phys. Rev. Lett., 88, 018702.
10. Lloyd, S. (1957). Least squares quantization in PCM (Tech. Rep.). Murray Hill, NJ: Bell Laboratories.
11. MacQueen, J. (1967). Some methods for classification and analysis of multivariate observations. In L. M. L. Cam & J. Neyman (Eds.), Proc. 5th Berkeley Symp. Math. Statistics and Probability (Vol. 1, pp. 281-297). Berkeley: University of California Press.
12. Rose, K., Gurewitz, E., & Fox, G. C. (1990). Statistical mechanics and phase transitions in clustering. Phys. Rev. Lett., 65, 945.
13. Roth, V., Lange, T., Braun M. L., & Buhmann, J. M. (2004). Stability-based validation of clustering solutions. Neural Computation, 16, 1299-1323.
14. Shannon, C. E. (1948). A mathematical theory of communication. Bell System Tech. J., 27, 379-423, 623-656.
15. Smyth, P. (2000). Model selection for probabilistic clustering using cross-validated likelihood. Statistics and Computing, 10, 63.
16. Still, S., Bialek W., & Bottou, L. (2004). Geometric clustering using the information bottleneck method. In S. Thrun, L. Saul, & B. Schölkopf (Eds.), Advances in neural information processing systems, 16. Cambridge, MA: MIT Press.
17. Stone, M. (1974). Cross-validatory choice and assessment of statistical predictions. J. R. Stat. Soc., 36, 111.
18. Tibshirani, R., Walther, G., & Hastie, T. (2001). Estimating the number of clusters in a dataset via the Gap statistic. J. R. Stat. Soc. B, 63, 411.
19. Tishby, N., Pereira, F., & Bialek, W. (1999). The information bottleneck method. In B. Hajek & R. S. Sreenivas (Eds.), Proc. 37th Annual Allerton Conf. Urbana: University of Illinois.
20. Treves, A., & Panzeri, S. (1995). The upward bias in measures of information derived from limited data samples. Neural Computation, 7, 399.
21. Ward, J. H. (1963). Hierarchical groupings to optimize an objective function. J. Am. Stat. Assoc., 58, 236.