Beyond trees: classification with sparse pairwise dependencies

MaRDI QIDQ5148983zbMATH OpenFDO

Authors Yaniv Tenzer, Amit Moscovich, Mary Frances Dorn, Boaz Nadler, Clifford Spiegelman

Publication date 5 February 2021

Full work available at URL https://arxiv.org/abs/1806.01993, https://jmlr.csail.mit.edu/papers/v21/18-348.html

zbMATH Keywords

Bayesian networkbinary classificationgraphical modelsemi-parametricsparsity

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Learning with mixtures of trees.
• Margin trees for high-dimensional classification
• Network-based sparse Bayesian classification
• Classification by pairwise coupling
• A probabilistic classification method based on conditional independences

Cites work

• Algorithmic Learning Theory
• Approximating discrete probability distributions with dependence trees
• Bayesian network classifiers
• Combined SVM-based feature selection and classification
• Forest density estimation
• Graphical models via univariate exponential family distributions
• scientific article; zbMATH DE number 1134987 (Why is no real title available?)
• scientific article; zbMATH DE number 3436645 (Why is no real title available?)
• scientific article; zbMATH DE number 6253918 (Why is no real title available?)
• Introduction to nonparametric estimation
• Kernel methods for measuring independence
• Learning Graphical Models for Hypothesis Testing and Classification
• On the difficulty of approximately maximizing agreements.
• Probabilistic graphical models.
• Simultaneous inference for pairwise graphical models with generalized score matching
• Sparse nonparametric graphical models
• Tikhonov, Ivanov and Morozov regularization for support vector machine learning
• Understanding machine learning. From theory to algorithms

Cited in

(3)

• Bonsai: diverse and shallow trees for extreme multi-label classification
• New method for solving Ivanov regularization-based support vector machine learning
• On multivariate randomized classification trees: \(l_0\)-based sparsity, VC dimension and decomposition methods

Describes a project that uses

Uses Software

• UCI

This page was built for publication: Beyond trees: classification with sparse pairwise dependencies

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