摘要
给出一种相对属性约简的算法 .该算法对于信息表中由决策属性决定的划分中的每个基本集合 ,计算它们的下逼近集并对每个条件属性在下逼近集中的取值进行检索 ,剔除可能是多余的条件属性 ,得到一个候选属性约简 .在此基础上 ,通过逐步扩展属性 ,最终得到一个属性约简 .与已有的一些算法相比 。
We present in this paper an algorithm for relative reduction of attributes in an information system. The algorithm first computes the lower approximation of every basic set in the equivalence class defined by the decision attribute, then, by retrieving the values taken by each condition attribute in the lower approximation sets, deletes some possibly superfluous attributes and finally obtains a relative reduction through extension of attributes. The algorithm requires less computational effort than some existing reduction algorithms.
出处
《福州大学学报（自然科学版）》
CAS
CSCD
2000年第6期7-9,共3页
Journal of Fuzhou University(Natural Science Edition)
基金
福建省自然科学基金资助项目!(A0 0 10 0 0 9)
福建省教育厅科研项目!(JA0 0 144 )
