Kernel negative dragging linear regression for pattern classification

DOI10.1155/2017/2691474MaRDI QIDQ1693779zbMATH OpenOpenAlexFDO

Authors Yali Peng, Lu Zhang, Shigang Liu, Xili Wang, Min Guo

Publication date 31 January 2018

Published in Complexity (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2017/2691474

zbMATH Keywords

complex real-world applicationskernel negative \(\varepsilon\) dragging linear regressionlinear regressionpattern classification

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Linear regression; mixed models (62J05)

Review text

Summary: Linear Regression (LR) and its variants have been widely used for classification problems. However, they usually predefine a strict binary label matrix which has no freedom to fit the samples. In addition, they cannot deal with complex real-world applications such as the case of face recognition where samples may not be linearly separable owing to varying poses, expressions, and illumination conditions. Therefore, in this paper, we propose the Kernel Negative \(\varepsilon\) Dragging Linear Regression (KNDLR) method for robust classification on noised and nonlinear data. First, a technique called negative \(\varepsilon\) dragging is introduced for relaxing class labels and is integrated into the LR model for classification to properly treat the class margin of conventional linear regressions for obtaining robust result. Then, the data is implicitly mapped into a high dimensional kernel space by using the nonlinear mapping determined by a kernel function to make the data more linearly separable. Finally, our obtained KNDLR method is able to partially alleviate the problem of overfitting and can perform classification well for noised and deformable data. Experimental results show that the KNDLR classification algorithm obtains greater generalization performance and leads to better robust classification decision.

Recommendations

• Kernel discriminant analysis for regression problems
• Learning kernel logistic regression in the presence of class label noise
• Dual robust regression for pattern classification
• Extreme logistic regression
• Masking effects on linear regression in multi-class classification

Cites work

• Correlated Logistic Model With Elastic Net Regularization for Multilabel Image Classification
• Kernel nearest-neighbor algorithm
• Kernel Sparse Representation-Based Classifier
• Learning a Nonnegative Sparse Graph for Linear Regression
• Local Rademacher Complexity for Multi-Label Learning
• The Collinearity Problem in Linear Regression. The Partial Least Squares (PLS) Approach to Generalized Inverses

Cited in

(1)

• Dual robust regression for pattern classification

This page was built for publication: Kernel negative \(\varepsilon\) dragging linear regression for pattern classification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1693779)