Convex approximation of the NP-hard search problem in feature subset selection

Tofigh Naghibi, Sarah Hoffmann, Beat Pfister. Convex approximation of the NP-hard search problem in feature subset selection. In IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2013, Vancouver, BC, Canada, May 26-31, 2013. pages 3273-3277, IEEE, 2013. [doi]

Abstract

Abstract is missing.