DocumentCode
3311962
Title
(F, epsilon)-Parallel Reducts in a Series of Decision Subsystems
Author
Deng, Dayong
Author_Institution
Xingzhi Coll., Zhejiang Normal Univ., Jinhua, China
Volume
2
fYear
2010
fDate
28-31 May 2010
Firstpage
372
Lastpage
376
Abstract
In the paper we continue to investigate a new type of attribute reducts in a decision system, which is called parallel reduct. We extend the concept of parallel reducts to (F, ε)-parallel reducts and (F, k)-parallel reducts, and investigate their properties. Moreover, We present algorithms to get (F, ε)-parallel reducts and (F, k)-parallel reducts.
Keywords
decision tables; parallel algorithms; rough set theory; (F, ε)-parallel reducts; F, k)-parallel reducts; attribute reducts; decision subsystems; Concurrent computing; Distributed algorithms; Distributed computing; Educational institutions; Information systems; Rough sets; Set theory; Voting; (F; Pawlak reducts; dynamic reducts; e )-parallel reducts; parallel reducts; rough sets;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Science and Optimization (CSO), 2010 Third International Joint Conference on
Conference_Location
Huangshan, Anhui
Print_ISBN
978-1-4244-6812-6
Electronic_ISBN
978-1-4244-6813-3
Type
conf
DOI
10.1109/CSO.2010.174
Filename
5532979
Link To Document