关于“基于重叠函数的on (IO,O)-模糊粗糙集”的注解

IF 3.2 3区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Chun Yong Wang , Sheng Nan Xu , Lijuan Wan
{"title":"关于“基于重叠函数的on (IO,O)-模糊粗糙集”的注解","authors":"Chun Yong Wang ,&nbsp;Sheng Nan Xu ,&nbsp;Lijuan Wan","doi":"10.1016/j.ijar.2022.08.010","DOIUrl":null,"url":null,"abstract":"<div><p><span>Qiao investigated the properties and topological structures of </span><span><math><mo>(</mo><msub><mrow><mi>I</mi></mrow><mrow><mi>O</mi></mrow></msub><mo>,</mo><mi>O</mi><mo>)</mo></math></span><span>-fuzzy rough sets, which extended the classical conjunction operator in rough approximation operator to an overlap function </span><em>O</em>. However, there are some faults in the characterizations of <span><math><mo>(</mo><msub><mrow><mi>I</mi></mrow><mrow><mi>O</mi></mrow></msub><mo>,</mo><mi>O</mi><mo>)</mo></math></span>-fuzzy rough sets, such as wrong conclusions and strict condition, even if the overlap function <em>O</em><span> is assumed to be a continuous t-norm with no non-trivial zero divisors. This paper further discusses </span><span><math><mo>(</mo><msub><mrow><mi>I</mi></mrow><mrow><mi>O</mi></mrow></msub><mo>,</mo><mi>O</mi><mo>)</mo></math></span>-fuzzy rough sets and rectifies those faults. Moreover, some examples are presented to show those faults.</p></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"150 ","pages":"Pages 223-228"},"PeriodicalIF":3.2000,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Notes on “On (IO,O)-fuzzy rough sets based on overlap functions”\",\"authors\":\"Chun Yong Wang ,&nbsp;Sheng Nan Xu ,&nbsp;Lijuan Wan\",\"doi\":\"10.1016/j.ijar.2022.08.010\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p><span>Qiao investigated the properties and topological structures of </span><span><math><mo>(</mo><msub><mrow><mi>I</mi></mrow><mrow><mi>O</mi></mrow></msub><mo>,</mo><mi>O</mi><mo>)</mo></math></span><span>-fuzzy rough sets, which extended the classical conjunction operator in rough approximation operator to an overlap function </span><em>O</em>. However, there are some faults in the characterizations of <span><math><mo>(</mo><msub><mrow><mi>I</mi></mrow><mrow><mi>O</mi></mrow></msub><mo>,</mo><mi>O</mi><mo>)</mo></math></span>-fuzzy rough sets, such as wrong conclusions and strict condition, even if the overlap function <em>O</em><span> is assumed to be a continuous t-norm with no non-trivial zero divisors. This paper further discusses </span><span><math><mo>(</mo><msub><mrow><mi>I</mi></mrow><mrow><mi>O</mi></mrow></msub><mo>,</mo><mi>O</mi><mo>)</mo></math></span>-fuzzy rough sets and rectifies those faults. Moreover, some examples are presented to show those faults.</p></div>\",\"PeriodicalId\":13842,\"journal\":{\"name\":\"International Journal of Approximate Reasoning\",\"volume\":\"150 \",\"pages\":\"Pages 223-228\"},\"PeriodicalIF\":3.2000,\"publicationDate\":\"2022-11-01\",\"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/S0888613X22001220\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Approximate Reasoning","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0888613X22001220","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

Qiao研究了(IO,O)-模糊粗糙集的性质和拓扑结构,将粗糙逼近算子中的经典合算符推广到一个重叠函数O。然而,在(IO,O)-模糊粗糙集的刻画中,即使假设重叠函数O是一个没有非平凡零因子的连续t模,也存在一些错误的结论和严格的条件。本文进一步讨论了(IO,O)-模糊粗糙集,并对这些错误进行了修正。并举例说明了这些错误。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Notes on “On (IO,O)-fuzzy rough sets based on overlap functions”

Qiao investigated the properties and topological structures of (IO,O)-fuzzy rough sets, which extended the classical conjunction operator in rough approximation operator to an overlap function O. However, there are some faults in the characterizations of (IO,O)-fuzzy rough sets, such as wrong conclusions and strict condition, even if the overlap function O is assumed to be a continuous t-norm with no non-trivial zero divisors. This paper further discusses (IO,O)-fuzzy rough sets and rectifies those faults. Moreover, some examples are presented to show those faults.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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学术官方微信