| 基于Rough集的决策表属性最小约简的整数规划算法 |
| |
| 引用本文： | 戎晓霞,刘家壮,马英红. 基于Rough集的决策表属性最小约简的整数规划算法[J]. 计算机工程与应用, 2004, 40(11): 24-25,98 |
| |
| 作者姓名： | 戎晓霞 刘家壮 马英红 |
| |
| 作者单位： | 山东大学数学与系统科学学院,济南,250100;山东师范大学信息管理学院,济南,250014 |
| |
| 基金项目： | 国家自然科学基金(编号:10201019) |
| |
| 摘 要： | 近年来随着知识发现和数据挖掘的广泛应用,在计算机科学中约简算法越来越得到人们的重视。该文依据决策信息系统中属性约简与逻辑运算的关系,提出了一种计算属性集最小约简的整数规划算法,并建议了相应快速的求解方法。该算法能有效地避免大量逻辑运算,在动态环境下更显示其优越性。实例验证了该算法的有效性。
|
| 关 键 词： | 粗集 最小约简 整数规划 |
| 文章编号： | 1002-8331-(2004)11-0024-02 |
Integer Programming Algorithm for Finding Minimal Reduction in Decision Table Based on Rough Set |
| |
| Rong Xiaoxia Liu Jiazhuang Ma Yinghong. Integer Programming Algorithm for Finding Minimal Reduction in Decision Table Based on Rough Set[J]. Computer Engineering and Applications, 2004, 40(11): 24-25,98 |
| |
| Authors: | Rong Xiaoxia Liu Jiazhuang Ma Yinghong |
| |
| Affiliation: | Rong Xiaoxia 1 Liu Jiazhuang 1 Ma Yinghong 21 |
| |
| Abstract: | 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. |
| |
| Keywords: | Rough set Minimal reduction Integer programming |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
