Max-Min Distance Analysis By Using Sequential SDP Relaxation For Dimension Reduction

IEEE Computer Soc
Publication Type:
Journal Article
IEEE Transactions On Pattern Analysis And Machine Intelligence, 2011, 33 (5), pp. 1037 - 1050
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2010004697OK.pdf2.02 MB
Adobe PDF
Abstract - We propose a new criterion for discriminative dimension reduction, max-min distance analysis (MMDA). Given a data set with C classes, represented by homoscedastic Gaussians, MMDA maximizes the minimum pairwise distance of these C classes in the selected low-dimensional subspace. Thus, unlike Fishers linear discriminant analysis (FLDA) and other popular discriminative dimension reduction criteria, MMDA duly considers the separation of all class pairs. To deal with general case of data distribution, we also extend MMDA to kernel MMDA (KMMDA). Dimension reduction via MMDA/KMMDA leads to a nonsmooth max-min optimization problem with orthonormal constraints. We develop a sequential convex relaxation algorithm to solve it approximately. To evaluate the effectiveness of the proposed criterion and the corresponding algorithm, we conduct classification and data visualization experiments on both synthetic data and real data sets. Experimental results demonstrate the effectiveness of MMDA/KMMDA associated with the proposed optimization algorithm.
Please use this identifier to cite or link to this item: