Hypersphere distribution discriminant analysis

Current graph embedding frameworks of supervised dimensionality reduction often preserve the intraclass local structures and maximize the interclass variance. However, this strategy fails to provide adequate results when strict within-class multimodalities contradict between-class separations. In this paper, we propose Hypersphere Distribution Discriminant Analysis (HDDA), which determines the affinity by considering not only within-class local structure but also the heteropoint distribution in the neighborhood space. If the heteropoint distribution is relatively high in the feature space, this pair should be mapped apart to avoid mixing problems. By taking both the distribution of heteropoints and the distance into account, HDDA shows more effective results compared to the state-of-the-art methods.

[1]  Hwann-Tzong Chen,et al.  Local discriminant embedding and its variants , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[2]  Xiaofei He,et al.  Locality Preserving Projections , 2003, NIPS.

[3]  Masashi Sugiyama,et al.  Dimensionality Reduction of Multimodal Labeled Data by Local Fisher Discriminant Analysis , 2007, J. Mach. Learn. Res..

[4]  Pavel Pudil,et al.  Introduction to Statistical Pattern Recognition , 2006 .

[5]  Gunnar Rätsch,et al.  Soft Margins for AdaBoost , 2001, Machine Learning.

[6]  Stephen Lin,et al.  Graph Embedding and Extensions: A General Framework for Dimensionality Reduction , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  U. Feige,et al.  Spectral Graph Theory , 2015 .