| 基于粗糙集的增量式属性约简算法研究 |
| |
| 引用本文： | 栾爽,孙辉,刘甲伟. 基于粗糙集的增量式属性约简算法研究[J]. 数字社区&智能家居, 2009, 0(17) |
| |
| 作者姓名： | 栾爽 孙辉 刘甲伟 |
| |
| 作者单位： | 大连交通大学研究生学院;大连交通大学软件学院; |
| |
| 摘 要： | 属性约简是粗糙集理论研究中的重要内容之一,现已证明寻找信息系统的最小约简是NP-hard问题。本文参考普通的增量式数据挖掘算法,提出一种改进的增量式属性约简算法,该算法在执行效率上比其他属性约简算法有了很大的提高,最后通过实例分析验证了算法的可行性和有效性。
|
| 关 键 词： | 粗糙集 增量式数据挖掘 属性约简 |
Study on Incremental Reduction of Attribute based on Rough Set Theory |
| |
| LUAN Shuang,SUN Hui,LIU Jia-wei. Study on Incremental Reduction of Attribute based on Rough Set Theory[J]. Digital Community & Smart Home, 2009, 0(17) |
| |
| Authors: | LUAN Shuang SUN Hui LIU Jia-wei |
| |
| Affiliation: | LUAN Shuang1,SUN Hui2,LIU Jia-wei1(1.graduate College,Dalian Jiaotong University,Dalian 116028,China,2.Software faculty,China) |
| |
| Abstract: | Reduction of attribute is one of the important topics in the research on rough set theory.It has been p-roved that finding the minimal reduction of an information system is a NP-hard problem .In this paper,a kind of improved arithmetic about incremental reduction of attribute is proposed,which based on common arithmetic of incremental data mining.value.This algorithm is improved a lot in carrying out efficiency than others.And it has verified feasibility and validity of this algorithm through the instance a... |
| |
| Keywords: | rough set incremental data mining reduction of attribute |
| 本文献已被 CNKI 等数据库收录！ |
|
