Local graph cut criterion for supervised dimensionality reduction
Lists
Only you see this
Abstract
Graph cut criterion has been proven to be robust and applicable in clustering problems. In this paper the graph cut criterion is applied to construct a supervised dimensionality reduction. A new graph cut, scaling cut, is proposed based on the classical normalized cut. Scaling cut depicts the relationship between samples, which makes it can handle the heteroscedastic and multimodel data in which LDA fails. Meanwhile, the solution to scaling cut is global optimal for it is a generalized eigenvalue problem. To obtain a more reasonable projection matrix and reduce the computational complexity as well, the localized k-nearest neighbor graph is introduced in, which leads to equivalent or better results compared with scaling cut.
BibTeX
@inproceedings{zhang2009local,
author = {Xiangrong Zhang and Sisi Zhou and Licheng Jiao},
title = {{Local graph cut criterion for supervised dimensionality reduction}},
booktitle = {Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE},
year = {2009},
doi = {10.1117/12.832411},
}Loading related content...