Computer Science ›› 2005, Vol. 32 ›› Issue (10): 135-138.

Previous Articles     Next Articles

  

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

Abstract: In rough sets theory, reduction of attributes is an important issue. It has been proved that computing all reductions or the minimal reduction of decision table is a NP-hard problem. Now, many algorithms for reduction of attributes are still heuristic alg

Key words: Rough set, Reduction of attributes, Boundary region, Positive region

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!