ScholarGate
Pembantu
Machine learningMachine learning

Pohon Keputusan Boleh Dijelas

Pohon Keputusan Boleh Dijelas ialah pohon klasifikasi atau regresi yang sengaja dibina agar cetek, mudah dibaca, dan boleh diaudit — menghasilkan set peraturan jika-maka yang terhingga yang boleh disahkan oleh manusia tanpa alat tambahan. Ia berada di persimpangan pemodelan prediktif dan AI Boleh Dijelas (XAI), dipilih apabila pihak berkepentingan mesti memahami dan mempercayai setiap ramalan yang dibuat oleh model.

Buka dalam MethodMindTidak lama lagiVideoTidak lama lagiDownload slides

Baca kaedah sepenuhnya

Ahli sahaja

Log masuk dengan akaun percuma untuk membaca bahagian ini.

Log masuk

Method map

The neighbourhood of related methods — select a node to explore.

Sumber

  1. Breiman, L., Friedman, J., Olshen, R. A., & Stone, C. J. (1984). Classification and Regression Trees. Wadsworth & Brooks/Cole. ISBN: 978-0-412-04841-8
  2. Rudin, C. (2019). Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead. Nature Machine Intelligence, 1(5), 206–215. DOI: 10.1038/s42256-019-0048-x

Cara memetik halaman ini

ScholarGate. (2026, June 3). Explainable Decision Tree (Interpretable Rule-Based Classification and Regression Tree). ScholarGate. https://scholargate.app/ms/machine-learning/explainable-decision-tree

Which method?

Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.

Compare side by side

Dirujuk oleh

ScholarGateExplainable Decision Tree (Explainable Decision Tree (Interpretable Rule-Based Classification and Regression Tree)). Dicapai 2026-06-15 daripada https://scholargate.app/ms/machine-learning/explainable-decision-tree · Set data: https://doi.org/10.5281/zenodo.20539026