一种基于属性划分的序信息系统并行约简算法

摘要

在粗糙集理论中，序信息系统的属性约简是一个重要的问题。目前已取得一些初步的研究成果，但仍缺乏有效的计算方法，主要表现为求解约简耗时过长。本文采用“分而治之”的策略，利用递减划分对属性进行分组，从而将原系统分解为规模相近的若干子系统，并在互不影响的情况下同步计算各子系统的核与约简，然后将子系统的核与约简合并得到原系统的核与约简。算例分析验证了本文提出的属性约简方法的可行性和有效性。%Attribute reduction in ordered information systems is an important issue in the rough set theory. Up to now, some basic results have been obtained. However, there are few effective computation methods which can save the computing time. In this paper, we apply the divide-and-conquer strategy to deal with it. More specifically, attributes are divided into different groups by progressively decreasing partition, and decomposing the original system into small subsystems with similar size. Then the core and reducts of each subsystem are syn-chronously and independent to calculate. Finally, numerical examples illustrate the feasibility and effectiveness of the proposed attribute reduction method.