A computationally efficient scheme for feature extraction with kernel discriminant analysis

DOI10.1016/j.patcog.2015.08.021zbMath1394.68342OpenAlexW1797441772MaRDI QIDQ1669708

Hwang-Ki Min, Yuxi Hou, Iickho Song, Sang Woo Park

Publication date: 4 September 2018

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2015.08.021

zbMATH Keywords

computational complexitypattern recognitionregularizationkernel discriminant analysisLagrange method

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10)

Related Items

Individualized learning for improving kernel Fisher discriminant analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nearest neighbor classifier generalization through spatially constrained filters
• A new and fast implementation for null space based linear discriminant analysis
• Square rooting is as difficult as multiplication
• Best choices for regularization parameters in learning theory: on the bias-variance problem.
• Complete large margin linear discriminant analysis using mathematical programming approach
• Regularization networks and support vector machines
• A comparison of generalized linear discriminant analysis algorithms
• On the mathematical foundations of learning
• Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
• A direct LDA algorithm for high-dimensional data -- with application to face recognition