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]

@inproceedings{NaghibiHP13,
  title = {Convex approximation of the NP-hard search problem in feature subset selection},
  author = {Tofigh Naghibi and Sarah Hoffmann and Beat Pfister},
  year = {2013},
  doi = {10.1109/ICASSP.2013.6638263},
  url = {http://dx.doi.org/10.1109/ICASSP.2013.6638263},
  researchr = {https://researchr.org/publication/NaghibiHP13},
  cites = {0},
  citedby = {0},
  pages = {3273-3277},
  booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2013, Vancouver, BC, Canada, May 26-31, 2013},
  publisher = {IEEE},
}