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 条
  • [21] Data-driven Distributionally Adjustable Robust Chance-constrained DG Capacity Assessment
    Mahmoodi, Masoume
    Abadi, Seyyed Mahdi Noori Rahim
    Attarha, Ahmad
    Scott, Paul
    Blackhall, Lachlan
    JOURNAL OF MODERN POWER SYSTEMS AND CLEAN ENERGY, 2024, 12 (01) : 115 - 127
  • [22] Distributionally robust joint chance-constrained support vector machines
    Khanjani-Shiraz, Rashed
    Babapour-Azar, Ali
    Hosseini-Nodeh, Zohreh
    Pardalos, Panos M.
    OPTIMIZATION LETTERS, 2023, 17 (02) : 299 - 332
  • [23] Wasserstein distributionally robust chance-constrained program with moment information
    Luo, Zunhao
    Yin, Yunqiang
    Wang, Dujuan
    Cheng, T. C. E.
    Wu, Chin -Chia
    COMPUTERS & OPERATIONS RESEARCH, 2023, 152
  • [24] Distributionally robust joint chance-constrained support vector machines
    Rashed Khanjani-Shiraz
    Ali Babapour-Azar
    Zohreh Hosseini-Nodeh
    Panos M. Pardalos
    Optimization Letters, 2023, 17 : 299 - 332
  • [25] Distributionally robust chance-constrained optimization with Sinkhorn ambiguity set
    Yang, Shu-Bo
    Li, Zukui
    AICHE JOURNAL, 2023, 69 (10)
  • [26] Distributionally robust joint chance-constrained programming with Wasserstein metric
    不详
    OPTIMIZATION METHODS & SOFTWARE, 2024, 40 (01): : 134 - 168
  • [27] Distributionally Robust Chance-Constrained Optimization for Communication and Offloading in WBANs
    Ling, Zhuang
    Hu, Fengye
    Zhang, Yu
    Gao, Feifei
    Han, Zhu
    2020 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2020,
  • [28] Robust and Chance-Constrained Dispatch Policies for Linear Power Systems
    Stenglein, Hans
    Faulwasser, Timm
    Steinke, Florian
    IFAC PAPERSONLINE, 2024, 58 (13): : 80 - 85
  • [29] Robust Chance-Constrained Distributed Beamforming for Multicell Interference Networks
    Zhang, Xinruo
    Nakhai, Mohammad Reza
    2016 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2016,
  • [30] Distributionally Robust Chance-Constrained Energy Management for Islanded Microgrids
    Shi, Zhichao
    Liang, Hao
    Huang, Shengjun
    Dinavahi, Venkata
    IEEE TRANSACTIONS ON SMART GRID, 2019, 10 (02) : 2234 - 2244