Computer Science ›› 2006, Vol. 33 ›› Issue (4): 155-158.

Previous Articles     Next Articles

  

  • Online:2018-11-17 Published:2018-11-17

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

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!