← 返回卡片

原书出处

Machine Learning Fundamentals: Concepts, Models, and Applications

First edition · 核验版本的摘录快照 · 导入于 2026-11-14T17:39:01.612Z

Tree pruning: decision tree’s complexity is defined as the number of splits in the tree. Trees with fewer branches are recommended as they are simple to grasp and less prone to cluster the data. Working through each leaf node in the tree and evaluating the effect of deleting it using a hold-out test set is the quickest and simplest pruning approach.

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Machine Learning Fundamentals: Concepts, Models, and Applications/_epub-src/OEBPS/xhtml/19_chapter06.xhtml

EPUB SHA-256:cd5888fc4b08a1424ddc108808de40630455d9f7e3f562ef4ee7cc2b70acad2a