This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Goal-Directed Classification Using Linear Machine Decision Trees
September 1994 (vol. 16 no. 9)
pp. 888-893

Recent work in feature-based classification has focused on nonparametric techniques that can classify instances even when the underlying feature distributions are unknown. The inference algorithms for training these techniques, however, are designed to maximize the accuracy of the classifier, with all errors weighted equally. In many applications, certain errors are far more costly than others, and the need arises for nonparametric classification techniques that can be trained to optimize task-specific cost functions. This correspondence reviews the linear machine decision tree (LMDT) algorithm for inducing multivariate decision trees, and shows how LMDT can be altered to induce decision trees that minimize arbitrary misclassification cost functions (MCF's). Demonstrations of pixel classification in outdoor scenes show how MCF's can optimize the performance of embedded classifiers within the context of larger image understanding systems.

[1] L. Breiman, J. H. Freidman, R. A. Olshen, and C. J. Stone,Classification and Regression Trees. Belmont, CA: Wadsworth, 1984.
[2] C. E. Brodley and P. E. Utgoff, "Multivariate decision trees,"Machine Learning, to appear.
[3] B. Draper, S. Buluswar, A. Hanson, and E. Riseman, "Information acquisition and fusion in the mobile perception laboratory,"Proc. Sensor Fusion VI, Boston, MA., Aug. 1993, pp. 175-187.
[4] R. O. Duda and H. Fossum, "Pattern classification by iteratively determined linear and piecewise linear discriminant functions,"IEEE Trans. Electron. Comput., vol. 15, no. 2, pp. 220-232, 1966.
[5] R. O. Duda and P. E. Hart,Pattern Classification and Scene Analysis. New York: Wiley, 1973.
[6] M. Frean, "Small nets and short paths: Optimising neural computation," Ph.D. thesis, Ctr. for Cognitive Sci., Univ. of Edinburgh. 1990.
[7] J. Mingers, "An empirical comparison of pruning methods for decision tree induction,"Machine Learning, vol. 4, pp. 227-243, 1989.
[8] N. J. Nilsson,Learning Machines. New York: McGraw-Hill, 1965.
[9] J. R. Quinlan, "Induction of decision trees,"Machine Learning, vol. 1, no. 1, pp. 81-106, 1986.
[10] J. Quinlan, "Simplifying decision trees,"Int. J. Man-Machine Studies, vol. 27, pp. 221-234, 1987.
[11] P. E. Utgoff and C. E. Brodley, "An incremental method for finding multivariate splits for decision trees," inProc. the Seventh Int. Conf. Machine Learning, Austin, TX, 1990 (Morgan-Kaufman).

Index Terms:
pattern recognition; inference mechanisms; decision theory; trees (mathematics); learning systems; computer vision; goal-directed classification; linear machine decision trees; feature-based classification; inference algorithms; nonparametric classification; linear machine decision tree; multivariate decision tree induction; misclassification cost functions; pixel classification; image understanding systems
Citation:
B.A. Draper, C.E. Brodley, P.E. Utgoff, "Goal-Directed Classification Using Linear Machine Decision Trees," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 16, no. 9, pp. 888-893, Sept. 1994, doi:10.1109/34.310684
Usage of this product signifies your acceptance of the Terms of Use.