Naive Feature Selection: A Nearly Tight Convex Relaxation for Sparse Naive Bayes

DOI10.1287/MOOR.2023.1356MaRDI QIDQ6189906zbMATH OpenFDO

Authors Alexandre d'Aspremont, Laurent El Ghaoui

Publication date 5 March 2024

Published in Mathematics of Operations Research (Search for Journal in Brave)

zbMATH Keywords

nonconvex optimizationsparsityShapley-Folkman theoremLagrangian dualityFenchel duality

Mathematics Subject Classification ID

Convex programming (90C25) Statistical ranking and selection procedures (62F07)

Recommendations

• Variable selection for naïve Bayes classification
• scientific article; zbMATH DE number 5957308
• scientific article; zbMATH DE number 5957250
• scientific article; zbMATH DE number 5957476
• A method for avoiding bias from feature selection with application to naive Bayes classification models

This page was built for publication: Naive Feature Selection: A Nearly Tight Convex Relaxation for Sparse Naive Bayes

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