DocumentCode
3063584
Title
F-Parallel Reducts in the Information View
Author
Chen, Lin ; Deng, Dayong ; Wang, Chunping
Author_Institution
Coll. of Math., Phys. & Inf. Eng., Zhejiang Normal Univ., Jinhua, China
fYear
2012
fDate
23-26 June 2012
Firstpage
587
Lastpage
591
Abstract
Parallel reducts in the information view and an algorithm with the matrix of attribute significance in the information view are introduced in this paper. Furthermore, F-attribute significance in the information view is defined, and its properties are investigated. We apply it to obtain parallel reducts, and an algorithm with F-attribute significance in the information view is proposed. Experiments show that our methods have advantages over dynamic reducts, and the new method not only improves the time efficiency but also decreases the length of parallel reducts.
Keywords
rough set theory; F-attribute significance; F-parallel reducts; dynamic reducts; information view; time efficiency; Complexity theory; Educational institutions; Entropy; Heuristic algorithms; Information entropy; Rough sets; F-attribute significance; attribute significance; dynamic reducts; parallel reducts; rough sets;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Sciences and Optimization (CSO), 2012 Fifth International Joint Conference on
Conference_Location
Harbin
Print_ISBN
978-1-4673-1365-0
Type
conf
DOI
10.1109/CSO.2012.134
Filename
6274795
Link To Document