CLAss-Specific Subspace Kernel Representations and Adaptive Margin Slack Minimization for Large Scale Classification

In kernel-based classification models, given limited computational power and storage capacity, operations over the full kernel matrix becomes prohibitive. In this paper, we propose a new supervised learning framework using kernel models for sequential data processing. The framework is based on two c...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transaction on neural networks and learning systems Vol. 29; no. 2; pp. 440 - 456
Main Authors:	Yu, Yinan, Diamantaras, Konstantinos I., McKelvey, Tomas, Kung, Sun-Yuan
Format:	Journal Article
Language:	English
Published:	United States IEEE 01.02.2018 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Adaptation models Adaptive algorithms Adaptive data sampling adaptive margin Approximation algorithms between-class distance class-specific subspace Classification Computational modeling Computer applications Computer networks Data acquisition Data processing Distributed processing Hilbert space Kernel kernel approximation Kernels large scale Learning Minimization Optimization Parallel processing Representations Risk reduction sequential and parallel framework State of the art Storage capacity Subspaces support vector machine Test procedures Training Training data
ISSN:	2162-237X, 2162-2388, 2162-2388
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!