This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Bayesian and Decision Tree Approaches for Pattern Recognition Including Feature Measurement Costs
March 1981 (vol. 3 no. 3)
pp. 293-298
G. R. Dattatreya, School of Automation, Indian Institute of Science, Bangalore, India.
V. V. S. Sarma, School of Automation, Indian Institute of Science, Bangalore, India.
The minimum cost classifier when general cost functions are associated with the tasks of feature measurement and classification is formulated as a decision graph which does not reject class labels at intermediate stages. Noting its complexities, a heuristic procedure to simplify this scheme to a binary decision tree is presented. The optimization of the binary tree in this context is carried out using dynamic programming. This technique is applied to the voiced-unvoiced-silence classification in speech processing.
Citation:
G. R. Dattatreya, V. V. S. Sarma, "Bayesian and Decision Tree Approaches for Pattern Recognition Including Feature Measurement Costs," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 3, no. 3, pp. 293-298, March 1981, doi:10.1109/TPAMI.1981.4767102
Usage of this product signifies your acceptance of the Terms of Use.