{"title":"A novel covering rough set model based on granular-ball computing for data with label noise","authors":"Xiaoli Peng , Yuanlin Gong , Xiang Hou , Zhan Tang , Yabin Shao","doi":"10.1016/j.ijar.2025.109420","DOIUrl":null,"url":null,"abstract":"<div><div>As a novel granular computing model, granular-ball computing (GBC) has a notable advantage of robustness. Inspired by GBC, a granular-ball covering rough set (GBCRS) model whose covering is made up of granular-balls (GBs) is proposed. GBCRS is the first covering rough set that fits the data distribution well. Inheriting the robustness of GBC, GBCRS can work in label noise environments. First, the optimization objective function of GBs in GBCRS is given. In order to ensure the quality of generated GBs, this function is subject to three constraints. Second, the GBCRS model is proposed. The purity threshold is used to relax the related notions so that GBCRS can be used in label noise environments. Subsequently, GBCRS is applied to the covering granular reduction and attribute reduction in label noise environments. In covering granular reduction, we propose an intuitive, understandable and anti-noise GBCRS-based granular reduction (GBCRS-GR) algorithm, which also solves the optimization objective function of GBs. Based on GBCRS-GR, a GBCRS-based attribute reduction (GBCRS-AR) algorithm is proposed with the classification ability of the attribute subset as the evaluation. The experiments on UCI datasets illustrate that proposed algorithm is more robust against label noise than the comparison ones.</div></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"182 ","pages":"Article 109420"},"PeriodicalIF":3.2000,"publicationDate":"2025-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Approximate Reasoning","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0888613X25000611","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
As a novel granular computing model, granular-ball computing (GBC) has a notable advantage of robustness. Inspired by GBC, a granular-ball covering rough set (GBCRS) model whose covering is made up of granular-balls (GBs) is proposed. GBCRS is the first covering rough set that fits the data distribution well. Inheriting the robustness of GBC, GBCRS can work in label noise environments. First, the optimization objective function of GBs in GBCRS is given. In order to ensure the quality of generated GBs, this function is subject to three constraints. Second, the GBCRS model is proposed. The purity threshold is used to relax the related notions so that GBCRS can be used in label noise environments. Subsequently, GBCRS is applied to the covering granular reduction and attribute reduction in label noise environments. In covering granular reduction, we propose an intuitive, understandable and anti-noise GBCRS-based granular reduction (GBCRS-GR) algorithm, which also solves the optimization objective function of GBs. Based on GBCRS-GR, a GBCRS-based attribute reduction (GBCRS-AR) algorithm is proposed with the classification ability of the attribute subset as the evaluation. The experiments on UCI datasets illustrate that proposed algorithm is more robust against label noise than the comparison ones.
期刊介绍:
The International Journal of Approximate Reasoning is intended to serve as a forum for the treatment of imprecision and uncertainty in Artificial and Computational Intelligence, covering both the foundations of uncertainty theories, and the design of intelligent systems for scientific and engineering applications. It publishes high-quality research papers describing theoretical developments or innovative applications, as well as review articles on topics of general interest.
Relevant topics include, but are not limited to, probabilistic reasoning and Bayesian networks, imprecise probabilities, random sets, belief functions (Dempster-Shafer theory), possibility theory, fuzzy sets, rough sets, decision theory, non-additive measures and integrals, qualitative reasoning about uncertainty, comparative probability orderings, game-theoretic probability, default reasoning, nonstandard logics, argumentation systems, inconsistency tolerant reasoning, elicitation techniques, philosophical foundations and psychological models of uncertain reasoning.
Domains of application for uncertain reasoning systems include risk analysis and assessment, information retrieval and database design, information fusion, machine learning, data and web mining, computer vision, image and signal processing, intelligent data analysis, statistics, multi-agent systems, etc.