Computer Science ›› 2006, Vol. 33 ›› Issue (4): 155-158.
Previous Articles Next Articles
Online:
Published:
Abstract: At present, the attribution reduction algorithm based on binary discernibility matrix has the following short comings, it's time complexity and space complexity are not good; the attribution reduction acquired from this algorithm is not the one acquired f
Key words: Rough set, Binary dicernibility matrix, Simple binary discernibility matrix, Core, Complexity
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.jsjkx.com/EN/
https://www.jsjkx.com/EN/Y2006/V33/I4/155
Cited