Clustering Based on LVQ and a Split and Merge Procedure
暂无分享,去创建一个
[1] Anil K. Jain,et al. Algorithms for Clustering Data , 1988 .
[2] Teuvo Kohonen,et al. Self-Organizing Maps , 2010 .
[3] Naonori Ueda,et al. Bayesian model search for mixture models based on optimizing variational bounds , 2002, Neural Networks.
[4] David G. Stork,et al. Pattern Classification (2nd ed.) , 1999 .
[5] David G. Stork,et al. Pattern Classification , 1973 .
[6] James C. Bezdek,et al. Pattern Recognition with Fuzzy Objective Function Algorithms , 1981, Advanced Applications in Pattern Recognition.
[7] Fujiki Morii,et al. Clustering by the K-Means Algorithm Using a Split and Merge Procedure , 2006 .
[8] J. MacQueen. Some methods for classification and analysis of multivariate observations , 1967 .
[9] Olli Nevalainen,et al. Iterative split-and-merge algorithm for vector quantization codebook generation , 1998 .
[10] James C. Bezdek,et al. Generalized clustering networks and Kohonen's self-organizing scheme , 1993, IEEE Trans. Neural Networks.
[11] Naonori Ueda,et al. EM algorithm with split and merge operations for mixture models , 2000 .
[12] William H. Press,et al. Numerical recipes in C , 2002 .
[13] Robert M. Gray,et al. An Algorithm for Vector Quantizer Design , 1980, IEEE Trans. Commun..
[14] A Gordon,et al. Classification, 2nd Edition , 1999 .