Regularized max-min linear discriminant analysis

被引:22
|
作者
Shao, Guowan [1 ]
Sang, Nong [2 ]
机构
[1] Hunan Univ Sci & Technol, Coll Mech & Elect Engn, Xiangtan 411201, Hunan, Peoples R China
[2] Huazhong Univ Sci & Technol, Sch Automat, Sci & Technol Multi Spectral Informat Proc Lab, Wuhan 430074, Peoples R China
关键词
Dimensionality reduction; Linear discriminant analysis; Max-min distance analysis; Shannon entropy; NONLINEAR DIMENSIONALITY REDUCTION; SAMPLE-SIZE PROBLEM; FEATURE-EXTRACTION; FRAMEWORK; LDA; EFFICIENT; SOLVE;
D O I
10.1016/j.patcog.2016.12.030
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Several dimensionality reduction methods based on the max-min idea have been proposed in recent years and can obtain good classification performance. In this paper, inspired by the idea, we develop max-min linear discriminant analysis (MMLDA), which maximizes the minimum ratio of each two-class scatter measure to the within-class scatter measure. However, the method ignores equal emphasis on the distances between class centers and there may be room to improve the classification performance. We then propose regularized max-min linear discriminant analysis (RMMLDA), which introduces the Shannon entropy and the corresponding distance difference regularization terms based on MMLDA. The changing trends of distances between class centers can be precisely controlled in optimization and the separation between classes can be emphasized approximately equally. As a result, RMMLDA may obtain better classification performance. Experiments on synthetic data sets and three publicly available data sets demonstrate its effectiveness.
引用
收藏
页码:353 / 363
页数:11
相关论文
共 50 条
  • [1] A branch and bound method solving the max-min linear discriminant analysis problem
    Beck, Amir
    Sharon, Raz
    [J]. OPTIMIZATION METHODS & SOFTWARE, 2023, 38 (05): : 1031 - 1057
  • [2] LINEAR MAX-MIN PROGRAMMING
    POSNER, ME
    WU, CT
    [J]. MATHEMATICAL PROGRAMMING, 1981, 20 (02) : 166 - 172
  • [3] LINEAR FRACTIONAL MAX-MIN PROBLEM
    COOK, WD
    KIRBY, MJL
    MEHNDIRATTA, SL
    [J]. OPERATIONS RESEARCH, 1975, 23 (03) : 511 - 521
  • [4] Local Approximability of Max-Min and Min-Max Linear Programs
    Floreen, Patrik
    Hassinen, Marja
    Kaasinen, Joel
    Kaski, Petteri
    Musto, Topi
    Suomela, Jukka
    [J]. THEORY OF COMPUTING SYSTEMS, 2011, 49 (04) : 672 - 697
  • [5] Local Approximability of Max-Min and Min-Max Linear Programs
    Patrik Floréen
    Marja Hassinen
    Joel Kaasinen
    Petteri Kaski
    Topi Musto
    Jukka Suomela
    [J]. Theory of Computing Systems, 2011, 49 : 672 - 697
  • [6] Linear optimization with bipolar max-min constraints
    Freson, S.
    De Baets, B.
    De Meyer, H.
    [J]. INFORMATION SCIENCES, 2013, 234 : 3 - 15
  • [7] LINEAR LEXICOGRAPHICALLY EXTENDED MAX-MIN OPTIMIZATION
    MACHT, G
    BEHRINGER, FA
    [J]. ZEITSCHRIFT FUR ANGEWANDTE MATHEMATIK UND MECHANIK, 1980, 60 (7BIS): : T353 - T355
  • [8] A Deterministic Algorithm for Min-max and Max-min Linear Fractional Programming Problems
    Qigao Feng
    Hongwei Jiao
    Hanping Mao
    Yongqiang Chen
    [J]. International Journal of Computational Intelligence Systems, 2011, 4 (2) : 134 - 141
  • [9] Heteroscedastic Max-min Distance Analysis
    Su, Bing
    Ding, Xiaoqing
    Liu, Changsong
    Wu, Ying
    [J]. 2015 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2015, : 4539 - 4547
  • [10] A Deterministic Algorithm for Min-max and Max-min Linear Fractional Programming Problems
    Feng, Qigao
    Jiao, Hongwei
    Mao, Hanping
    Chen, Yongqiang
    [J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS, 2011, 4 (02): : 134 - 141