scientific article; zbMATH DE number 5968873

MaRDI QIDQ3096110zbMATH OpenFDO

Authors Suhrid Balakrishnan, David Madigan

Publication date 8 November 2011

Full work available at URL http://www.jmlr.org/papers/v9/balakrishnan08a.html

zbMATH Keywords

expectation propagationLaplace approximationLASSO

Mathematics Subject Classification ID

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

Recommendations

• Learning sparse low-threshold linear classifiers
• Sparse classification: a scalable discrete optimization perspective
• Massive data discrimination via linear support vector machines
• Sparse partial least squares classification for high dimensional data
• On sparse linear discriminant analysis algorithm for high-dimensional data classification.
• Asymptotic Optimality of Sparse Linear Discriminant Analysis with Arbitrary Number of Classes
• Sparse quadratic classification rules via linear dimension reduction
• General sparse multi-class linear discriminant analysis
• Learning sparse classifiers: continuous and mixed integer optimization perspectives
• Efficient sparse least squares support vector machines for pattern classification

Cited in

(21)

• A sequential algorithm for sparse support vector classifiers
• An incremental least squares algorithm for large scale linear classification
• Learning sparse classifiers with difference of convex functions algorithms
• Learning when concepts abound
• Fast kernel classifiers with online and active learning
• LIBLINEAR: a library for large linear classification
• Classification using the ALH-fast algorithm
• The Group Lasso for Logistic Regression
• Sparse conjugate directions pursuit with application to fixed-size kernel models
• Temporally adaptive estimation of logistic classifiers on data streams
• Massive data discrimination via linear support vector machines
• A cluster tree based model selection approach for logistic regression classifier
• eSPA+: Scalable Entropy-Optimal Machine Learning Classification for Small Data Problems
• Scaling up sparse support vector machines by simultaneous feature and sample reduction
• Classification with probability density estimation on sparse grids
• Learning sparse low-threshold linear classifiers
• Model Checking in Large-Scale Dataset via Structure-Adaptive-Sampling
• Distributed smoothed rank regression with heterogeneous errors for massive data
• Filtering via approximate Bayesian computation
• Online cross-validation-based ensemble learning
• Gene selection and prediction for cancer classification using support vector machines with a reject option

Describes a project that uses

Uses Software

• RCV1

This page was built for publication:

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