跳到主要导航 跳到搜索 跳到主要内容

Efficient attribute reduction algorithm

科研成果: 书/报告/会议事项章节会议稿件同行评审

摘要

Efficiency of algorithms is always an important issue concerned by so many researchers. Rough set theory is a valid tool to deal with imprecise problems. However, some of its algorithms' consuming time limits the applications of rough set. According to this, our paper analyzes the reasons of rough set algorithms' inefficiency by focusing on two important factors: indiscernible relation and positive region, and analyzes an equivalent and efficient method for computing positive region. And according to our research on the efficiency of some basic issues of rough set, a complete algorithm for the reduction of attributes is designed and its completeness is proved. Theoretical analysis and experimental results illustrate that our reduction algorithm is more efficient than some other algorithms.

源语言英语
主期刊名Artificial Intelligence Applications and Innovations - IFIP 18th World Computer Congress, TC12 1st International Conference on Artificial Intelligence Applications and Innovations, AIAI 2004
出版商Springer New York LLC
211-222
页数12
ISBN(印刷版)1402081502, 9781402081507
出版状态已出版 - 2004
已对外发布
活动IFIP TC12 1st International Conference on Artificial Intelligence Applications and Innovations, AIAI 2004 - Toulouse, 法国
期限: 22 8月 200427 8月 2004

出版系列

姓名IFIP Advances in Information and Communication Technology
154
ISSN(印刷版)1868-4238

会议

会议IFIP TC12 1st International Conference on Artificial Intelligence Applications and Innovations, AIAI 2004
国家/地区法国
Toulouse
时期22/08/0427/08/04

指纹

探究 'Efficient attribute reduction algorithm' 的科研主题。它们共同构成独一无二的指纹。

引用此