DocumentCode :
2032466
Title :
A Recursive Algorithm of All Attribute Reductions Based on Boolean Matrix
Author :
Qian, Aizeng
Author_Institution :
Dept. of Comput. Sci. & Technol., Dezhou Univ., Dezhou
fYear :
2009
fDate :
23-24 May 2009
Firstpage :
1
Lastpage :
4
Abstract :
Based on the Boolean matrix in literature, the paper put forward a recursive algorithm to change conjunctive normal form into disjunctive normal form, thus get all attribute reductions. Experiment proves that the spatial and time efficiency of this method is higher than the ones in literature.
Keywords :
Boolean algebra; matrix algebra; recursive functions; rough set theory; Boolean matrix; attribute reductions; disjunctive normal form; recursive algorithm; rough set theory; Bismuth; Computer science; Information systems; Paper technology; Rough sets; Set theory; Uncertainty;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Systems and Applications, 2009. ISA 2009. International Workshop on
Conference_Location :
Wuhan
Print_ISBN :
978-1-4244-3893-8
Electronic_ISBN :
978-1-4244-3894-5
Type :
conf
DOI :
10.1109/IWISA.2009.5072667
Filename :
5072667
Link To Document :
بازگشت