Deterministic bridge regression for compressive classification
From MaRDI portal
Abstract: Pattern classification with compact representation is an important component in machine intelligence. In this work, an analytic bridge solution is proposed for compressive classification. The proposal has been based upon solving a penalized error formulation utilizing an approximated -norm. The solution comes in a primal form for over-determined systems and in a dual form for under-determined systems. While the primal form is suitable for problems of low dimension with large data samples, the dual form is suitable for problems of high dimension but with a small number of data samples. The solution has also been extended for problems with multiple classification outputs. Numerical studies based on simulated and real-world data validated the effectiveness of the proposed solution.
Cites work
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A Statistical View of Some Chemometrics Regression Tools
- Bayesian bridge-randomized penalized quantile regression
- Bridge regression: adaptivity and group selection
- Elastic net penalized quantile regression model
- One-step sparse estimates in nonconcave penalized likelihood models
- Pattern classification.
- Regularization and Variable Selection Via the Elastic Net
- Ridge Regression: Biased Estimation for Nonorthogonal Problems
- Selection of tuning parameters in bridge regression models via Bayesian information criterion
- Splicing learning: a novel few-shot learning approach
- Statistical comparisons of classifiers over multiple data sets
- Stretchy binary classification
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
This page was built for publication: Deterministic bridge regression for compressive classification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6052631)