In the paper we present a new type of attribute reducts in a decision system, which is called parallel reduct. The parallel reduct is the extension of both Pawlak reduct and dynamic reduct. It could be counted by parallel computation, and could be applied to tremendously large data and increase data just like dynamic reducts, but parallel reducts could be got easier than dynamic reducts.
['Dayong Deng', 'Jiyi Wang', 'Xiangjun Li']
Parallel Reducts in a Series of Decision Subsystems