이 제출물을 팔로우합니다
- 팔로우하는 게시물 피드에서 업데이트를 확인할 수 있습니다
- 정보 수신 기본 설정에 따라 이메일을 받을 수 있습니다
Crow search algorithm (CSA) is a new natural inspired algorithm proposed by Askarzadeh in 2016. The main inspiration of CSA came from crow search mechanism for hiding their food. Like most of optimization algorithms, CSA suffers from low convergence rate and entrapment in local optima. In this paper, a novel metaheuristic optimizer namely chaotic crow search algorithm (CCSA) is proposed to overcome these problems. The proposed CCSA is applied to optimize feature selection problem for twenty benchmark datasets. Ten chaotic maps are employed during the optimization process of CSA. The performance of CCSA is compared with other well-known and recent optimization algorithms. Experimental results reveal the capability of CCSA to find an optimal feature subset which maximizing the classification performance and minimizing the number of selected features. Moreover, the results show that CCSA is superior compared to CSA and the other algorithms. In addition, the experiments show that sine chaotic map is the appropriate map to significantly boost the performance of CSA.
인용 양식
Gehad Ismail Sayed (2026). Binary Chaotic Crow Search Algorithm (https://kr.mathworks.com/matlabcentral/fileexchange/64609-binary-chaotic-crow-search-algorithm), MATLAB Central File Exchange. 검색 날짜: .
| 버전 | 퍼블리시됨 | 릴리스 정보 | Action |
|---|---|---|---|
| 1.0.0.0 | G. Sayed, A. Hassanien and A. Taher, “Feature selection via a novel chaotic crow search algorithm”, Neural Computing and Applications, DOI 10.1007/s00521-017-2988- , 1-32, 2017. |
