Please use this identifier to cite or link to this item:
|Title:||A general exponential framework for dimensionality reduction||Authors:||Wang, S.-J.
|Issue Date:||Feb-2014||Citation:||Wang, S.-J., Yan, S., Yang, J., Zhou, C.-G., Fu, X. (2014-02). A general exponential framework for dimensionality reduction. IEEE Transactions on Image Processing 23 (2) : 920-930. ScholarBank@NUS Repository. https://doi.org/10.1109/TIP.2013.2297020||Abstract:||As a general framework, Laplacian embedding, based on a pairwise similarity matrix, infers low dimensional representations from high dimensional data. However, it generally suffers from three issues: 1) algorithmic performance is sensitive to the size of neighbors; 2) the algorithm encounters the well known small sample size (SSS) problem; and 3) the algorithm de-emphasizes small distance pairs. To address these issues, here we propose exponential embedding using matrix exponential and provide a general framework for dimensionality reduction. In the framework, the matrix exponential can be roughly interpreted by the random walk over the feature similarity matrix, and thus is more robust. The positive definite property of matrix exponential deals with the SSS problem. The behavior of the decay function of exponential embedding is more significant in emphasizing small distance pairs. Under this framework, we apply matrix exponential to extend many popular Laplacian embedding algorithms, e.g., locality preserving projections, unsupervised discriminant projections, and marginal fisher analysis. Experiments conducted on the synthesized data, UCI, and the Georgia Tech face database show that the proposed new framework can well address the issues mentioned above. © 1992-2012 IEEE.||Source Title:||IEEE Transactions on Image Processing||URI:||http://scholarbank.nus.edu.sg/handle/10635/81870||ISSN:||10577149||DOI:||10.1109/TIP.2013.2297020|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jul 23, 2019
WEB OF SCIENCETM
checked on Jul 16, 2019
checked on Jul 20, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.