{"title":"通过一种新颖的多目标二进制bat算法对击键动力学特征进行同步排序和选择","authors":"Taha M. Mohamed , Hossam M. Moftah","doi":"10.1016/j.fcij.2017.11.005","DOIUrl":null,"url":null,"abstract":"<div><p>In this paper, we propose a novel multi-objective binary bat algorithm for simultaneous ranking and selection of keystroke dynamics features. The proposed algorithm uses the <em>V shaped</em> binarization function. Simulation results show that, the proposed algorithm can efficiently identify the most important features of the data set. Of the three feature classes, the key down hold time features (H-features) are proofed to be the most dominant features. Using H-features only in classification decreases the mean square error (MSE) by 2% compared to choosing all features in classification. The UD features are the second ranked features. The worst features are the DD features which represent the largest MSE when being used individually in the classification process. The results are performed using two classifiers for comparisons; the linear and the quadratic classifiers. The quadratic classifier outperforms the linear classifier with respect to the mean square error (MSE) and the average number of features selected.</p></div>","PeriodicalId":100561,"journal":{"name":"Future Computing and Informatics Journal","volume":"3 1","pages":"Pages 29-40"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.fcij.2017.11.005","citationCount":"9","resultStr":"{\"title\":\"Simultaneous ranking and selection of keystroke dynamics features through a novel multi-objective binary bat algorithm\",\"authors\":\"Taha M. Mohamed , Hossam M. Moftah\",\"doi\":\"10.1016/j.fcij.2017.11.005\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>In this paper, we propose a novel multi-objective binary bat algorithm for simultaneous ranking and selection of keystroke dynamics features. The proposed algorithm uses the <em>V shaped</em> binarization function. Simulation results show that, the proposed algorithm can efficiently identify the most important features of the data set. Of the three feature classes, the key down hold time features (H-features) are proofed to be the most dominant features. Using H-features only in classification decreases the mean square error (MSE) by 2% compared to choosing all features in classification. The UD features are the second ranked features. The worst features are the DD features which represent the largest MSE when being used individually in the classification process. The results are performed using two classifiers for comparisons; the linear and the quadratic classifiers. The quadratic classifier outperforms the linear classifier with respect to the mean square error (MSE) and the average number of features selected.</p></div>\",\"PeriodicalId\":100561,\"journal\":{\"name\":\"Future Computing and Informatics Journal\",\"volume\":\"3 1\",\"pages\":\"Pages 29-40\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/j.fcij.2017.11.005\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Future Computing and Informatics Journal\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2314728817300624\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Future Computing and Informatics Journal","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2314728817300624","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Simultaneous ranking and selection of keystroke dynamics features through a novel multi-objective binary bat algorithm
In this paper, we propose a novel multi-objective binary bat algorithm for simultaneous ranking and selection of keystroke dynamics features. The proposed algorithm uses the V shaped binarization function. Simulation results show that, the proposed algorithm can efficiently identify the most important features of the data set. Of the three feature classes, the key down hold time features (H-features) are proofed to be the most dominant features. Using H-features only in classification decreases the mean square error (MSE) by 2% compared to choosing all features in classification. The UD features are the second ranked features. The worst features are the DD features which represent the largest MSE when being used individually in the classification process. The results are performed using two classifiers for comparisons; the linear and the quadratic classifiers. The quadratic classifier outperforms the linear classifier with respect to the mean square error (MSE) and the average number of features selected.