arXiv (All)
open access
Sparse Oblique Rule Boosting for Simpler Additive Rule Ensembles
Small additive ensembles of symbolic rules offer interpretable prediction models. Traditionally, these ensembles use rule conditions based on conjunctions of simple threshold propositions $x \geq t$ on a single input variable $x$ and threshold $t$, resulting geometrically in axis-parallel polytopes
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
- Escaping Brittleness : The Possibilities of General Purpose Machine Learning Algorithms Applied To Parallel Rule-Based Systems#478142
- Splitting criteria for ordinal decision trees: an experimental study#158652
- DICS: Data-Informed Centroid Splitting for Decision Tree Classifiers#471226
- Are Algorithms Value-Free?#86545
- Parity Tests under Ties: A One-Test Lifting Theorem#1117130
Record · ID 974004
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