基于Rough集的决策表属性最小约简的整数规划算法

Integer Programming Algorithm for Finding Minimal Reduction in Decision Table Based on Rough Set

近年来随着知识发现和数据挖掘的广泛应用,在计算机科学中约简算法越来越得到人们的重视。该文依据决策信息系统中属性约简与逻辑运算的关系,提出了一种计算属性集最小约简的整数规划算法,并建议了相应快速的求解方法。该算法能有效地避免大量逻辑运算,在动态环境下更显示其优越性。实例验证了该算法的有效性。

In recent years,due to the practical use of knowledge di scovery and data mining,the research for reduction is becoming more important aspect of computer science.Based on the relationship between attribute reductio n and logic operations,an integer programming algorithm in finding minimal size reduction is proposed in this paper and a method for solving the model is given .This algorithm can avoid complicated logic operations,and becomes more effect ive in dynamic environment.The experiments show the algorithm is effective.