计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (8): 92-94.

• 学术探讨 • 上一篇    下一篇

基于分辨矩阵的快速完备约简算法

王加阳,高 灿   

  1. 中南大学 信息科学与工程学院,长沙 410083
  • 收稿日期:2007-07-10 修回日期:2007-09-17 出版日期:2008-03-11 发布日期:2008-03-11
  • 通讯作者: 王加阳

Fast and complete algorithm for reduction based on discernibility matrix

WANG Jia-yang,GAO Can   

  1. College of Information Science and Engineering,Central South University,Changsha 410083,China
  • Received:2007-07-10 Revised:2007-09-17 Online:2008-03-11 Published:2008-03-11
  • Contact: WANG Jia-yang

摘要: 对分辨矩阵求核过程进行改进与扩展,给出了一种以属性频度作为启发式信息计算最小约简快速完备方法。与其它最小约简算法相比,该算法在很大程度上降低了算法的复杂度,提高了算法的效率。

Abstract: Through improving and extending the process of computing core,the minimal reduction algorithm based on attribute frequency heuristic information are put forward.Comparing with other minimal reduction algorithms,further improving the efficiency of algorithm.Finally,An example is be given to explain the validity of the new algorithm.