论文信息 - Clustering and quantization of binary vectors with stochastic complexity - 字舞流文

Clustering and quantization of binary vectors with stochastic complexity

Stochastic complexity (SC) is used for determining both the codebook and its size in a vector quantizer for binary strings given a training sequence.<<ETX>>

Mats Gyllenberg | Timo Koski | Martin Verlaan

[1] G. Celeux,et al. Clustering criteria for discrete data and latent class models , 1991 .

[2] Lloyd D. Fisher,et al. Approximate confidence intervals for the number of clusters , 1989 .

[3] G. W. Milligan,et al. An examination of procedures for determining the number of clusters in a data set , 1985 .

[4] J. Gower. Maximal predictive classification , 1974 .

[5] R. Howard,et al. Local convergence analysis of a grouped variable version of coordinate descent , 1987 .

[6] Robert M. Gray,et al. Locally Optimal Block Quantizer Design , 1980, Inf. Control..

[7] Mats Gyllenberg,et al. Non-uniqueness of numerical taxonomic structures , 1993 .