Graph construction plays a vital role in improving the performance of graph-based dimension reduction (DR) algorithms. In this paper, we propose a novel graph construction method, and we name the graph constructed from such method as samples’ inner structure based graph (SISG). Instead of determining the -nearest neighbors of each sample by calculating the Euclidean distance between vectorized sample pairs, our new method employs the newly defined sample similarities to calculate the neighbors of each sample, and the newly defined sample similarities are based on the samples’ inner structure information. The SISG not only reveals the inner structure information of the original sample matrix, but also avoids predefining the parameter as used in the -nearest neighbor method. In order to demonstrate the effectiveness of SISG, we apply it to an unsupervised DR algorithm, locality preserving projection (LPP). Experimental results on several benchmark face databases verify the feasibility and effectiveness of SISG.
- dimensionality reduction
- graph construction
- graph embedding
- samples' inner structure
Li, B., Pang, W., Liu, Y., Yu, X., Du, A., & Yu, Z. (2014). Dimension Reduction Using Samples’ Inner Structure Based Graph for Face Recognition. Mathematical Problems in Engineering, 2014, . https://doi.org/10.1155/2014/603025