A Decision Tree for

Example: C4.5 algorithm. Simple depth-first construction. Uses Information Gain; Sorts Continuous Attributes at each node. Needs entire data to fit in memory.
展开查看详情