Multi-view ensemble feature selection via semidefinite programming

DOI10.1016/J.EJOR.2025.07.014MaRDI QIDQ6865581zbMATH OpenFDO

Authors Xiaojian Ding, Xin Wang, Pengcheng Shi

Publication date 2 February 2026

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJOR.2025.07.014

zbMATH Keywords

ensemble learningfeature selectionmulti-viewsemidefinite programming

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• Automatic robust convex programming
• From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems
• scientific article; zbMATH DE number 3126058 (Why is no real title available?)
• scientific article; zbMATH DE number 3624650 (Why is no real title available?)
• Interior-point algorithms for semidefinite programming based on a nonlinear formulation
• Learning the optimal kernel for Fisher discriminant analysis via second order cone programming
• On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods
• Semidefinite programming
• Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
• Some Network Flow Problems Solved with Pseudo-Boolean Programming
• The original Borda count and partial voting
• The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network

This page was built for publication: Multi-view ensemble feature selection via semidefinite programming

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