DocumentCode
496322
Title
A Non-recursive Algorithm for Solving All Attribute Reductions
Author
Qian, Aizeng
Author_Institution
Dept. of Comput. Sci. & Technol., Dezhou Univ., Dezhou, China
Volume
1
fYear
2009
fDate
24-26 April 2009
Firstpage
560
Lastpage
563
Abstract
Based on the Boolean matrix in literature, the paper puts forward a non-recursive algorithm to change conjunctive normal form into disjunctive normal form, thus all attribute reductions are obtained. The algorithm can reduce the superfluous ones when generate conjunctive terms of disjunctive normal form, and can improve spatial and time efficiency. The algorithm is already debugged successfully under Visual C++ 6.0, and experiments prove that the method is very simple and effective.
Keywords
Boolean algebra; matrix algebra; Visual C++ 6.0; attribute reduction; conjunctive normal form; disjunctive normal form; nonrecursive algorithm; Absorption; Computer science; Information systems; Mathematics; Paper technology; Rough sets; Set theory; Uncertainty; attribute reduction; boolean matrix; conjunctive normal form; disjunctive normal form; 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.217
Filename
5193759
Link To Document