arXiv (All)
open access
A Moving-Horizon Approximate Branch-and-Reduce Method for Deep Classification Trees
Despite the importance for interpretability, decision trees face severe scalability challenges. Existing global optimal methods are often limited by binary feature selection and shallow tree depths, whereas traditional heuristic approaches frequently sacrifice predictive accuracy. To overcome these
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
- TransBreast-Net: An interpretable vision transformer ensemble for breast cancer histopathology classification.#362188
- Scaling Up Forest Vision with Synthetic Data.#364647
- Serum and Tissue Metabolite-based Prediction of Sentinel Lymph Node Metastasis in Breast Cancer#880343
- Advancing Interaction-Sensitive Feature Selection: Novel Relief-Based Algorithms, Expanded Comparisons, and Recommendations for Biomedical Data Mining#618549
- TempTPI: Informer-Based trajectory prediction for maritime vessels#996658
Record · ID 1142796
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