Decision tree based clustering

Dongsuk Yook

doi:10.1007/3-540-45675-9_73

Decision tree based clustering

Dongsuk Yook^*

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Citation (Scopus)

Abstract

Adecision 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.

Original language	English
Title of host publication	Intelligent Data Engineering and Automated Learning - IDEAL 2002 - 3rd International Conference, Proceedings
Editors	Hujun Yin, Nigel Allinson, Richard Freeman, John Keane, Simon Hubbard
Publisher	Springer Verlag
Pages	487-492
Number of pages	6
ISBN (Print)	9783540440253
DOIs	https://doi.org/10.1007/3-540-45675-9_73
Publication status	Published - 2002
Event	3rd International Conference on Intelligent Data Engineering and Automated Learning, IDEAL 2002 - Manchester, United Kingdom Duration: 2002 Aug 12 → 2002 Aug 14

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2412
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	3rd International Conference on Intelligent Data Engineering and Automated Learning, IDEAL 2002
Country/Territory	United Kingdom
City	Manchester
Period	02/8/12 → 02/8/14

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2002.

Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/3-540-45675-9_73

Cite this

Yook, D. (2002). Decision tree based clustering. In H. Yin, N. Allinson, R. Freeman, J. Keane, & S. Hubbard (Eds.), Intelligent Data Engineering and Automated Learning - IDEAL 2002 - 3rd International Conference, Proceedings (pp. 487-492). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2412). Springer Verlag. https://doi.org/10.1007/3-540-45675-9_73

Decision tree based clustering. / Yook, Dongsuk.
Intelligent Data Engineering and Automated Learning - IDEAL 2002 - 3rd International Conference, Proceedings. ed. / Hujun Yin; Nigel Allinson; Richard Freeman; John Keane; Simon Hubbard. Springer Verlag, 2002. p. 487-492 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2412).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Yook, D 2002, Decision tree based clustering. in H Yin, N Allinson, R Freeman, J Keane & S Hubbard (eds), Intelligent Data Engineering and Automated Learning - IDEAL 2002 - 3rd International Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2412, Springer Verlag, pp. 487-492, 3rd International Conference on Intelligent Data Engineering and Automated Learning, IDEAL 2002, Manchester, United Kingdom, 02/8/12. https://doi.org/10.1007/3-540-45675-9_73

Yook D. Decision tree based clustering. In Yin H, Allinson N, Freeman R, Keane J, Hubbard S, editors, Intelligent Data Engineering and Automated Learning - IDEAL 2002 - 3rd International Conference, Proceedings. Springer Verlag. 2002. p. 487-492. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-45675-9_73

Yook, Dongsuk. / Decision tree based clustering. Intelligent Data Engineering and Automated Learning - IDEAL 2002 - 3rd International Conference, Proceedings. editor / Hujun Yin ; Nigel Allinson ; Richard Freeman ; John Keane ; Simon Hubbard. Springer Verlag, 2002. pp. 487-492 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{7843f568eb3c4acb9f71f611b4ffdb9b,

title = "Decision tree based clustering",

abstract = "Adecision 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.",

author = "Dongsuk Yook",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2002. Copyright: Copyright 2020 Elsevier B.V., All rights reserved.; 3rd International Conference on Intelligent Data Engineering and Automated Learning, IDEAL 2002 ; Conference date: 12-08-2002 Through 14-08-2002",

year = "2002",

doi = "10.1007/3-540-45675-9\_73",

language = "English",

isbn = "9783540440253",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "487--492",

editor = "Hujun Yin and Nigel Allinson and Richard Freeman and John Keane and Simon Hubbard",

booktitle = "Intelligent Data Engineering and Automated Learning - IDEAL 2002 - 3rd International Conference, Proceedings",

}

TY - GEN

T1 - Decision tree based clustering

AU - Yook, Dongsuk

PY - 2002

Y1 - 2002

N2 - Adecision 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.

AB - Adecision 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.

UR - https://www.scopus.com/pages/publications/84947976088

UR - https://www.scopus.com/pages/publications/84947976088#tab=citedBy

U2 - 10.1007/3-540-45675-9_73

DO - 10.1007/3-540-45675-9_73

M3 - Conference contribution

AN - SCOPUS:84947976088

SN - 9783540440253

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 487

EP - 492

BT - Intelligent Data Engineering and Automated Learning - IDEAL 2002 - 3rd International Conference, Proceedings

A2 - Yin, Hujun

A2 - Allinson, Nigel

A2 - Freeman, Richard

A2 - Keane, John

A2 - Hubbard, Simon

PB - Springer Verlag

T2 - 3rd International Conference on Intelligent Data Engineering and Automated Learning, IDEAL 2002

Y2 - 12 August 2002 through 14 August 2002

ER -

Decision tree based clustering

Abstract

Publication series

Other

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this