1 使得树的深度尽可能低

2 如何构建树

  分类节点 使得 熵下降最快

3 先算出原始信息熵值  再分别 根据不同列属性分类 得出相应的 分类后熵值  看哪个属性 使得信息熵降低的最大  作为根节点

4 以此类推

hello,

I am Qi, Bo, and I have applied for UCL dormitory several months ago. My UCL Student ID number is 17059394，application reference 01/01

Could you tell me how to check my application status because I have to know it so that I could buy an appropriate  flight.

Thanks for all your assistance