Sparse Multinomial Logistic Regression Algorithm Based on Centered Alignment Multiple Kernels Learning

被引:0
|
作者
Lei Dajiang [1 ]
Tang Jianyang [1 ]
Li Zhixing [1 ]
Wu Yu [2 ]
机构
[1] Chongqing Univ Posts & Telecommun, Coll Comp, Chongqing 400065, Peoples R China
[2] Chongqing Univ Posts & Telecommun, Inst Web Intelligence, Chongqing 400065, Peoples R China
关键词
Sparse optimization; Kernel trick; Multiple kernels learning; Sparse Multinomial Logistic Regression(SMLR); CLASSIFICATION;
D O I
10.11999/JEIT190426
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
As a generalized linear model, Sparse Multinomial Logistic Regression (SMLR) is widely used in various multi-class task scenarios. SMLR introduces Laplace priori into Multinomial Logistic Regression (MLR) to make its solution sparse, which allows the classifier to embed feature selection in the process of classification. In order to solve the problem of non-linear data classification, Kernel Sparse Multinomial Logistic Regression (KSMLR) is obtained by kernel trick. KSMLR can map nonlinear feature data into high-dimensional and even infinite-dimensional feature spaces through kernel functions, so that its features can be fully expressed and eventually classified effectively. In addition, the multi-kernel learning algorithm based on centered alignment is used to map the data in different dimensions through different kernel functions. Then center-aligned similarity can be used to select flexibly multi-kernel learning weight coefficients, so that the classifier has better generalization ability. The experimental results show that the sparse multinomial logistic regression algorithm based on center-aligned multi-kernel learning is superior to the conventional classification algorithm in classification accuracy.
引用
收藏
页码:2735 / 2741
页数:7
相关论文
共 28 条
  • [1] High-Dimensional Classification by Sparse Logistic Regression
    Abramovich, Felix
    Grinshtein, Vadim
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (05) : 3068 - 3079
  • [2] Learning Model-Based Sparsity via Projected Gradient Descent
    Bahmani, Sohail
    Boufounos, Petros T.
    Raj, Bhiksha
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2016, 62 (04) : 2092 - 2099
  • [3] A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
    Beck, Amir
    Teboulle, Marc
    [J]. SIAM JOURNAL ON IMAGING SCIENCES, 2009, 2 (01): : 183 - 202
  • [4] Extreme Sparse Multinomial Logistic Regression: A Fast and Robust Framework for Hyperspectral Image Classification
    Cao, Faxian
    Yang, Zhijing
    Ren, Jinchang
    Ling, Wing-Kuen
    Zhao, Huimin
    Marshall, Stephen
    [J]. REMOTE SENSING, 2017, 9 (12)
  • [5] High-Dimensional Sparse Factor Modeling: Applications in Gene Expression Genomics
    Carvalho, Carlos M.
    Chang, Jeffrey
    Lucas, Joseph E.
    Nevins, Joseph R.
    Wang, Quanli
    West, Mike
    [J]. JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 2008, 103 (484) : 1438 - 1456
  • [6] SMOOTHING PROXIMAL GRADIENT METHOD FOR GENERAL STRUCTURED SPARSE REGRESSION
    Chen, Xi
    Lin, Qihang
    Kim, Seyoung
    Carbonell, Jaime G.
    Xing, Eric P.
    [J]. ANNALS OF APPLIED STATISTICS, 2012, 6 (02): : 719 - 752
  • [7] Adaptive Kernel Principal Component Analysis (KPCA) for Monitoring Small Disturbances of Nonlinear Processes
    Cheng, Chun-Yuan
    Hsu, Chun-Chin
    Chen, Mu-Chen
    [J]. INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH, 2010, 49 (05) : 2254 - 2262
  • [8] Cortes C, 2012, J MACH LEARN RES, V13, P795
  • [9] Hyperspectral Image Classification via Multiple-Feature-Based Adaptive Sparse Representation
    Fang, Leyuan
    Wang, Cheng
    Li, Shutao
    Benediktsson, Jon Atli
    [J]. IEEE TRANSACTIONS ON INSTRUMENTATION AND MEASUREMENT, 2017, 66 (07) : 1646 - 1657
  • [10] An overview of ensemble methods for binary classifiers in multi-class problems: Experimental study on one-vs-one and one-vs-all schemes
    Galar, Mikel
    Fernandez, Alberto
    Barrenechea, Edurne
    Bustince, Humberto
    Herrera, Francisco
    [J]. PATTERN RECOGNITION, 2011, 44 (08) : 1761 - 1776