RADE: resource-efficient supervised anomaly detection using decision tree-based ensemble methods

DOI10.1007/S10994-021-06047-XMaRDI QIDQ2071508zbMATH OpenOpenAlexFDO

Authors Shay Vargaftik, Isaac Keslassy, Ariel Orda, Yaniv Ben-Itzhak

Publication date 28 January 2022

Published in Machine Learning (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1909.11877

zbMATH Keywords

supervised learninganomaly detectiondecision-tree based ensemble methodsfast machine learningresource efficient machine learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites work

• scientific article; zbMATH DE number 1753143 (Why is no real title available?)
• scientific article; zbMATH DE number 6823187 (Why is no real title available?)
• An instance level analysis of data complexity
• Extremely randomized trees
• Greedy function approximation: A gradient boosting machine.
• Machine Learning: ECML 2004
• Random forests
• Scikit-learn: machine learning in Python
• Stacked regressions
• The boosting approach to machine learning: an overview

Cited in

(1)

• RADE

Describes a project that uses

Uses Software

• BranchyNet
• SMOTE
• JOUSBoost
• CatBoost
• LightGBM
• KDD Cup
• XGBoost
• Scikit
• randomForest
• UCI

This page was built for publication: RADE: resource-efficient supervised anomaly detection using decision tree-based ensemble methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2071508)