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

  • Authors:
  • Kiran S. Balagani;Vir V. Phoha;Asok Ray;Shashi Phoha

  • Affiliations:
  • Computer Science, Louisiana Tech University, LA 71270, USA;Computer Science, Louisiana Tech University, LA 71270, USA;Mechanical and Nuclear Engineering, Penn State University, PA 16802, USA;Electrical and Computer Engineering, Penn State University, PA 16802, USA

  • Venue:
  • Pattern Recognition Letters
  • Year:
  • 2011

Quantified Score

Hi-index 0.10

Visualization

Abstract

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.