On the discriminability of keystroke feature vectors used in fixed text keystroke authentication

被引:32
作者
Balagani, Kiran S. [1 ]
Phoha, Vir V.
Ray, Asok [2 ]
Phoha, Shashi [2 ]
机构
[1] Louisiana Tech Univ, Ctr Secure Cyberspace, Ruston, LA 71270 USA
[2] Penn State Univ, University Pk, PA 16802 USA
关键词
Keystroke dynamics; User recognition; Feature selection analysis; Bhattacharya distance; Parzen window; Mahalanobis distance; MUTUAL INFORMATION; VERIFICATION; PROBABILITY; SELECTION;
D O I
10.1016/j.patrec.2011.02.014
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Heterogeneous and aggregate vectors are the two widely used feature vectors in fixed text keystroke authentication. In this paper, we address the question "Which vectors, heterogeneous, aggregate, or a combination of both, are more discriminative and why?" We accomplish this in three ways - (1) by providing an intuitive example to illustrate how aggregation of features inherently reduces discriminability; (2) by formulating "discriminability" as a non-parametric estimate of Bhattacharya distance, we show theoretically that the discriminability of a heterogeneous vector is higher than an aggregate vector; and (3) by conducting user recognition experiments using a dataset containing keystrokes from 33 users typing a 32-character reference text, we empirically validate our theoretical analysis. To compare the discriminability of heterogeneous and aggregate vectors with different combinations of keystroke features, we conduct feature selection analysis using three methods: (1) ReliefF, (2) correlation based feature selection, and (3) consistency based feature selection. Results of feature selection analysis reinforce the findings of our theoretical analysis. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码:1070 / 1080
页数:11
相关论文
共 32 条
[1]  
[Anonymous], 2006, TOEPLITZ CIRCULANT M
[2]  
[Anonymous], 1993, Proceedings of the 13th International Joint Conference on Artificial Intelligence
[3]  
[Anonymous], 1973, Pattern Classification and Scene Analysis
[4]  
[Anonymous], 1997, ICML
[5]  
[Anonymous], 1997, MACHINE LEARNING, MCGRAW-HILL SCIENCE/ENGINEERING/MATH
[6]   User authentication through typing biometrics features [J].
Araújo, LCF ;
Sucupira, LHR ;
Lizárraga, MG ;
Ling, LL ;
Yabu-Uti, JBT .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2005, 53 (02) :851-855
[7]   USING MUTUAL INFORMATION FOR SELECTING FEATURES IN SUPERVISED NEURAL-NET LEARNING [J].
BATTITI, R .
IEEE TRANSACTIONS ON NEURAL NETWORKS, 1994, 5 (04) :537-550
[8]  
BERGANDANO F, 2002, ACM T INFORM SYSTEM, V5, P362
[9]   Bayesian network classifiers [J].
Friedman, N ;
Geiger, D ;
Goldszmidt, M .
MACHINE LEARNING, 1997, 29 (2-3) :131-163
[10]  
Giot Romain., 2009, Biometrics: Theory, Applications, and Systems, P1, DOI DOI 10.1109/BTAS.2009.5339051