i a writing my master thesis on the subject of dynamic keystroke authentication. to support ongoing research, i am writing code to test out different methods of feature extraction and feature matching.
my current simple approach just checks if the reference password keycodes matches the currently typed in keycodes and also checks if the keypress times (dwell) and the key-to-key times (flight) are the same as reference times +/- 100ms (tolerance). this is of course very limited and i want to extend it with some sort of fuzzy c-means pattern matching.
for each key the features look like: keycode, dwelltime, flighttime (first flighttime is always 0).
obviously the keycodes can be taken out of the fuzzy algorithm because they have to be exactly the same. in this context, how would a practical implementation of fuzzy c-means look like?