Computer Science ›› 2010, Vol. 37 ›› Issue (7): 208-211.

Previous Articles     Next Articles

Quick Algorithm for Computing Core of the Positive Region Based on Order Relation

XU Zhang-yan,SHU Wen-hao,QIAN Wen-bin,YANG Bing-ru   

  • Online:2018-12-01 Published:2018-12-01

Abstract: At present, the main method of designing algorithm for computing the core based on the positive region is discernibility matrix In this method, the core is found by discovering all discernibility elements of discenibihty matrix So this method is very time consuming. On the foundation of the simplified decision table and simplified discernibility matrix, if the objects with condition attribute value of simplified decision table are looked as numbers, they are order. Using the order, the discernibility elements including the core may be turned into a mall quantity of research space. So the core based on the positive region can be found only by searching a small quantity of discernibility elements of the simplified discernibility matrix On this condition, an efficient computing core was designed by integrating the idea of radix sorting. The time complexity and space complexity are O(|C||U|)+O(|C|2|U/C|) and O(|C||U|) respectively.Since the core can be found by searching a small quantity of discerniblity elements of the simplified discernibility matrix in the new algorithm, the efficiency of the new algorithm is improved.

Key words: Rough set, Simplified decision table, Positive region, Core, Algorithm complexity

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!