Skip to main content

Decision Tree Based Clustering

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2412))

Abstract

A decision tree can be used not only as a classifier but also as a clustering method. One of such applications can be found in automatic speech recognition using hidden Markov models (HMMs). Due to the insufficient amount of training data, similar states of triphone HMMs are grouped together using a decision tree to share a common probability distribution. At the same time, in order to predict the statistics of unseen triphones, the decision tree is used as a classifier as well. In this paper, we study several cluster split criteria in decision tree building algorithms for the case where the instances to be clustered are probability density functions. Especially, when Gaussian probability distributions are to be clustered, we have found that the Bhattacharyya distance based measures are more consistent than the conventional log likelihood based measure.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. Fukunaga. Introduction to Statistical Pattern Recognition. Academic Press, 1990.

    Google Scholar 

  2. M. Hwang and X. Huang. Shared-distribution hidden Markov models for speech recognition. IEEE Transactions on Speech and Audio Processing, 1(4):414–420, October 1993.

    Google Scholar 

  3. M. Hwang, X. Huang, and F. Alleva. Predicting unseen triphones with senones. IEEE Transactions on Speech and Audio Processing, 4(6):412–419, November 1996.

    Google Scholar 

  4. K. Lee. Context-dependent phonetic hidden Markov models for speaker-independent continuous speech recognition. IEEE Transactions on Acoustics, Speech, and Signal Processing, 38(4):599–609, April 1990.

    Google Scholar 

  5. NIST Speech Disc 1-1.1. TIMIT Acoustic-Phonetic Continuous Speech Corpus, October 1990.

    Google Scholar 

  6. J. Quinlan. Induction of decision trees. Machine Learning, pages 81–106, 1986.

    Google Scholar 

  7. S. Young, J. Odell, and P. Woodland. Tree-based state tying for high accuracy acoustic modelling. DARPA Human Language Technology Workshop, pages 307–312, March 1994.

    Google Scholar 

  8. S. Young and P. Woodland. State clustering in HMM-based continuous speech recognition. Computer Speech and Language, 8(4):369–394, 1994.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yook, D. (2002). Decision Tree Based Clustering. In: Yin, H., Allinson, N., Freeman, R., Keane, J., Hubbard, S. (eds) Intelligent Data Engineering and Automated Learning — IDEAL 2002. IDEAL 2002. Lecture Notes in Computer Science, vol 2412. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45675-9_73

Download citation

  • DOI: https://doi.org/10.1007/3-540-45675-9_73

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44025-3

  • Online ISBN: 978-3-540-45675-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics