Random intersection trees

MaRDI QIDQ2934004zbMATH OpenFDO

Authors Rajen D. Shah, Nicolai Meinshausen

Publication date 8 December 2014

Full work available at URL https://arxiv.org/abs/1303.6223, http://jmlr.csail.mit.edu/papers/v15/shah14a.html

zbMATH Keywords

classificationinteractionssparse dataMIN-wise hashing

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• The xyz algorithm for fast interaction search in high-dimensional data
• Random forests
• scientific article; zbMATH DE number 6670732
• Variable importance in binary regression trees and forests
• Analysis of a random forests model

Cited in

(7)

• Discovering interactions using covariate informed random partition models
• Modeling threshold interaction effects through the logistic classification trunk
• The xyz algorithm for fast interaction search in high-dimensional data
• Global multi-output decision trees for interaction prediction
• Iterated joining of rooted trees
• Iterative random forests to discover predictive and stable high-order interactions
• Interaction forests: identifying and exploiting interpretable quantitative and qualitative interaction effects

Describes a project that uses

Uses Software

• FSInteract

This page was built for publication: Random intersection trees

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