A Robust Probability Classifier Based on the Modified χ2-Distance

被引:0
|
作者
Wang, Yongzhi [1 ]
Zhang, Yuli [2 ]
Yi, Jining [3 ]
Qu, Honggang [3 ,4 ]
Miu, Jinli [3 ,4 ]
机构
[1] Jilin Univ, Coll Instrumentat & Elect Engn, Changchun 130061, Peoples R China
[2] Tsinghua Univ, TNList, Dept Automat, Beijing 100084, Peoples R China
[3] China Geol Survey, Dev & Res Ctr, Beijing 100037, Peoples R China
[4] Minist Land & Resources, Key Lab Geol Informat Technol, Beijing 100037, Peoples R China
关键词
OPTIMIZATION;
D O I
10.1155/2014/621314
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
We propose a robust probability classifier model to address classification problems with data uncertainty. A class-conditional probability distributional set is constructed based on the modified chi(2)-distance. Based on a "linear combination assumption" for the posterior class-conditional probabilities, we consider a classification criterion using the weighted sum of the posterior probabilities. An optimal robust minimax classifier is defined as the one with the minimal worst-case absolute error loss function value over all possible distributions belonging to the constructed distributional set. Based on the conic duality theorem, we show that the resulted optimization problem can be reformulated into a second order cone programming problem which can be efficiently solved by interior algorithms. The robustness of the proposed model can avoid the "overlearning" phenomenon on training sets and thus keep a comparable accuracy on test sets. Numerical experiments validate the effectiveness of the proposed model and further show that it also provides promising results on multiple classification problems.
引用
收藏
页数:11
相关论文
共 50 条
  • [41] Wegner's Conjecture on 2-distance coloring for planar graphs
    Zhu, Junlei
    Bu, Yuehua
    Zhu, Hongguo
    THEORETICAL COMPUTER SCIENCE, 2022, 926 (71-74) : 71 - 74
  • [42] 2-distance (Δ+2)-coloring of planar graphs with girth six and Δ ≥ 18
    Borodin, O. V.
    Ivanova, A. O.
    DISCRETE MATHEMATICS, 2009, 309 (23-24) : 6496 - 6502
  • [43] THE ACQUISITION PROBABILITY FOR A MINIMUM DISTANCE ONE-CLASS CLASSIFIER
    FUKUNAGA, K
    HAYES, RR
    NOVAK, LM
    IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS, 1987, 23 (04) : 493 - 499
  • [44] 2-distance vertex-distinguishing total coloring of graphs
    Hu, Yafang
    Wang, Weifan
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2018, 10 (02)
  • [45] List 2-distance Coloring of Planar Graphs with Girth Five
    Jin, Yin-dong
    Miao, Lian-ying
    ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2022, 38 (03): : 540 - 548
  • [46] A modified image matching algorithm based on robust Hausdorff distance
    吴强
    Wu Xuefeng
    Li Xuwen
    Jia Kebin
    High Technology Letters, 2014, 20 (01) : 29 - 33
  • [47] A modified image matching algorithm based on robust Hausdorff distance
    Wu, Qiang
    Wu, Xuefeng
    Li, Xuwen
    Jia, Kebin
    High Technology Letters, 2014, 20 (01) : 29 - 33
  • [48] The list 2-distance coloring of a graph with Delta(G) = 5
    Bu, Yuehua
    Lv, Xia
    Yan, Xiaoyan
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2015, 7 (02)
  • [49] 2-Distance choosability of planar graphs with a restriction for maximum degree
    Yu, Jiahao
    Chen, Min
    Wang, Weifan
    APPLIED MATHEMATICS AND COMPUTATION, 2023, 448
  • [50] 2-distance coloring of planar graphs with maximum degree 5
    Chen, Ming
    Miao, Lianying
    Zhou, Shan
    DISCRETE MATHEMATICS, 2022, 345 (04)