• Complex
  • Title
  • Keyword
  • Abstract
  • Scholars
  • Journal
  • ISSN
  • Conference
搜索

Author:

He, Ming (He, Ming.)

Indexed by:

CPCI-S EI Scopus

Abstract:

Ant colony optimization (ACO) algorithms have been applied successfully to combinatorial optimization problems. Rough set theory offers a viable approach for feature selection from data sets. In this paper, the basic concepts of rough set theory and ant colony optimization are introduced, and the role of the basic constructs of rough set approach in feature selection, namely attribute reduction is studied. Base above research, a rough set and ACO based algorithm for feature selection problems is proposed. Finally, the presented algorithm was tested on UCI data sets and performed effectively.

Keyword:

feature selection core rough set ant colony optimization

Author Community:

  • [ 1 ] Beijing Univ Technol, Coll Comp Sci, Beijing, Peoples R China

Reprint Author's Address:

  • [He, Ming]Beijing Univ Technol, Coll Comp Sci, Beijing, Peoples R China

Show more details

Related Keywords:

Related Article:

Source :

ISCSCT 2008: INTERNATIONAL SYMPOSIUM ON COMPUTER SCIENCE AND COMPUTATIONAL TECHNOLOGY, VOL 1, PROCEEDINGS

Year: 2008

Page: 247-250

Language: English

Cited Count:

WoS CC Cited Count: 5

SCOPUS Cited Count: 10

ESI Highly Cited Papers on the List: 0 Unfold All

WanFang Cited Count:

Chinese Cited Count:

30 Days PV: 2

Online/Total:477/10580044
Address:BJUT Library(100 Pingleyuan,Chaoyang District,Beijing 100124, China Post Code:100124) Contact Us:010-67392185
Copyright:BJUT Library Technical Support:Beijing Aegean Software Co., Ltd.