Binary PSO variants for feature selection in handwritten signature authentication
Статья в журнале
In this paper we propose modifications of the well-known algorithm of particle swarm optimization (PSO). These changes affect the mapping of the motion of particles from continuous space to binary space for searching in it, which is widely used to solve the problem of feature selection. The modified binary PSO variations were tested on the dataset SVC2004 dedicated to the problem of user authentication based on dynamic features of a handwritten signature. In the example of k-nearest neighbours (kNN), experiments were carried out to find the optimal subset of features. The search for the subset was considered as a multicriteria optimization problem, taking into account the accuracy of the model and the number of features.
Журнал:
- Informatica
- Lietuvos Mokslu Akademija (Томск)
Библиографическая запись: Binary PSO Variants for Feature Selection in Handwritten Signature Authentication / E. Hancer [et al.] // Informatica. – 2022. – Vol. 33. – Iss. 3. – P. 523-543. – DOI 10.15388/21-INFOR472.
Ключевые слова:
FEATURE SELECTION HANDWRITTEN SIGNATURE PARTICLE SWARM OPTIMIZATION BIOMETRIC AUTHENTICATIONИндексируется в: