返回
Nonlinear discriminant analysis based on vanishing component analysis
DOI:10.1016/j.neucom.2016.08.058.png)
摘要
En 中文
Most kernel-based nonlinear discriminant analysis methods need to compute the kernel distance between test samples and all of the training samples, but this approach consumes large volumes of time and memory, and it may be impractical when there is a large number of training samples. In this study, we propose a vanishing component analysis (VCA) based nonlinear discriminant analysis (VNDA) method. First, VNDA learns nonlinear mapping functions explicitly using the modified VCA method, before employing these functions to map the input feature onto a high-dimensional polynomial feature space, where the linear discriminant analysis (LDA) method is then applied. We prove that principal components analysis plus LDA is a special case of VNDA and that the set of mapping functions learned by VNDA is the best solution to the ratio trace problem in. the degree bounded polynomial feature space. Unlike kernel-based methods, VNDA only stores these mapping functions instead of all the training samples in the test step. Experimental results obtained based on four simulated data sets and 15 real data sets demonstrate that the proposed method yields highly competitive test recognition results compared to the state-of-the-art methods, while consuming less memory and time resources. (C) 2016 Elsevier B.V. All rights reserved.
Keyword:
Kernel discriminant analysis
Linear discriminant analysis
Vanishing component analysis
Support vector machine
Random forest
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
A fast kernel-based nonlinear discriminant analysis for multi-class problems
PATTERN RECOGNITION
IF7.6
Adaptive Impedance Control to Enhance Human Skill on a Haptic Interface System自适应阻抗控制以增强触觉接口系统上的人类技能
Evaluation of charge transfer resistance by geometrical extrapolation of the centre of semicircular impedance diagrams通过半圆阻抗图中心的几何外推法评估电荷转移电阻
An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting, and randomization
MACHINE LEARNING
IF2.9
A new and fast implementation for null space based linear discriminant analysis
PATTERN RECOGNITION
IF7.6

