Research map / Probabilistic and scientific modeling / Molecules and proteins
Rectangular Bounding Process
Xuhui Fan, Bin Li, Scott SIsson
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use RBP-RT instead of ERT | Regression trees · Protein Structure | RMAE: 3.04 \pm 0.03 -> 4.87 \pm 0.10 | Hurt |
| Use RBP-RT instead of ERT | Regression trees · Naval Plants | RMAE: 0.13 \pm 0.01 -> 0.53 \pm 0.17 | Hurt |
| Use RBP-RT instead of ERT | Regression trees · Power Plants | RMAE: 3.65 \pm 0.08 -> 4.78 \pm 0.17 | Hurt |
| Use RBP-RT instead of ERT | Regression trees · Concrete Data | RMAE: 3.80 \pm 0.33 -> 6.34 \pm 0.78 | Hurt |
| Use RBP-RT instead of ERT | Regression trees · Airfoil Self-Noise | RMAE: 0.74 \pm 0.08 -> 1.25 \pm 0.33 | Hurt |
| Use RBP-RM instead of the top-scoring baseline MTA-RM | Relational models · Digg | AUC: 0.83 \pm 0.01 -> 0.83 \pm 0.01 | No clear effect |
| Use RBP-RM instead of BSP-RM | Relational models · Flickr | AUC: 0.93\pm 0.02 -> 0.92 \pm 0.01 | Hurt |
| Use RBP-RM instead of BSP-RM | Relational models · Gplus | AUC: 0.89\pm0.02 -> 0.88 \pm 0.01 | Hurt |
| Use RBP-RM instead of BSP-RM | Relational models · Facebook | AUC: 0.93\pm 0.02 -> 0.92 \pm 0.02 | Hurt |
| Use RBP-RM instead of BSP-RM | Relational models · Twitter | AUC: 0.90\pm 0.01 -> 0.90 \pm 0.02 | No clear effect |
Closest papers by meaning
- Data-Dependent Rectangular Bounding Processes (TPAMI 2025 · similarity 0.97)
- The Ostomachion Process (AAAI 2016 · similarity 0.85)
- Random Tessellation Forests (NeurIPS 2019 · similarity 0.85)
- Consistent Bayesian Spatial Domain Partitioning Using Predictive Spanning Tree Methods (NeurIPS 2026 · similarity 0.83)
- Replicability in Learning: Geometric Partitions and KKM-Sperner Lemma (NeurIPS 2024 · similarity 0.83)
- Beyond Worst-Case Coreset Bounds for $k$-Clustering via Determinantal Sampling (NeurIPS 2026 · similarity 0.83)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
