首页> 外文会议>International Conference on Computational Intelligence and Knowledge Economy >Performance Comparison of Particle Swarm Optimization and Genetic Algorithm for Feature Subset Selection in Keystroke Dynamics
【24h】

Performance Comparison of Particle Swarm Optimization and Genetic Algorithm for Feature Subset Selection in Keystroke Dynamics

机译:击键动力学中粒子群选择的粒子群优化和遗传算法性能比较

获取原文

摘要

In recent years there has been increased focus on use of keystroke dynamics based authentication for mobile phones. The accuracy of the keystroke dynamics usually increases with an increase in features. But due to the limited processing power of mobile phones, it becomes essential to keep the feature subset minimal and at the same time keeping the accuracy unaffected. Thus, optimization algorithms play a vital role for feature subset selection. We compared the performance of Particle Swarm Optimization and Genetic Algorithm in reducing the number of features. It was observed that the feature set reduced from 49 to a range between 17-26 and the accuracy of the system increased to a maximum of 92.58%.
机译:近年来,人们越来越关注基于击键动力学的移动电话认证。击键动力学的准确性通常随功能的增加而增加。但是由于手机的处理能力有限,因此必须使功能子集最小化,同时保持准确性不变。因此,优化算法对于特征子集选择起着至关重要的作用。我们比较了粒子群优化和遗传算法在减少特征数量方面的性能。可以观察到,特征集从49减少到17-26之间的范围,系统的精度增加到最大92.58%。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号