Decision tree design and applications in speech processing

Dattatreya, G. R. ; Sarma, V. V. S. (1984) Decision tree design and applications in speech processing IEE Proceedings - Part F: Communications, Radar and Signal Processing, 131 (2). pp. 146-152. ISSN 0143-7070

Full text not available from this repository.

Official URL: http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arn...

Related URL: http://dx.doi.org/10.1049/ip-f-1:19840024

Abstract

The design and operation of the minimum cost classifier, where the total cost is the sum of the measurement cost and the classification cost, is computationally complex. Noting the difficulties associated with this approach, decision tree design directly from a set of labelled samples is proposed in this paper. The feature space is first partitioned to transform the problem to one of discrete features. The resulting problem is solved by a dynamic programming algorithm over an explicitly ordered state space of all outcomes of all feature subsets. The solution procedure is very general and is applicable to any minimum cost pattern classification problem in which each feature has a finite number of outcomes. These techniques are applied to (i) voiced, unvoiced, and silence classification of speech, and (ii) spoken vowel recognition. The resulting decision trees are operationally very efficient and yield attractive classification accuracies.

Item Type:Article
Source:Copyright of this article belongs to The Institution of Electrical Engineers.
ID Code:61405
Deposited On:15 Sep 2011 03:36
Last Modified:15 Sep 2011 03:36

Repository Staff Only: item control page