Marginal semi-supervised sub-manifold projections with informative constraints for dimensionality reduction and recognition

被引:33
作者
Zhang, Zhao [1 ]
Zhao, Mingbo [1 ]
Chow, Tommy W. S. [1 ]
机构
[1] City Univ Hong Kong, Dept Elect Engn, Kowloon, Hong Kong, Peoples R China
关键词
Semi-supervised learning; Marginal projections; Dimensionality reduction; Informative constraints; Image recognition; EXTENSIONS;
D O I
10.1016/j.neunet.2012.09.010
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this work, sub-manifold projections based semi-supervised dimensionality reduction (DR) problem learning from partial constrained data is discussed. Two semi-supervised DR algorithms termed Marginal Semi-Supervised Sub-Manifold Projections ((MSMP)-M-3) and orthogonal (MSMP)-M-3 ((OMSMP)-M-3) are proposed. (MSMP)-M-3 in the singular case is also discussed. We also present the weighted least squares view of (MSMP)-M-3. Based on specifying the types of neighborhoods with pairwise constraints (PC) and the defined manifold scatters, our methods can preserve the local properties of all points and discriminant structures embedded in the localized PC. The sub-manifolds of different classes can also be separated. In PC guided methods, exploring and selecting the informative constraints is challenging and random constraint subsets significantly affect the performance of algorithms. This paper also introduces an effective technique to select the informative constraints for DR with consistent constraints. The analytic form of the projection axes can be obtained by eigen-decomposition. The connections between this work and other related work are also elaborated. The validity of the proposed constraint selection approach and DR algorithms are evaluated by benchmark problems. Extensive simulations show that our algorithms can deliver promising results over some widely used state-of-the-art semi-supervised DR techniques. (C) 2012 Elsevier Ltd. All rights reserved.
引用
收藏
页码:97 / 111
页数:15
相关论文
共 43 条
[1]  
[Anonymous], 2006, BOOK REV IEEE T NEUR
[2]  
[Anonymous], 1994, US GUID
[3]  
[Anonymous], P 1 IEEE WORKSH FAC
[4]  
[Anonymous], 2010, Data fitting and uncertainty: A practical introduction to weighted least squares and beyond
[5]  
[Anonymous], 2007, PROC IEEE INT C COMP
[6]  
[Anonymous], 2002, Learning with Kernels:Support Vector Machines, Regularization, Optimization, and Beyond
[7]   Non-linear metric learning using pairwise similarity and dissimilarity constraints and the geometrical structure of data [J].
Baghshah, Mahdieh Soleymani ;
Shouraki, Saeed Bagheri .
PATTERN RECOGNITION, 2010, 43 (08) :2982-2992
[8]  
Baghshah MS, 2009, 21ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-09), PROCEEDINGS, P1217
[9]   Laplacian eigenmaps for dimensionality reduction and data representation [J].
Belkin, M ;
Niyogi, P .
NEURAL COMPUTATION, 2003, 15 (06) :1373-1396
[10]   Semi-supervised learning based on high density region estimation [J].
Chen, Hong ;
Li, Luoqing ;
Peng, Jiangtao .
NEURAL NETWORKS, 2010, 23 (07) :812-818