The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Conceptual Approach to Predict Loan Defaults Using Decision Trees
Abstract
In this chapter, the authors show how to build a decision tree from given real-time data. They interpret the output of decision tree by learning decision tree classifier using really recursive greedy algorithm. Feature selection is made based on classification error using the algorithm called feature split selection algorithm (FSSA), with all different possible stopping conditions for splitting. The authors perform prediction with decision trees using decision tree prediction algorithm (DTPA), followed by multiclass predictions and their probabilities. Finally, they perform splitting procedure on real continuous value input using threshold split selection algorithm (TSSA).
Related Content
Murray Eugene Jennex.
© 2020.
29 pages.
|
Ronald John Lofaro.
© 2020.
18 pages.
|
Mark E. Nissen.
© 2020.
23 pages.
|
Ronel Davel, Adeline S. A. Du Toit, Martie Mearns.
© 2020.
32 pages.
|
Murray Eugene Jennex.
© 2020.
23 pages.
|
Michael J. Zhang.
© 2020.
21 pages.
|
Toshali Dey, Susmita Mukhopadhyay.
© 2020.
23 pages.
|
|
|