- Machine Learning in Java
- AshishSingh Bhatia Bostjan Kaluza
- 86字
- 2021-06-10 19:29:59
Decision tree learning
Decision tree learning builds a classification tree, where each node corresponds to one of the attributes; edges correspond to a possible value (or intervals) of the attribute from which the node originates; and each leaf corresponds to a class label. A decision tree can be used to visually and explicitly represent the prediction model, which makes it a very transparent (white box) classifier. Notable algorithms are ID3 and C4.5, although many alternative implementations and improvements exist (for example, J48 in Weka).
推薦閱讀
- 電力自動化實用技術問答
- 自動控制原理
- 機艙監測與主機遙控
- 云原生架構進階實戰
- 網絡安全管理實踐
- 分數階系統分析與控制研究
- Docker on Amazon Web Services
- Linux系統下C程序開發詳解
- Mastering Predictive Analytics with scikit:learn and TensorFlow
- 機器人制作入門(第4版)
- EJB JPA數據庫持久層開發實踐詳解
- Microsoft System Center Data Protection Manager Cookbook
- 計算機應用基礎學習指導與練習(Windows XP+Office 2003)
- Hands-On Microservices with C#
- Apache Spark Machine Learning Blueprints