摘要
Attribute reduction in rough set theory is an important feature selection method. Since attribute reduction is an NP-hard problem, it is necessary to investigate fast and effective approximate algorithms. In this paper, we introduce a new approach based on ant colony optimization (ACO) for attribute reduction. To verify the proposed algorithm, numerical experiments are carried out on thirteen small or medium-sized datasets and three gene expression datasets. The results demonstrate that this algorithm can provide competitive solutions efficiently.
| 源语言 | 英语 |
|---|---|
| 页(从-至) | 1351-1357 |
| 页数 | 7 |
| 期刊 | Pattern Recognition Letters |
| 卷 | 29 |
| 期 | 9 |
| DOI | |
| 出版状态 | 已出版 - 1 7月 2008 |
学术指纹
探究 'An efficient ant colony optimization approach to attribute reduction in rough set theory' 的科研主题。它们共同构成独一无二的指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver