...
首页> 外文期刊>Applied Soft Computing >Five discrete symbiotic organisms search algorithms for simultaneous optimization of feature subset and neighborhood size of KNN classification models
【24h】

Five discrete symbiotic organisms search algorithms for simultaneous optimization of feature subset and neighborhood size of KNN classification models

机译:五个离散的共生生物搜索算法,用于同时优化特征子集和KNN分类模型的邻域大小

获取原文
获取原文并翻译 | 示例
           

摘要

This paper develops five new discrete Symbiotic Organisms Search (SOS) algorithms for simultaneous optimization of feature subset and neighborhood size of k-nearest neighbor model to improve classification accuracy. The first algorithm is a discrete version of the original SOS algorithm, named DSOS. The second is a hybrid derived from enhancing the first DSOS with paired swap local search, named DHSOS. The third is a cooperative hybrid between DSOS and a discrete particle swarm optimization (DPSO), named DSOSPSO. The fourth and fifth are modified from the second by adapting population size rather than fixing it, named APDHSOS and AP2DHSOS, respectively. Five existing metaheuristic algorithms are also implemented and extended for comparison. The performance of these algorithms employing the k-nearest neighbor classification model are evaluated in terms of classification error and computational time based on stratified k-fold cross validation with 11 datasets. The classification errors of five larger data sets are also obtained to further verify the test results. Based on the test results, it is found that: (1) feature selection with fixed neighborhood size yields lower errors than optimized neighborhood size without feature selection; (2) simultaneous optimization of feature subset and neighborhood size overall outperforms optimizing either feature subset or neighborhood size alone; and (3) among all the ten algorithms tested for simultaneous optimization, APDHSOS and AP2DHSOS emerge to tie the best in terms of classification error, implying that adaptive population size works better than fixing population size. (C) 2017 Elsevier B.V. All rights reserved.
机译:本文开发了五种新的离散共生生物搜索(SOS)算法,用于同时优化K到最近邻模型的特征子集和邻域大小,以提高分类准确性。第一算法是名为DSO的原始SOS算法的离散版本。第二个是源于增强第一个DSO的第一个DSO的混合动力,命名为DHSO。第三是DSO和离散粒子群优化(DPSO)之间的合作混合,名为DSOSPSO。通过调整群体大小而不是将其命名为APDHSOS和AP2DHSOS来修改第四和第五。还实现了五种现有的成分型算法并扩展了比较。基于具有11个数据集的分层k折叠交叉验证的分类误差和计算时间,评估采用K-Chrent Exbank邻分类模型的这些算法的性能。还获得了五种较大数据集的分类误差以进一步验证测试结果。基于测试结果,发现:(1)具有固定邻域大小的特征选择产生的误差低于优化的邻域大小,而无需特征选择; (2)同时优化特征子集和邻域大小的总体优势优化特征子集或单独的邻域大小; (3)在对同时优化测试的所有十种算法中,APDHSOS和AP2DHSOS出现以在分类误差方面获得最佳,这意味着自适应人口大小的工作比固定人口大小更好。 (c)2017 Elsevier B.v.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号