Nyström-based approximate kernel subspace learning. (September 2016)

• Record Type: Journal Article
• Authors: Iosifidis, Alexandros; Gabbouj, Moncef
• Is Part Of: Pattern recognition. Volume 57(2016:Sep.)
• Page Start: 190
• Page End: 197
• Publication Date: 2016-09
• Subjects: Nonlinear pattern recognition -- Kernel methods -- Nonlinear projection trick -- Nyström approximation; Pattern perception -- Periodicals; Perception des structures -- Périodiques; Patroonherkenning; 006.4
• DOI: 10.1016/j.patcog.2016.03.018
• Languages: English
• ISSNs: 0031-3203

Abstract

Abstract: In this paper, we describe a method for the determination of a subspace of the feature space in kernel methods, which is suited to large-scale learning problems. Linear model learning in the obtained space corresponds to a nonlinear model learning process in the input space. Since the obtained feature space is determined only by exploiting properties of the training data, this approach can be used for generic nonlinear pattern recognition. That is, nonlinear data mapping can be considered to be a pre-processing step exploiting nonlinear relationships between the training data. Linear techniques can be subsequently applied in the new feature space and, thus, they can model nonlinear properties of the problem at hand. In order to appropriately address the inherent problem of kernel learning methods related to their time and memory complexities, we follow an approximate learning approach. We show that the method can lead to considerable operation speed gains and achieve very good performance. Experimental results verify our analysis. Abstract : Highlights: We propose a method for determining a subspace of the kernel space. We follow an approximate kernel learning approach for fast calculations. We test our approach in nonlinear large-scale classification problems.