摘要
属性约简是粗糙集理论研究中的重要内容之一,现已证明寻找信息系统的最小约简是NP-hard问题。本文参考普通的增量式数据挖掘算法,提出一种改进的增量式属性约简算法,该算法在执行效率上比其他属性约简算法有了很大的提高,最后通过实例分析验证了算法的可行性和有效性。
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 analysis.
出处
《电脑知识与技术（过刊）》
2009年第4X期4503-4504,4519,共3页
Computer Knowledge and Technology
关键词
粗糙集
增量式数据挖掘
属性约简
rough set
incremental data mining
reduction of attribute
