On the public citation graph
Runtime Optimizations for Tree-Based Machine Learning Models
0 signed · 101 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-540-88693-8_44openalex-snapshot
Implementing Decision Trees and Forests on a GPU
inferredcites →https://doi.org/10.1007/978-3-642-14267-3openalex-snapshot
Learning to Rank for Information Retrieval
inferredcites →https://doi.org/10.1007/978-3-642-36973-5_13openalex-snapshot
Training Efficient Tree-Based Models for Document Ranking
inferredcites →https://doi.org/10.1016/j.jpdc.2010.07.005openalex-snapshot
Massively parallel acceleration of a document-similarity classifier to detect web attacks
inferredcites →https://doi.org/10.1017/cbo9781139042918.009openalex-snapshot
Large-Scale Learning to Rank Using Boosted Decision Trees
inferredcites →https://doi.org/10.1109/fccm.2012.47openalex-snapshot
Accelerating a Random Forest Classifier: Multi-Core, GP-GPU, or FPGA?
inferredcites →https://doi.org/10.1109/micro.1997.645801openalex-snapshot
A framework for balancing control flow and predication
inferredcites →https://doi.org/10.1109/mm.2006.27openalex-snapshot
Wish Branches: Enabling Adaptive and Aggressive Predicated Execution
inferredcites →https://doi.org/10.1145/1095408.1095418openalex-snapshot
The Future of Microprocessors
inferredcites →https://doi.org/10.1145/1409360.1409380openalex-snapshot
Breaking the memory wall in MonetDB
inferredcites →https://doi.org/10.1145/1645953.1646301openalex-snapshot
Stochastic gradient boosted distributed decision trees
inferredcites →https://doi.org/10.1145/1718487.1718538openalex-snapshot
Early exit optimizations for additive machine learned ranking systems
inferredcites →https://doi.org/10.1145/1835449.1835676openalex-snapshot
Learning to rank for information retrieval
inferredcites →https://doi.org/10.1145/1941487.1941507openalex-snapshot
The future of microprocessors
inferredcites →https://doi.org/10.1145/1963405.1963461openalex-snapshot
Parallel boosted regression trees for web search ranking
inferredcites →https://doi.org/10.1145/2009916.2009932openalex-snapshot
Bagging gradient-boosted trees for high precision, low variance ranking models
inferredcites →https://doi.org/10.1145/2009916.2009934openalex-snapshot
A cascade ranking model for efficient ranked retrieval
inferredcites →https://doi.org/10.1145/582415.582418openalex-snapshot
Cumulated gain-based evaluation of IR techniques
inferredcites →https://doi.org/10.1186/1471-2105-11-2openalex-snapshot
Predicting gene function using hierarchical multi-label decision tree ensembles
inferredcites →https://doi.org/10.1186/1471-2105-9-275openalex-snapshot
Classification of premalignant pancreatic cancer mass-spectrometry data using decision tree ensembles
inferredcites →https://doi.org/10.1214/aos/1013203451openalex-snapshot
Greedy function approximation: A gradient boosting machine.
inferredcites →https://doi.org/10.1561/0600000035openalex-snapshot
Decision Forests: A Unified Framework for Classification, Regression, Density Estimation, Manifold Learning and Semi-Supervised Learning
inferredcites →https://doi.org/10.1561/9781601985415openalex-snapshot
Decision Forests: A Unified Framework for Classification, Regression, Density Estimation, Manifold Learning and Semi-Supervised Learning
inferredcites →https://doi.org/10.2139/ssrn.2003874openalex-snapshot
Financial Black Swans Driven by Ultrafast Machine Ecology
inferredcites →https://doi.org/10.2200/s00201ed1v01y200907cac007openalex-snapshot
The Memory System: You Can't Avoid It, You Can't Ignore It, You Can't Fake It
inferredcites →https://doi.org/10.2200/s00348ed1v01y201104hlt012openalex-snapshot
Learning to Rank for Information Retrieval and Natural Language Processing
inferredcites →https://doi.org/10.48550/arxiv.1206.6451openalex-snapshot
The Greedy Miser: Learning under Test-time Budgets
inferredcites →https://doi.org/10.5555/266800.266810openalex-snapshot
A framework for balancing control flow and predication
inferredcites →https://doi.org/10.7551/mitpress/7503.003.0029openalex-snapshot
Learning to Rank with Nonsmooth Cost Functions
inferredcites →https://doi.org/10.7916/d8t441zbopenalex-snapshot
Cache Conscious Indexing for Decision-Support in Main Memory
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-90582-8_6openalex-snapshot
In-Memory Computing with Non-volatile Memristor CAM Circuits
inferred← citeshttps://doi.org/10.1007/978-3-030-91851-4_6openalex-snapshot
Communicating Value in Healthcare Marketing from a Social Media Perspective
inferred← citeshttps://doi.org/10.1007/978-3-031-26419-1_32openalex-snapshot
Immediate Split Trees: Immediate Encoding of Floating Point Split Values in Random Forests
inferred← citeshttps://doi.org/10.1007/978-3-319-41321-1_11openalex-snapshot
Towards Machine Learning on the Automata Processor
inferred← citeshttps://doi.org/10.1007/978-3-319-71273-4_36openalex-snapshot
Efficient Traversal of Large Ensembles of Decision Trees.
inferred← citeshttps://doi.org/10.1007/s10994-021-06047-xopenalex-snapshot
RADE: resource-efficient supervised anomaly detection using decision tree-based ensemble methods
inferred← citeshttps://doi.org/10.1016/j.ipm.2016.05.004openalex-snapshot
Quality versus efficiency in document scoring with learning-to-rank models
inferred← citeshttps://doi.org/10.1016/j.measurement.2025.117916openalex-snapshot
Application of robust hybrid tree-based machine learning methods in accurate prediction of underground rock saturation exponent
inferred← citeshttps://doi.org/10.1016/j.ress.2022.108720openalex-snapshot
Discovering injury severity risk factors in automobile crashes: A hybrid explainable AI framework for decision support
inferred← citeshttps://doi.org/10.1016/j.sigpro.2017.01.029openalex-snapshot
Highly efficient hierarchical online nonlinear regression using second order methods
inferred← citeshttps://doi.org/10.1016/j.simpa.2023.100532openalex-snapshot
Atlantic—Automated data preprocessing framework for supervised machine learning
inferred← citeshttps://doi.org/10.1038/s41467-021-25873-0openalex-snapshot
Tree-based machine learning performed in-memory with memristive analog CAM
inferred← citeshttps://doi.org/10.1039/d4cp04887copenalex-snapshot
Machine learning assisted approximation of descriptors (CO and OH) binding energy on Cu-based bimetallic alloys
inferred← citeshttps://doi.org/10.1088/1741-2552/add76fopenalex-snapshot
Memory optimized random forest classifier for EEG seizure detection in implantable monitoring and closed-loop neurostimulation devices
inferred← citeshttps://doi.org/10.1088/2057-1976/ac11c0openalex-snapshot
High throughput software-based gradient tree boosting positioning for PET systems
inferred← citeshttps://doi.org/10.1109/access.2018.2879025openalex-snapshot
Exploration and Exploitation of New Knowledge Emergence to Improve the Collective Intelligent Decision-Making Level of Web-of-Cells With Cyber-Physical-Social Systems Based on Complex Network Modeling
inferred← citeshttps://doi.org/10.1109/access.2022.3155179openalex-snapshot
Predictive Shoulder Kinematics of Rehabilitation Exercises Through Immersive Virtual Reality
inferred← citeshttps://doi.org/10.1109/gcat62922.2024.10923909openalex-snapshot
Code Optimization for Python using Large Pre-Trained Model
inferred← citeshttps://doi.org/10.1109/icctac.2017.8249985openalex-snapshot
An efficient machine Learning Bayes Sentiment Classification method based on review comments
inferred← citeshttps://doi.org/10.1109/icdm.2018.00017openalex-snapshot
Realization of Random Forest for Real-Time Evaluation through Tree Framing
inferred← citeshttps://doi.org/10.1109/ispass51385.2021.00047openalex-snapshot
Hardware Acceleration for DBMS Machine Learning Scoring: Is It Worth the Overheads?
inferred← citeshttps://doi.org/10.1109/micro56248.2022.00043openalex-snapshot
Treebeard: An Optimizing Compiler for Decision Tree Based ML Inference
inferred← citeshttps://doi.org/10.1109/pact58117.2023.00023openalex-snapshot
Accelerating Decision-Tree-Based Inference Through Adaptive Parallelization
inferred← citeshttps://doi.org/10.1109/tcad.2022.3199903openalex-snapshot
Optimizing Random Forest-Based Inference on RISC-V MCUs at the Extreme Edge
inferred← citeshttps://doi.org/10.1109/tpds.2018.2860982openalex-snapshot
Parallel Traversal of Large Ensembles of Decision Trees
inferred← citeshttps://doi.org/10.1145/2600428.2609525openalex-snapshot
Cache-conscious runtime optimization for ranking ensembles
inferred← citeshttps://doi.org/10.1145/2766462.2767776openalex-snapshot
Speeding up Document Ranking with Rank-based Features
inferred← citeshttps://doi.org/10.1145/2911451.2911520openalex-snapshot
A Comparison of Cache Blocking Methods for Fast Execution of Ensemble-based Score Computation
inferred← citeshttps://doi.org/10.1145/2911451.2914758openalex-snapshot
Exploiting CPU SIMD Extensions to Speed-up Document Scoring with Tree Ensembles
inferred← citeshttps://doi.org/10.1145/2911451.2914763openalex-snapshot
Post-Learning Optimization of Tree Ensembles for Efficient Ranking
inferred← citeshttps://doi.org/10.1145/2987380openalex-snapshot
Fast Ranking with Additive Ensembles of Oblivious and Non-Oblivious Regression Trees
inferred← citeshttps://doi.org/10.1145/3077136.3080819openalex-snapshot
Efficient Cost-Aware Cascade Ranking in Multi-Stage Retrieval
inferred← citeshttps://doi.org/10.1145/3121050.3121109openalex-snapshot
Efficiency/Effectiveness Trade-offs in Learning to Rank
inferred← citeshttps://doi.org/10.1145/3130332.3130346openalex-snapshot
Scalability and Performance of Random Forest based Learning-to-Rank for Information Retrieval
inferred← citeshttps://doi.org/10.1145/3159652.3159676openalex-snapshot
Query Driven Algorithm Selection in Early Stage Retrieval
inferred← citeshttps://doi.org/10.1145/3209978.3210191openalex-snapshot
Efficient Query Processing Infrastructures
inferred← citeshttps://doi.org/10.1145/3269206.3269316openalex-snapshot
Low-Complexity Supervised Rank Fusion Models
inferred← citeshttps://doi.org/10.1145/3331184.3334824openalex-snapshot
Learning to Rank in Theory and Practice
inferred← citeshttps://doi.org/10.1145/3448016.3457239openalex-snapshot
HedgeCut: Maintaining Randomised Trees for Low-Latency Machine Unlearning
inferred← citeshttps://doi.org/10.1145/3477495.3531704openalex-snapshot
ReNeuIR: Reaching Efficiency in Neural Information Retrieval
inferred← citeshttps://doi.org/10.1145/3508019openalex-snapshot
Efficient Realization of Decision Trees for Real-Time Inference
inferred← citeshttps://doi.org/10.1145/3517207.3526970openalex-snapshot
Efficient multiclass classification with duet
inferred← citeshttps://doi.org/10.1145/3539618.3591922openalex-snapshot
ReNeuIR at SIGIR 2023: The Second Workshop on Reaching Efficiency in Neural Information Retrieval
inferred← citeshttps://doi.org/10.1145/3580305.3599933openalex-snapshot
Yggdrasil Decision Forests: A Fast and Extensible Decision Forests Library
inferred← citeshttps://doi.org/10.1145/3582900.3582916openalex-snapshot
Report on the 1st Workshop on Reaching Efficiency in Neural Information Retrieval (ReNeuIR 2022) at SIGIR 2022
inferred← citeshttps://doi.org/10.1145/3626772.3657994openalex-snapshot
ReNeuIR at SIGIR 2024: The Third Workshop on Reaching Efficiency in Neural Information Retrieval
inferred← citeshttps://doi.org/10.1145/3694715.3695958openalex-snapshot
SilvanForge: A Schedule-Guided Retargetable Compiler for Decision Tree Inference
inferred← citeshttps://doi.org/10.1145/3698263.3698266openalex-snapshot
A Potential Study on the Application of Data Cartography Techniques to Tree-Based Models: A Methodological Approach
inferred← citeshttps://doi.org/10.1145/3704727openalex-snapshot
TreeHouse: An MLIR-based Compilation Flow for Real-Time Tree-based Inference
inferred← citeshttps://doi.org/10.1145/3726302.3730358openalex-snapshot
ReNeuIR at SIGIR 2025: The Fourth Workshop on Reaching Efficiency in Neural Information Retrieval
inferred← citeshttps://doi.org/10.2200/s00662ed1v01y201508icr045openalex-snapshot
Scalability Challenges in Web Search Engines
inferred← citeshttps://doi.org/10.3389/frai.2026.1801613openalex-snapshot
Efficient representation of boolean decision structures through Boolean function optimization
inferred← citeshttps://doi.org/10.3390/en12214132openalex-snapshot
Using True RMS Current Measurements to Estimate Harmonic Impacts of Multiple Nonlinear Loads in Electric Distribution Grids
inferred← citeshttps://doi.org/10.3390/gels11060464openalex-snapshot
Interpretable Machine Learning Analysis of Design Factors in Hydrogel Supercapacitors
inferred← citeshttps://doi.org/10.48550/arxiv.1704.03970openalex-snapshot
Efficient and Effective Tail Latency Minimization in Multi-Stage Retrieval Systems
inferred← citeshttps://doi.org/10.48550/arxiv.2007.14761openalex-snapshot
Learning Representations for Axis-Aligned Decision Forests through Input Perturbation
inferred← citeshttps://doi.org/10.48550/arxiv.2009.09991openalex-snapshot
Modeling Text with Decision Forests using Categorical-Set Splits
inferred← citeshttps://doi.org/10.48550/arxiv.2101.01292openalex-snapshot
GeCo: Quality Counterfactual Explanations in Real Time
inferred← citeshttps://doi.org/10.5121/csit.2016.60411openalex-snapshot
Associative Regressive Decision Rule Mining for Predicting Customer Satisfactory Patterns
inferred← citeshttps://doi.org/10.7936/k70863fbopenalex-snapshot
Approximation and Relaxation Approaches for Parallel and Distributed Machine Learning
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.