Please use this identifier to cite or link to this item: https://scholar.ptuk.edu.ps/handle/123456789/696
cc-by
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMafarja, M-
dc.contributor.authorEleyan, D-
dc.date.accessioned2019-06-23T10:06:08Z-
dc.date.available2019-06-23T10:06:08Z-
dc.date.issued2013-
dc.identifier.urihttps://scholar.ptuk.edu.ps/handle/123456789/696-
dc.descriptionFeature selection is an important concept in rough set theory; it aims to determine a minimal subset of features that are jointly sufficient for preserving a particular property of the original data. This paper proposes an attribute reduction method that is based on Ant Colony Optimization algorithm and rough set theory as an evaluation measurement. The proposed method was tested on standard benchmark datasets. The results show that this algorithm performs well and competes other attribute reduction approaches in terms of the number of the selected features and the running timen_US
dc.description.abstractFeature selection is an important concept in rough set theory; it aims to determine a minimal subset of features that are jointly sufficient for preserving a particular property of the original data. This paper proposes an attribute reduction method that is based on Ant Colony Optimization algorithm and rough set theory as an evaluation measurement. The proposed method was tested on standard benchmark datasets. The results show that this algorithm performs well and competes other attribute reduction approaches in terms of the number of the selected features and the running timen_US
dc.language.isoenen_US
dc.publisherInternational Journal of Computer Science and Electronics Engineering (IJCSEE) Volume 1(2) (2013).en_US
dc.titleComputer Numerical Control-PCB Drilling Machine with Efficient Path Planningen_US
dc.typeArticleen_US
Appears in Collections:Applied science faculty

Files in This Item:
File Description SizeFormat 
Ant Colony Optimization based Feature Selection in Rough Set Theory..pdf103.28 kBAdobe PDFThumbnail
View/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.