{"title":"Fuzzy rough set attribute reduction based on decision ball model","authors":"Xia Ji , Wanyu Duan , Jianhua Peng , Sheng Yao","doi":"10.1016/j.ijar.2025.109364","DOIUrl":null,"url":null,"abstract":"<div><div>Attribute reduction is a crucial step in data preprocessing in the field of data mining. Accurate measurement of the classification ability of attribute sets stands a central issue in attribute reduction research. The existing fuzzy rough set attribute reduction algorithms measure the classification ability of attribute sets by evaluating the proximity between fuzzy similarity classes and decision classes. However, the granularity of the decision class is too large to reflect the data distribution within the decision class, which may lead to misclassification of samples, thus affecting the effectiveness of attribute reduction. To address this problem, we refine the decision class to propose the concept of decision ball, and study a new extended fuzzy rough set model based on decision ball. In this model, decision balls serve as the evaluation granularity, facilitating the fitting of data distributions and measuring the classification ability of attributes. Expanding on this foundation, we have designed a fuzzy rough set attribute reduction algorithm based on decision ball model (DBFRS). We conducted extensive comparative experiments involving 9 state-of-the-art attribute reduction algorithms on 18 public datasets. Experimental results demonstrate that DBFRS attains high classification accuracy. Moreover, DBFRS exhibits better reduction performance on large and high-dimensional datasets. Compared to current fuzzy rough set methods, DBFRS demonstrates better applicability.</div></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"179 ","pages":"Article 109364"},"PeriodicalIF":3.2000,"publicationDate":"2025-01-23","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/S0888613X25000052","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
Attribute reduction is a crucial step in data preprocessing in the field of data mining. Accurate measurement of the classification ability of attribute sets stands a central issue in attribute reduction research. The existing fuzzy rough set attribute reduction algorithms measure the classification ability of attribute sets by evaluating the proximity between fuzzy similarity classes and decision classes. However, the granularity of the decision class is too large to reflect the data distribution within the decision class, which may lead to misclassification of samples, thus affecting the effectiveness of attribute reduction. To address this problem, we refine the decision class to propose the concept of decision ball, and study a new extended fuzzy rough set model based on decision ball. In this model, decision balls serve as the evaluation granularity, facilitating the fitting of data distributions and measuring the classification ability of attributes. Expanding on this foundation, we have designed a fuzzy rough set attribute reduction algorithm based on decision ball model (DBFRS). We conducted extensive comparative experiments involving 9 state-of-the-art attribute reduction algorithms on 18 public datasets. Experimental results demonstrate that DBFRS attains high classification accuracy. Moreover, DBFRS exhibits better reduction performance on large and high-dimensional datasets. Compared to current fuzzy rough set methods, DBFRS demonstrates better applicability.
期刊介绍:
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.