arXiv (OAI Expanded)
open access
Policy Targeting with Binary Classification Trees: an Application to Rural Hospital Closures
Empirical researchers often use binary classification trees to identify subgroups at risk of adverse outcomes. We compare two classification tree algorithms in this policy-targeting context: classical classification and regression trees (CART) and the maximizing-distance final-split approach (MDFS).
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Splitting criteria for ordinal decision trees: an experimental study#158652
- Narrowing Data Protection's Enforcement Gap#964839
- Machine Learning for Healthcare-IoT Security: A Review and Risk Mitigation#133958
- Case Study on the Interaction Between the General Data Protection Regulation and Artificial Intelligence Technologies#29954
- Physician assisted death and the Terminally Ill Adults Bill in England and Wales#337605
Record · ID 1110360
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive