论文部分内容阅读
覆盖是属性约简中一种常见的数据表示,而覆盖粗糙集恰是处理这类数据的有效工具;拟阵是线性代数与图论的推广,目前已被广泛应用于许多领域特别是贪婪算法的设计,该算法在属性约简中起着重要的作用.鉴于此,有必要将拟阵与覆盖粗糙集相结合来解决此类优化问题.首先,本文通过横贯拟阵理论,构造了覆盖的拟阵结构;其次,利用该拟阵结构实现对覆盖的等价刻划;进一步,在该拟阵结构上定义了一类近似算子,通过证明上近似算子满足拟阵的闭包公理,从而诱导出另一个拟阵结构;最后研究了这两类拟阵结构之间的关系,而当覆盖退化到划分时,二者相等.
Coverage is a common data representation in attribute reduction. Covering rough set is an effective tool to deal with this kind of data. It is widely used in many fields, especially greedy algorithm The algorithm plays an important role in attribute reduction.In view of this, it is necessary to solve this kind of optimization problem by combining the mock-array and the coverage rough set.Firstly, this paper constructs the covering Then, a class of approximation operator is defined on the structure of the quasi-matrix. By proving that the upper approximation operator satisfies the closure axioms of the quasi-matrix, So as to induce another pseudo-matrix structure. Finally, we study the relationship between these two types of pseudo-matrix structures, and when the coverage degenerates to the division, the two are equal.