Incremental attribute reduction with α,β-level intuitionistic fuzzy sets

IF 3.2 3区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Pham Viet Anh , Nguyen Ngoc Thuy , Le Hoang Son , Tran Hung Cuong , Nguyen Long Giang
{"title":"Incremental attribute reduction with α,β-level intuitionistic fuzzy sets","authors":"Pham Viet Anh ,&nbsp;Nguyen Ngoc Thuy ,&nbsp;Le Hoang Son ,&nbsp;Tran Hung Cuong ,&nbsp;Nguyen Long Giang","doi":"10.1016/j.ijar.2024.109326","DOIUrl":null,"url":null,"abstract":"<div><div>The intuitionistic fuzzy set theory is recognized as an effective approach for attribute reduction in decision information systems containing numerical or continuous data, particularly in cases of noisy data. However, this approach involves complex computations due to the participation of both the membership and non-membership functions, making it less feasible for data tables with a large number of objects. Additionally, in some practical scenarios, dynamic data tables may change in the number of objects, such as the addition or removal of objects. To overcome these challenges, we propose a novel and efficient incremental attribute reduction method based on <span><math><mi>α</mi><mo>,</mo><mi>β</mi></math></span>-level intuitionistic fuzzy sets. Specifically, we first utilize the key properties of <span><math><mi>α</mi><mo>,</mo><mi>β</mi></math></span>-level intuitionistic fuzzy sets to construct a distance measure between two <span><math><mi>α</mi><mo>,</mo><mi>β</mi></math></span>-level intuitionistic fuzzy partitions. This extension of the intuitionistic fuzzy set model helps reduce noise in the data and shrink the computational space. Subsequently, we define a new reduct and design an efficient algorithm to identify an attribute subset in fixed decision tables. For dynamic decision tables, we develop two incremental calculation formulas based on the distance measure between two <span><math><mi>α</mi><mo>,</mo><mi>β</mi></math></span>-level intuitionistic fuzzy partitions to improve processing time. Accordingly, some important properties of the distance measures are also clarified. Finally, we design two incremental attribute reduction algorithms that handle the addition and removal of objects. Experimental results have demonstrated that our method is more effective than incremental methods based on fuzzy rough set and intuitionistic fuzzy set approaches in terms of execution time and classification accuracy from the obtained reduct.</div></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"176 ","pages":"Article 109326"},"PeriodicalIF":3.2000,"publicationDate":"2024-11-14","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/S0888613X24002135","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

The intuitionistic fuzzy set theory is recognized as an effective approach for attribute reduction in decision information systems containing numerical or continuous data, particularly in cases of noisy data. However, this approach involves complex computations due to the participation of both the membership and non-membership functions, making it less feasible for data tables with a large number of objects. Additionally, in some practical scenarios, dynamic data tables may change in the number of objects, such as the addition or removal of objects. To overcome these challenges, we propose a novel and efficient incremental attribute reduction method based on α,β-level intuitionistic fuzzy sets. Specifically, we first utilize the key properties of α,β-level intuitionistic fuzzy sets to construct a distance measure between two α,β-level intuitionistic fuzzy partitions. This extension of the intuitionistic fuzzy set model helps reduce noise in the data and shrink the computational space. Subsequently, we define a new reduct and design an efficient algorithm to identify an attribute subset in fixed decision tables. For dynamic decision tables, we develop two incremental calculation formulas based on the distance measure between two α,β-level intuitionistic fuzzy partitions to improve processing time. Accordingly, some important properties of the distance measures are also clarified. Finally, we design two incremental attribute reduction algorithms that handle the addition and removal of objects. Experimental results have demonstrated that our method is more effective than incremental methods based on fuzzy rough set and intuitionistic fuzzy set approaches in terms of execution time and classification accuracy from the obtained reduct.
用 α、β 级直观模糊集递减属性
在包含数值或连续数据的决策信息系统中,直觉模糊集理论被认为是一种有效的属性还原方法,尤其是在有噪声数据的情况下。然而,由于成员和非成员函数的参与,这种方法涉及复杂的计算,因此对于对象数量较多的数据表来说不太可行。此外,在某些实际场景中,动态数据表的对象数量可能会发生变化,例如对象的添加或删除。为了克服这些挑战,我们提出了一种基于 α、β 级直觉模糊集的新型高效增量属性缩减方法。具体来说,我们首先利用 α,β 级直觉模糊集的关键属性来构建两个 α,β 级直觉模糊分区之间的距离度量。对直观模糊集模型的这一扩展有助于减少数据中的噪声,缩小计算空间。随后,我们定义了一种新的还原法,并设计了一种高效算法来识别固定决策表中的属性子集。对于动态决策表,我们根据两个 α、β 级直觉模糊分区之间的距离度量开发了两个增量计算公式,以缩短处理时间。相应地,我们还阐明了距离度量的一些重要属性。最后,我们设计了两种增量属性缩减算法来处理对象的添加和删除。实验结果表明,与基于模糊粗糙集和直观模糊集方法的增量方法相比,我们的方法在执行时间和从获得的还原中分类的准确性方面更有效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
International Journal of Approximate Reasoning
International Journal of Approximate Reasoning 工程技术-计算机:人工智能
CiteScore
6.90
自引率
12.80%
发文量
170
审稿时长
67 days
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信