메뉴 건너뛰기




Volumn 2002-January, Issue , 2002, Pages 382-391

A source coding approach to classification by vector quantization and the principle of minimum description length

Author keywords

Clustering algorithms; Data compression; Probability; Prototypes; Random variables; Source coding; Statistics; Testing; Training data; Vector quantization

Indexed keywords

ALGORITHMS; CLASSIFICATION (OF INFORMATION); CLUSTERING ALGORITHMS; CODES (SYMBOLS); DATA COMPRESSION; ENCODING (SYMBOLS); OPTIMIZATION; PROBABILITY; RANDOM VARIABLES; STATISTICS; TESTING; VECTORS;

EID: 84863345028     PISSN: 10680314     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DCC.2002.999978     Document Type: Conference Paper
Times cited : (5)

References (19)
  • 1
    • 0003408496 scopus 로고    scopus 로고
    • Department of Information and Computer Science, University of California, Irvine
    • C. Blake, E. Keogh, and C. J. Merz, "UCI repository of machine learning databases," http://www.ics.uci.edu/~mlearn/MLRepository.html, Department of Information and Computer Science, University of California, Irvine, 1998.
    • (1998) UCI Repository of Machine Learning Databases
    • Blake, C.1    Keogh, E.2    Merz, C.J.3
  • 6
    • 0035168325 scopus 로고    scopus 로고
    • Minimum discrimination information clustering: Modeling and quantization with Gauss mixtures
    • Thessaloniki, Greece, October
    • R. M. Gray, J. C. Young, and A. K. Aiyer, "Minimum discrimination information clustering: modeling and quantization with Gauss mixtures," Proc. Int. Conf. Image Processing(ICIP), Thessaloniki, Greece, October 2001.
    • (2001) Proc. Int. Conf. Image Processing(ICIP)
    • Gray, R.M.1    Young, J.C.2    Aiyer, A.K.3
  • 7
    • 0001138328 scopus 로고
    • Algorithm AS136: A k-means clustering algorithm
    • J. A. Hartigan and M. A. Wong, "Algorithm AS136: a k-means clustering algorithm," Applied Statistics, vol. 28, pp. 100-108, 1979.
    • (1979) Applied Statistics , vol.28 , pp. 100-108
    • Hartigan, J.A.1    Wong, M.A.2
  • 10
    • 0024124595 scopus 로고
    • Statistical pattern recognition with Neural Networks: Benchmarking studies
    • July
    • T. Kohonen, G. Barna, and R. Chrisley, "Statistical pattern recognition with Neural Networks: benchmarking studies," IEEE Int. Conf. Neural Networks, pp. I-61-68, July 1988.
    • (1988) IEEE Int. Conf. Neural Networks , pp. I61-I68
    • Kohonen, T.1    Barna, G.2    Chrisley, R.3
  • 12
    • 0030737449 scopus 로고    scopus 로고
    • On the role of mismatch in rate distortion theory
    • Jan.
    • A. Lapidoth, "On the role of mismatch in rate distortion theory," IEEE Trans. Inform. Theory, vol. 43, pp. 38-47, Jan. 1997.
    • (1997) IEEE Trans. Inform. Theory , vol.43 , pp. 38-47
    • Lapidoth, A.1
  • 13
    • 0032651623 scopus 로고    scopus 로고
    • Joint image compression and classification with vector quantization and a two dimensional hidden Markov model
    • Snowbird, Utah, March
    • J. Li, R. M. Gray, and R. A. Olshen, "Joint image compression and classification with vector quantization and a two dimensional hidden Markov model," Data Compression Conference (DCC), pp. 23-32, Snowbird, Utah, March 1999.
    • (1999) Data Compression Conference (DCC) , pp. 23-32
    • Li, J.1    Gray, R.M.2    Olshen, R.A.3
  • 14
    • 0029307021 scopus 로고
    • Combining image compression and classification using vector quantization
    • May
    • K. L. Oehler and R. M. Gray, "Combining image compression and classification using vector quantization," IEEE Trans.Pattern Analysis and Machine Intelligence, vol. 17, no. 5, pp, 461-473, May 1995.
    • (1995) IEEE Trans.Pattern Analysis and Machine Intelligence , vol.17 , Issue.5 , pp. 461-473
    • Oehler, K.L.1    Gray, R.M.2
  • 15
    • 0030083869 scopus 로고    scopus 로고
    • Bayes risk weighted vector quantization with posterior estimation for image compression and classification
    • Feb.
    • K. O. Perlmutter, S. M. Perlmutter, R. M. Gray, R. A. Olshen, and K. L. Oehler, "Bayes risk weighted vector quantization with posterior estimation for image compression and classification," IEEE Trans. Image Processing, vol. 5, no. 2, pp. 347-360, Feb. 1996.
    • (1996) IEEE Trans. Image Processing , vol.5 , Issue.2 , pp. 347-360
    • Perlmutter, K.O.1    Perlmutter, S.M.2    Gray, R.M.3    Olshen, R.A.4    Oehler, K.L.5
  • 16
    • 0018015137 scopus 로고
    • Modeling by shortest data description
    • J. Rissanen, "Modeling by shortest data description," Automatica, vol. 14, pp. 465-471, 1978.
    • (1978) Automatica , vol.14 , pp. 465-471
    • Rissanen, J.1
  • 17
    • 0000318553 scopus 로고
    • Stochastic complexity and modeling
    • J. Rissanen, "Stochastic complexity and modeling," The Annals of Statistics, vol. 14, no. 3, pp. 1080-1100, 1986.
    • (1986) The Annals of Statistics , vol.14 , Issue.3 , pp. 1080-1100
    • Rissanen, J.1
  • 18
    • 0026838784 scopus 로고
    • Density estimation by stochastic complexity
    • J. Rissanen, T. P. Speed, and B. Yu, "Density estimation by stochastic complexity," IEEE Trans.Inform. Theory, vol. 38, no.2, pp. 315-323, 1992.
    • (1992) IEEE Trans.Inform. Theory , vol.38 , Issue.2 , pp. 315-323
    • Rissanen, J.1    Speed, T.P.2    Yu, B.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.