摘要
针对基于频度的属性约简算法(HORAFA)在处理不完备信息时存在的不确定性,以条件属性与决策属性之间的关联为基础,通过对传统区分矩阵进行重新定义,进一步规范操作和运算流程,并采用哈希表存储区分矩阵信息,在查找速度和存储空间中寻找新的平衡,从而形成了一种新的基于频度的属性约简算法(IHORAFA),提高了算法的效率和对环境的适应性。
In order to extract rules from incomplete data system without information distortion, the tradition discernibility matrix is redefined based on the relationship between the condition attributes and decision attributes, and the discernibility matrix is stored in the hash table to search a new balance between the searching speed and storing space, then a decomposition approach in incomplete data system is proposed, and the feasibility of this method in dealing with the incomplete data has been verified.
出处
《计算机与数字工程》
2013年第7期1067-1069,共3页
Computer & Digital Engineering
关键词
属性约简
区分矩阵
哈希表
attribute reduction
discernibility matrix
Hash table
