Advertisement

A Hill-Climbing Approach for Optimizing Classification Trees

  • Xiaorong Sun
  • Steve Y. Chiu
  • Louis Anthony Cox
Part of the Lecture Notes in Statistics book series (LNS, volume 112)

Abstract

We consider the problem of minimizing the expected cost of determining the correct value of a binary-valued function when it is costly to inspect the values of its arguments. This type of problem arises in distributed computing, in the design of diagnostic expert systems, in reliability analysis of multi-component systems, and in many other applications. Any feasible solution to the problem can be described by a sequential inspection procedure which is usually represented by a binary classification tree. In this paper, we propose an efficient hill-climbing algorithm to search for the optimal or near-optimal classification trees. Computational results show that the hill-climbing approach was able to find optimal solutions for 95% of the cases tested.

Keywords

Decision Tree Classification Tree Expected Cost Coherent System Pattern Vector 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Barlow75]
    R.E. Barlow and F. Proschan, Statistical theory of reliability and life testing, Holt, Rinehart and Winston, New York, 1975.MATHGoogle Scholar
  2. [Ben-Dov81]
    Y. Ben-Dov, Optimal testing procedures for special structures of coherent system, Management Science 27, No. 12 (1981), 1410–1420.MATHCrossRefGoogle Scholar
  3. [Chang90]
    M.F. Chang, W. Shi and W.K. Fuchs, Optimal diagnosis procedures for kout-of-n system, IEEE Trans. on Computers 39 (4) (1990) 559–564.CrossRefGoogle Scholar
  4. [Cox89]
    L.A. Cox, Y. Qiu and W. Kuehner, Heuristic least-cost computation of discrete classification functions with uncertain argument values, Annals of Operations research, 21 (1989) 1–30.MathSciNetMATHCrossRefGoogle Scholar
  5. [Sheng69]
    C.L. Sheng, Threshold Logic, Academic Press, New York, 1969.Google Scholar
  6. [Tarjan72]
    R.E. Tarjan, Depth-first search and linear graph algorithms, SIAM J. Computing 1 (1972) 146–160.MathSciNetMATHCrossRefGoogle Scholar
  7. [Velde90]
    W. Van de Velde, Incremental induction of topologically minimal trees, Proc. of the Seventh International Conference on Machine Learning (1990) 66–74.Google Scholar

Copyright information

© Springer-Verlag New York, Inc. 1996

Authors and Affiliations

  • Xiaorong Sun
    • 1
  • Steve Y. Chiu
    • 1
  • Louis Anthony Cox
    • 1
  1. 1.U S WEST Advanced TechnologyBoulderUSA

Personalised recommendations