.png){kind=icon}
返回
Hybrid genetic algorithm for dual selection
.png){kind=icon}
OA
AI
DOI：10.1007/s10044-007-0089-3.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, a hybrid genetic approach is proposed to solve the problem of designing a subdatabase of the original one with the highest classification performances, the lowest number of features and the highest number of patterns. The method can simultaneously treat the double problem of editing instance patterns and selecting features as a single optimization problem, and therefore aims at providing a better level of information. The search is optimized by dividing the algorithm into self-controlled phases managed by a combination of pure genetic process and dedicated local approaches. Different heuristics such as an adapted chromosome structure and evolutionary memory are introduced to promote diversity and elitism in the genetic population. They particularly facilitate the resolution of real applications in the chemometric field presenting databases with large feature sizes and medium cardinalities. The study focuses on the double objective of enhancing the reliability of results while reducing the time consumed by combining genetic exploration and a local approach in such a way that excessive computational CPU costs are avoided. The usefulness of the method is demonstrated with artificial and real data and its performance is compared to other approaches.
Keyword:
feature selection
genetic algorithm
heuristics
classification
k-nearest neighbor method
期刊
IF:
2
论文数:
2.0K
被引数:
1.9K
机构
引用论文
Monodisperse single-crystal mesoporous magnetite nanoparticles induced by nanoscale gas bubbles
.png){kind=icon}
PREAI
分享收藏
分享收藏分享收藏分享收藏
查看更多内容