Sequential Projection Pursuit with Kernel Matrix Update and Symbolic Model Selection

Rodriguez-Martinez, E, Mu, T and Goulermas, JY (2014) Sequential Projection Pursuit with Kernel Matrix Update and Symbolic Model Selection. IEEE TRANSACTIONS ON CYBERNETICS, 44 (12). pp. 2458-2469.

Text final_manuscript_version.pdf - Author Accepted Manuscript Download (1MB)

Abstract

This paper proposes a novel way for generating reliable low-dimensional features with improved class separability in a kernel-induced feature space. The feature projections rely on a very efficient sequential projection pursuit method, adapted to support nonlinear projections using a new kernel matrix update scheme. This enables the gradual removal of structure from the space of residual dimensions to allow the recovery of multiple projections. An adaptive kernel function is employed to unfold different types of data characteristics. We follow a holistic model selection procedure that, together with the optimal projections, dimensionality, and kernel parameters, additionally optimizes symbolically the projection index that controls the actual measurement of the data interestingness without user interaction. We tackle the underlying complex bi-level optimization model as a mixture of evolutionary and gradient search. The effectiveness of the proposed algorithm over existing approaches is demonstrated with benchmark evaluations and comparisons.

Item Type:	Article
Uncontrolled Keywords:	Evolutionary optimization, kernel matrix update, projection pursuit, supervised dimensionality reduction
Depositing User:	Symplectic Admin
Date Deposited:	24 Oct 2016 08:25
Last Modified:	19 Jan 2023 07:27
DOI:	10.1109/TCYB.2014.2308908
Related URLs:	Author Publisher
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3003942