L1-based compression of random forest models

No abstract is available for this paper.

• Publication year

  2012

• Venue

  The European Symposium on Artificial Neural Networks

• Publication date

  2012-05-24

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• An Analysis of Ensemble Pruning Techniques Based on Ordered Aggregation

  2009cited by this paper
• Forest Garrote

  2009cited by this paper
• On the selection of decision trees in Random Forests

  2009cited by this paper
• An Introduction To Compressive Sampling

  2008cited by this paper
• PREDICTIVE LEARNING VIA RULE ENSEMBLES

  2008cited by this paper
• Forward stagewise regression and the monotone lasso

  2007cited by this paper
• Extremely randomized trees

  2006cited by this paper
• Random Forests

  2001cited by this paper
• Some Enhencements of Decision Tree Bagging

  2000cited by this paper
• Regression Shrinkage and Selection via the Lasso

  1996cited by this paper
• Bias, Variance , And Arcing Classifiers

  1996cited by this paper

• Adaptive Model Compression for Lightweight Paper AI

  2025cites this paper
• Re-interpreting rules interpretability

  2023cites this paper
• On the Robustness of Random Forest Against Untargeted Data Poisoning: An Ensemble-Based Approach

  2022cites this paper
• ForestPrune: Compact Depth-Controlled Tree Ensembles

  2022cites this paper
• Explainable models via compression of tree ensembles

  2022cites this paper
• A comprehensive survey on model compression and acceleration

  2020cites this paper
• Deep network compression with teacher latent subspace learning and LASSO

  2020cites this paper
• Decision Tree SVM: An extension of linear SVM for non-linear classification

  2020cites this paper
• Fitting prediction rule ensembles to psychological research data: An introduction and tutorial.

  2019cites this paper
• Lossless Compression of Random Forests

  2019cites this paper
• Prediction with a flexible finite mixture-of-regressions

  2018cites this paper
• Teacher-Student Compression with Generative Adversarial Networks

  2018influential citation
• Lossless (and Lossy) Compression of Random Forests

  2018cites this paper
• Ilmari Ahonen: Statistical methods for the analysis of high-content organotypic cancer cell culture imaging data

  2018cites this paper
• Model Compression with Generative Adversarial Networks

  2018cites this paper
• Fitting Prediction Rule Ensembles with R Package pre

  2017cites this paper
• Function space analysis of deep learning representation layers

  2017cites this paper
• Relevant Ensemble of Trees

  2017influential citation
• Exploiting random projections and sparsity with random forests and gradient boosting methods - Application to multi-label and multi-output learning, random forest model compression and leveraging input sparsity

  2017influential citation
• Globally Induced Forest: A Prepruning Compression Scheme

  2017cites this paper
• Reducing Wait Time Prediction In Hospital Emergency Room: Lean Analysis Using a Random Forest Model

  2017cites this paper
• Resource-efficient Machine Learning in 2 KB RAM for the Internet of Things

  2017cites this paper
• pre: An R Package for Fitting Prediction Rule Ensembles

  2017cites this paper
• Generating Compact Tree Ensembles via Annealing

  2017influential citation
• Joint learning and pruning of decision forests

  2016cites this paper
• Wavelet decompositions of Random Forests - smoothness analysis, sparse approximation and applications

  2016cites this paper
• Compressing Random Forests

  2016cites this paper
• Non-uniform feature sampling for decision tree ensembles

  2014cites this paper
• Wavelet decompositions of Random Forests

  year unknowncites this paper