Greedy function approximation: A gradient boosting machine.

Counts differ because each database indexes a different set of publications. We treat OpenAlex as the canonical count; Google Scholar is not shown (no API, and crawling it violates its ToS).

Function estimation/approximation is viewed from the perspective of numerical optimization in function space, rather than parameter space. A connection is made between stagewise additive expansions and steepest-descent minimization. A general gradient descent “boosting” paradigm is developed for additive expansions based on any fitting criterion.Specific algorithms are presented for least-squares, least absolute deviation, and Huber-M loss functions for regression, and multiclass logistic likelihood for classification. Special enhancements are derived for the particular case where the individual additive components are regression trees, and tools for interpreting such “TreeBoost” models are presented. Gradient boosting of regression trees produces competitive, highly robust, interpretable procedures for both regression and classification, especially appropriate for mining less than clean data. Connections between this approach and the boosting methods of Freund and Shapire and Friedman, Hastie and Tibshirani are discussed.

Last synced 2026-07-20 07:59 UTC

• Uncovering multidimensional drivers of thermal perception: Explainable learning with SHAP and tree-based models

  Case Studies in Thermal Engineering 2026 · 0 citations

• Data-centric AI in disaster management: Scalable Named Entity Recognition via LLM-based stacking and pseudo-label generation

  Information Processing & Management 2026 · 0 citations

• Evaluation of machine-learned band gaps: Two-stage modeling and the effects of data representation and split strategy

  Computational Materials Science 2026 · 0 citations

• Personalized video recommendation with attentive multi-view learning and long-term and short-term interest modeling

  Management System Engineering 2026 · 0 citations

• Interpretable Machine Learning for Tokenomic Collapse Risk: Evidence from 155 Real-World Tokens and a Small Prospective Holdout

  Journal of risk and financial management 2026 · 0 citations

• A Rank-Based Bernstein Additive Logistic Model with Spearman-Informed Regularisation for Interpretable Binary Classification

  Mathematics 2026 · 0 citations

• Integrating Explainable AI with Advanced Data Visualization: Enhancing Transparency and Decision-Making in Complex Systems

  International Journal of Scientific Research in Computer Science Engineering and Information Technology 2026 · 0 citations

• A systematic mapping review of explainable machine and deep learning approaches for road traffic crash severity prediction: A decade-long review (2014-2024)

  Heliyon 2026 · 0 citations

• Detectable, Task-Relevant, or Harmful? Construct-Valid Evaluation of Unlabeled Distribution-Shift Monitoring in Chest Radiography

  Journal of Imaging 2026 · 0 citations

• Explainable Generative AI for Personalized E-Commerce Decision Support: Integrating Customer Behaviour, Trust and Purchase Prediction

  British Journal of Contemporary Research 2026 · 0 citations

• Equally accurate, differently explained: Stability of permutation feature importance across machine learning classifiers on clinical tabular data

  Journal of Artificial Intelligence Machine Learning and Neural Network 2026 · 0 citations

• Adaptive Multimodal Retrieval-augmented Generation with Context-aware Hallucination Detection for Reliable Knowledge Systems

  IJSIT 2026 · 0 citations

• Explainable Artificial Intelligence in Credit Risk: A Systematic Evidence Map for Regulated Credit Decisions

  International Journal of Financial Studies 2026 · 0 citations

• A self-monitoring explainable AI decision-support architecture for pre-publication content decisions in public-sector communication

  Knowledge-Based Systems 2026 · 0 citations