基于单调变精度多尺度粗糙集模型的最优尺度组合选择

IF 3 3区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Ruili Guo , Qinghua Zhang , Yunlong Cheng , Ying Yang , Hang Zhong
{"title":"基于单调变精度多尺度粗糙集模型的最优尺度组合选择","authors":"Ruili Guo ,&nbsp;Qinghua Zhang ,&nbsp;Yunlong Cheng ,&nbsp;Ying Yang ,&nbsp;Hang Zhong","doi":"10.1016/j.ijar.2025.109569","DOIUrl":null,"url":null,"abstract":"<div><div>Most existing generalized multi-scale rough set models (GMRSMs) are based on Pawlak's rough set, which lacks fault tolerance and thus limits their generalization ability. To improve generalization, the variable precision generalized multi-scale rough set model (VPGMRSM) was proposed. However, this model disrupts the monotonicity of the positive region, posing challenges for optimal scale combination (OSC) selection. To address these issues, a monotonic VPGMRSM is proposed in this paper through a two-stage approximation process. The proposed model preserves the monotonicity of the GMRSM and the fault tolerance of the VPGMRSM, and is further applied to OSC selection. First, the non-monotonicity of the positive region in the original VPGMRSM is analyzed. Then, a monotonic VPGMRSM is proposed, whose information measurements are proven to satisfy the monotonicity lacking in the original model. Second, an extended definition of OSC is proposed based on the positive region in the new model, which significantly simplifies and improves the efficiency of the OSC selection process. Third, two OSC selection algorithms are proposed: one based on binary search to find a single OSC, and the other based on three-way decision theory to identify all OSCs. Finally, the experimental results validate the monotonicity of the positive region in the new model and demonstrate that the proposed algorithms are not only suitable for VPGMRSMs, but also effectively reduce the computation time.</div></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"187 ","pages":"Article 109569"},"PeriodicalIF":3.0000,"publicationDate":"2025-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimal scale combination selection based on a monotonic variable precision multi-scale rough set model\",\"authors\":\"Ruili Guo ,&nbsp;Qinghua Zhang ,&nbsp;Yunlong Cheng ,&nbsp;Ying Yang ,&nbsp;Hang Zhong\",\"doi\":\"10.1016/j.ijar.2025.109569\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Most existing generalized multi-scale rough set models (GMRSMs) are based on Pawlak's rough set, which lacks fault tolerance and thus limits their generalization ability. To improve generalization, the variable precision generalized multi-scale rough set model (VPGMRSM) was proposed. However, this model disrupts the monotonicity of the positive region, posing challenges for optimal scale combination (OSC) selection. To address these issues, a monotonic VPGMRSM is proposed in this paper through a two-stage approximation process. The proposed model preserves the monotonicity of the GMRSM and the fault tolerance of the VPGMRSM, and is further applied to OSC selection. First, the non-monotonicity of the positive region in the original VPGMRSM is analyzed. Then, a monotonic VPGMRSM is proposed, whose information measurements are proven to satisfy the monotonicity lacking in the original model. Second, an extended definition of OSC is proposed based on the positive region in the new model, which significantly simplifies and improves the efficiency of the OSC selection process. Third, two OSC selection algorithms are proposed: one based on binary search to find a single OSC, and the other based on three-way decision theory to identify all OSCs. Finally, the experimental results validate the monotonicity of the positive region in the new model and demonstrate that the proposed algorithms are not only suitable for VPGMRSMs, but also effectively reduce the computation time.</div></div>\",\"PeriodicalId\":13842,\"journal\":{\"name\":\"International Journal of Approximate Reasoning\",\"volume\":\"187 \",\"pages\":\"Article 109569\"},\"PeriodicalIF\":3.0000,\"publicationDate\":\"2025-09-10\",\"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/S0888613X25002105\",\"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/S0888613X25002105","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

现有的广义多尺度粗糙集模型大多基于Pawlak粗糙集,缺乏容错性,限制了模型的泛化能力。为了提高泛化能力,提出了变精度广义多尺度粗糙集模型(VPGMRSM)。然而,该模型破坏了正区域的单调性,对最优尺度组合(OSC)的选择提出了挑战。为了解决这些问题,本文通过两阶段逼近过程提出了单调VPGMRSM。该模型保留了GMRSM的单调性和VPGMRSM的容错性,并进一步应用于OSC的选择。首先,分析了原始VPGMRSM中正区域的非单调性。在此基础上,提出了一种单调的VPGMRSM,并证明了其信息测量能够满足原模型的单调性不足。其次,基于新模型中的正区域,提出了盐含量的扩展定义,显著简化了盐含量选择过程,提高了选择效率。第三,提出了两种OSC选择算法:一种是基于二分搜索来寻找单个OSC,另一种是基于三向决策理论来识别所有OSC。最后,实验结果验证了新模型正区域的单调性,表明所提算法不仅适用于VPGMRSMs,而且有效地减少了计算时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimal scale combination selection based on a monotonic variable precision multi-scale rough set model
Most existing generalized multi-scale rough set models (GMRSMs) are based on Pawlak's rough set, which lacks fault tolerance and thus limits their generalization ability. To improve generalization, the variable precision generalized multi-scale rough set model (VPGMRSM) was proposed. However, this model disrupts the monotonicity of the positive region, posing challenges for optimal scale combination (OSC) selection. To address these issues, a monotonic VPGMRSM is proposed in this paper through a two-stage approximation process. The proposed model preserves the monotonicity of the GMRSM and the fault tolerance of the VPGMRSM, and is further applied to OSC selection. First, the non-monotonicity of the positive region in the original VPGMRSM is analyzed. Then, a monotonic VPGMRSM is proposed, whose information measurements are proven to satisfy the monotonicity lacking in the original model. Second, an extended definition of OSC is proposed based on the positive region in the new model, which significantly simplifies and improves the efficiency of the OSC selection process. Third, two OSC selection algorithms are proposed: one based on binary search to find a single OSC, and the other based on three-way decision theory to identify all OSCs. Finally, the experimental results validate the monotonicity of the positive region in the new model and demonstrate that the proposed algorithms are not only suitable for VPGMRSMs, but also effectively reduce the computation time.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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学术文献互助群
群 号:604180095
Book学术官方微信