An iterative 'flip-flop' approximation of the most informative split in the construction of decision trees
- 1 January 1991
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 565-568 vol.1
- https://doi.org/10.1109/icassp.1991.150402
Abstract
The authors seek a fast algorithm for finding the best question to ask (i.e., best split of predictor values) about a predictor variable when predicting membership in more than two categories. They give a fast iterative algorithm for finding a suboptimal question in the N category problem by exploiting a fast algorithm for finding the optimal question in the two-category problem. The algorithm has been used in a number of speech recognition applications.Keywords
This publication has 4 references indexed in Scilit:
- Large vocabulary natural language continuous speech recognitionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Optimal partitioning for classification and regression treesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1991
- Automatic phonetic baseform determinationPublished by Association for Computational Linguistics (ACL) ,1990
- A tree-based statistical language model for natural language speech recognitionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1989