A data scientist would like to model a complex phenomenon using a large data set composed of categorical, discrete, and continuous variables. After completing exploratory data analysis, the data scientist is reasonably certain that no linear relationship exists between the predictors and the target. Although the phenomenon is complex, the data scientist still wants to maintain the highest possible degree of interpretability in the final model. Which of the following algorithms best meets this objective?
Show Answer
Hide Answer
Correct Answer:
B
Decision trees capture complex, nonlinear relationships with a transparent, rule-based structure. They remain highly interpretable (each split can be visualized and explained) unlike ensembles (random forests) or neural networks, and they don't rely on linear assumptions.
