Title :
Cluster Preserving Embedding
Author :
Zhan, Yubin ; Yin, Jianping
Author_Institution :
Comput. Sch., Nat. Univ. of Defense Technol., Changsha, China
Abstract :
Most of existing dimensionality reduction methods obtain the low-dimensional embedding via preserving a certain property of the data, such as locality, neighborhood relationship. However, the intrinsic cluster structure of data, which plays a key role in analyzing and utilizing the data, has been ignored by the state-of-the-art dimensionality reduction methods. Hence, in this paper we propose a novel dimensionality reduction method called Cluster Preserving Embedding(CPE), in which the cluster structure of original data is preserved via preserving the robust path-based similarity between pairwise points. We present two different methods to preserve this similarity. One is the Multidimensional Scaling(MDS) way, which tries to preserve similarity matrix accurately, the other one is a Laplacian-style way, which preserves the topological partial order of the similarity rather than similarity itself. Encouraging experimental results on a toy data set and handwritten digits from MNIST database demonstrate the effectiveness of our Cluster Preserving Embedding method.
Keywords :
data structures; matrix algebra; pattern clustering; statistical analysis; Laplacian style; MNIST database; cluster preserving embedding; data structure; dimensionality reduction methods; handwritten digits; multidimensional scaling; similarity matrix; toy data set; Accuracy; Eigenvalues and eigenfunctions; Laplace equations; Manifolds; Principal component analysis; Robustness; Three dimensional displays; Clustering; Dimensional Reduction; Laplacian Eigenmap; Path-based similarity;
Conference_Titel :
Pattern Recognition (ICPR), 2010 20th International Conference on
Conference_Location :
Istanbul
Print_ISBN :
978-1-4244-7542-1
DOI :
10.1109/ICPR.2010.157