no code implementations • 21 Jan 2014 • Brendan P. W. Ames, Mingyi Hong
To accomplish this task, we propose a heuristic, called sparse zero-variance discriminant analysis (SZVD), for simultaneously performing linear discriminant analysis and feature selection on high dimensional data.
no code implementations • 16 Feb 2012 • Brendan P. W. Ames
As in our analysis of the densest k-disjoint-clique problem, we show that the correct partition of the objects and features can be recovered from the optimal solution of a semidefinite program in the case that the given data consists of several disjoint sets of objects exhibiting similar features.