Computer Engineering and Applications ›› 2008, Vol. 44 ›› Issue (8): 92-94.
• 学术探讨 • Previous Articles Next Articles
WANG Jia-yang,GAO Can
Received:
Revised:
Online:
Published:
Contact:
王加阳,高 灿
通讯作者:
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.
摘要： 对分辨矩阵求核过程进行改进与扩展，给出了一种以属性频度作为启发式信息计算最小约简快速完备方法。与其它最小约简算法相比，该算法在很大程度上降低了算法的复杂度，提高了算法的效率。
WANG Jia-yang,GAO Can. Fast and complete algorithm for reduction based on discernibility matrix[J]. Computer Engineering and Applications, 2008, 44(8): 92-94.
王加阳,高 灿. 基于分辨矩阵的快速完备约简算法[J]. 计算机工程与应用, 2008, 44(8): 92-94.
0 / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://cea.ceaj.org/EN/
http://cea.ceaj.org/EN/Y2008/V44/I8/92
