DocumentCode
2822001
Title
Parallel Reducts in a Series of Decision Subsystems
Author
Deng, Dayong ; Wang, Jiyi ; Li, Xiangjun
Author_Institution
Coll. of Math., Phys. & Inf. Eng., Zhejiang Normal Univ., Jinhua, China
Volume
2
fYear
2009
fDate
24-26 April 2009
Firstpage
377
Lastpage
380
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.
Keywords
parallel algorithms; rough set theory; Pawlak reduct; attribute reducts; decision subsystems; dynamic reduct; parallel computation; parallel reducts; rough set theory; Concurrent computing; Distributed algorithms; Distributed computing; Educational institutions; Information systems; Mathematics; Physics computing; Rough sets; Set theory; Voting; Attribute Reduct; Dynamic Reducts; Parallel Reducts; Rough Sets;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Sciences and Optimization, 2009. CSO 2009. International Joint Conference on
Conference_Location
Sanya, Hainan
Print_ISBN
978-0-7695-3605-7
Type
conf
DOI
10.1109/CSO.2009.250
Filename
5193975
Link To Document