Classification Trees for a Binary Response
In this chapter we discuss the technical aspect of the recursive partitioning technique, following the brief introduction from Chapter 2. This chapter, particularly the less technical parts of it, is helpful for understanding the methodological and theoretical aspects of recursive partitioning as well as for efficiently and correctly using the computer software. For clarity, we concentrate on the simplest case—a binary response. However, the basic framework of recursive partitioning is established here.
KeywordsRoot Node Internal Node Classification Tree Terminal Node Binary Response
Unable to display preview. Download preview PDF.