【区间集，粗糙集，属性约简】在区间集决策系统中基于双粒化和三视角不确定性度量的系统性属性约简

谢大虾

于 2024-10-06 09:35:36 发布

阅读量628

点赞数 19

分类专栏：写作文章标签：粗糙集属性约简粒计算区间集

本文链接：https://blog.csdn.net/qq_44822612/article/details/142722970

版权

写作专栏收录该内容

1 篇文章 0 订阅

订阅专栏

一、英文标题：Systematic attribute reductions based on double granulation structures and three-view uncertainty measures in interval-set decision systems

二、中文摘要：

属性约简消除了冗余信息，使其在数据推理中变得有价值。在区间集决策系统(ISDSs)的数据环境中，属性约简依赖于粒结构和不确定性度量;然而，现有的结构和测度存在单一性的局限性，因此它们的丰富意味着属性约简的相应改进。针对isds，提出了一种模糊等价的粒化结构来改进现有的相似粒化结构，提出了依赖度，利用代数信息融合来丰富现有的条件熵，因此系统地制定了3 × 2属性约简，包含了一种基本约简算法(CAR)和五种高级约简算法。在造粒层面，通过去除颗粒可重复性，将相似造粒结构改进为模糊等效造粒结构，形成两种知识结构。在测量层面，从代数角度提出依赖度，对信息角度的条件熵进行补充，从代数-信息角度将依赖度与条件熵融合生成混合测度，形成三视图、三向的不确定性测度，获得颗粒性单调/非单调性。在约简层面，两种颗粒结构和三视角不确定性测度两个维度上产生了基于属性重要度的3 × 2启发式约简算法，从而产生了五种新算法来改进旧算法(即CAR)。最后通过数据实验表明，3 × 2系统构建措施和属性约简的有效性和发展性，对比结果验证了isds上的粒结构、不确定性措施和约简算法的三级改进。本研究运用三层次思维，丰富了三方决策的理论和应用。

三、英文摘要：

Attribute reductions eliminate redundant information to become valuable in data reasoning. In the data context of interval-set decision systems (ISDSs), attribute reductions rely on granulation structures and uncertainty measures; however, the current structures and measures exhibit the singleness limitations, so their enrichments imply corresponding improvements of attribute reductions. Aiming at ISDSs, a fuzzy-equivalent granulation structure is proposed to improve the existing similar granulation structure, dependency degrees are proposed to enrich the existing condition entropy by using algebra-information fusion, so 3 × 2 attribute reductions are systematically formulated to contain both a basic reduction algorithm (called CAR) and five advanced reduction algorithms. At the granulation level, the similar granulation structure is improved to the fuzzy-equivalent granulation structure by removing the granular repeatability, and two knowledge structures emerge. At the measurement level, dependency degrees are proposed from the algebra perspective to supplement the condition entropy from the information perspective, and mixed measures are generated by fusing dependency degrees and condition entropies from the algebra-information viewpoint, so three-view and three-way uncertainty measures emerge to acquire granulation monotonicity/non-monotonicity. At the reduction level, the two granulation structures and three-view uncertainty measures twodimensionally produce 3 × 2 heuristic reduction algorithms based on attribute significances, and thus five new algorithms emerge to improve an old algorithm (i.e., CAR). As finally shown by data experiments, 3 × 2-systematic construction measures and attribute reductions exhibit the effectiveness and development, comparative results validate the three-level improvements of granulation structures, uncertainty measures, and reduction algorithms on ISDSs. This study resorts to tri-level thinking to enrich the theory and application of three-way decision.