Folding Back in Decision Tree Analysis
证明决策树分析的两个基本要求——折叠回溯过程和连续事件节点的可互换性——蕴含独立性。
This note demonstrates that two minimal requirements of decision tree analysis, the folding back procedure and the interchangeability of consecutive event nodes, imply independence.