Parallel Reducts in a Series of Decision Subsystems

Authors:
Dayong Deng;Jiyi Wang;Xiangjun Li
Affiliations:
-;-;-
Venue:
CSO '09 Proceedings of the 2009 International Joint Conference on Computational Sciences and Optimization - Volume 02
Year:
2009

Citing 0
Cited 4

Parallel reducts based on attribute significance

RSKT'10 Proceedings of the 5th international conference on Rough set and knowledge technology
Test-cost-sensitive attribute reduction

Information Sciences: an International Journal
Classification and decision based on parallel reducts and f-rough sets

RSKT'12 Proceedings of the 7th international conference on Rough Sets and Knowledge Technology
Quantitative analysis for covering-based rough sets through the upper approximation number

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.