Forked from aythamimm/keystroke_btas15_scoring/1
Algorithms have at least one input and one output. All algorithm endpoints are organized in groups. Groups are used by the platform to indicate which inputs and outputs are synchronized together. The first group is automatically synchronized with the channel defined by the block in which the algorithm is deployed.
Parameters allow users to change the configuration of an algorithm when scheduling an experiment
|Data field used to generate the feature template
|given_name, family_name, email, nationality, id_number, all_five
|Distance to obtain the matching score
|Modified Scaled Manhattan
|Scaled Manhattan, Modified Scaled Manhattan, Combined Manhattan-Mahalanobis, Mahalanobis + Nearest Neighbor
The code for this algorithm in Python
The ruler at 80 columns indicate suggested POSIX line breaks (for readability).
The editor will automatically enlarge to accomodate the entirety of your input
Use keyboard shortcuts for search/replace and faster editing. For example, use Ctrl-F (PC) or Cmd-F (Mac) to search through this box
For a given set of feature vectors and enrollment set, the modified manhattan scaled distance is obtained. See  for details.
AGREEMENT ON THE USE OF THIS CODE AND ANY GENERATED DATA
 A. Morales, M. Falanga, J. Fierrez, C. Sansone and J. Ortega-Garcia, "Keystroke Dynamics Recognition based on Personal Data: A Comparative Experimental Evaluation Implementing Reproducible Research ", in Proc. the IEEE Seventh International Conference on Biometrics: Theory, Applications and Systems, Arlington, Virginia, USA, September 2015