期刊
KNOWLEDGE-BASED SYSTEMS
卷 79, 期 -, 页码 90-98出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.knosys.2015.02.003
关键词
Rough set; Covering information system; Knowledge acquisition; Set approximation; Reduct; Matrix
资金
- National Natural Science Foundation of China [61379021, 11301367, 11061004, 61303131]
- Department of Education, Fujian Province [JA13202, JK2013027]
Covering rough set theory provides an effective approach to dealing with uncertainty in data analysis. Knowledge acquisition is a main issue in covering rough set theory. However, the original rough set methods are still expensive for this issue in terms of time consumption. To further improvement, we propose fast approaches to knowledge acquisition in covering information systems by employing novel matrix operations. Firstly, several matrix operations are introduced to compute set approximations and reducts of a covering information system. Then, based on the proposed matrix operations, the knowledge acquisition algorithms are designed. In the end, experiments are conducted to illustrate that the new algorithms can dramatically reduce the time consumptions for computing set approximations and reducts of a covering information system, and the larger the scale of a data set is, the better the new algorithms perform. (C) 2015 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据