Chance-Constrained Abnormal Data Cleaning for Robust Classification With Noisy Labels

被引:1
|
作者
Shen, Xun [1 ]
Luo, Zhaojie [2 ]
Li, Yuanchao [3 ]
Ouyang, Tinghui [4 ]
Wu, Yuhu [5 ]
机构
[1] Osaka Univ, Grad Sch Engn, Osaka 5650871, Japan
[2] Southeast Univ, Sch Biol Sci & Med Engn, Nanjing 210096, Peoples R China
[3] Univ Edinburgh, Inst Language Cognit & Computat, Edinburgh EH8 9YL, Scotland
[4] Natl Inst Adv Ind Sci & Technol, Tokyo 1350064, Japan
[5] Dalian Univ Technol, Sch Control Sci & Engn, Dalian 116024, Peoples R China
来源
IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTATIONAL INTELLIGENCE | 2024年
关键词
Classification with noisy labels; chance constrained optimization; APPROXIMATION; OPTIMIZATION;
D O I
10.1109/TETCI.2024.3375518
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Supervised classification is a common field of machine learning. However, the existing classification methods based on deep models are vulnerable to overfitting the noisy labels in the training set. This paper proposes a data-cleaning method to achieve robust classification against noisy labels. A chance-constrained abnormal data cleaning approach is proposed based on chance-constrained optimization, in which a polynomial sublevel set for the data of each class is generated. The data outside the polynomial sublevel set is abnormal and has a low probability of belonging to the labeled class. The classification method only uses normal data to establish the estimated classifiers. We show the convergence of the proposed abnormal data-cleaning approach. Furthermore, we give the algorithm for classification with abnormal data cleaning. Experimental data-based validations have been implemented to validate the proposed classification algorithm. The results show that the proposed approach can correctly clean the abnormal noisy labels and improve the performance of Supervised classification methods.
引用
收藏
页码:1 / 8
页数:8
相关论文
共 50 条
  • [31] Robust optimization approach for a chance-constrained binary knapsack problem
    Jinil Han
    Kyungsik Lee
    Chungmok Lee
    Ki-Seok Choi
    Sungsoo Park
    Mathematical Programming, 2016, 157 : 277 - 296
  • [32] Robust optimization approach for a chance-constrained binary knapsack problem
    Han, Jinil
    Lee, Kyungsik
    Lee, Chungmok
    Choi, Ki-Seok
    Park, Sungsoo
    MATHEMATICAL PROGRAMMING, 2016, 157 (01) : 277 - 296
  • [33] Chance-Constrained Sequential Convex Programming for Robust Trajectory Optimization
    Lew, Thomas
    Bonalli, Riccardo
    Pavone, Marco
    2020 EUROPEAN CONTROL CONFERENCE (ECC 2020), 2020, : 1871 - 1878
  • [34] Using Uncertainty Data in Chance-Constrained Trajectory Planning
    Lefkopoulos, Vasileios
    Kamgarpour, Maryam
    2019 18TH EUROPEAN CONTROL CONFERENCE (ECC), 2019, : 2264 - 2269
  • [35] Data-Driven Distributionally Robust Chance-Constrained Unit Commitment With Uncertain Wind Power
    Shi, Zhichao
    Liang, Hao
    Dinavahi, Venkata
    IEEE ACCESS, 2019, 7 : 135087 - 135098
  • [36] Frequency Constrained Scheduling Under Multiple Uncertainties via Data-Driven Distributionally Robust Chance-Constrained Approach
    Yang, Lun
    Li, Zhihao
    Xu, Yinliang
    Zhou, Jianguo
    Sun, Hongbin
    IEEE TRANSACTIONS ON SUSTAINABLE ENERGY, 2023, 14 (02) : 763 - 776
  • [37] Robust Semisupervised Classification for PolSAR Image With Noisy Labels
    Hou, Biao
    Wu, Qian
    Wen, Zaidao
    Jiao, Licheng
    IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING, 2017, 55 (11): : 6440 - 6455
  • [38] Robust optimal classification trees under noisy labels
    Victor Blanco
    Alberto Japón
    Justo Puerto
    Advances in Data Analysis and Classification, 2022, 16 : 155 - 179
  • [39] Robust optimal classification trees under noisy labels
    Blanco, Victor
    Japon, Alberto
    Puerto, Justo
    ADVANCES IN DATA ANALYSIS AND CLASSIFICATION, 2022, 16 (01) : 155 - 179
  • [40] Robust Chance-Constrained Geometric Programming with Application to Demand Risk Mitigation
    Fontem, Belleh
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2023, 197 (02) : 765 - 797