arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1606.09075cs.CR
收藏

鲁棒的击键生物特征异常检测

Robust Keystroke Biometric Anomaly Detection

John V. Monaco

摘要:

Keystroke Biometrics Ongoing Competition(KBOC)提出了一个异常检测挑战,该挑战使用包含大量主题和真实世界方面的公共数据集。超过300名受试者输入了他们的名字和姓氏的不区分大小写的重复,因此,根据修饰键的使用,重复序列的长度和顺序可能会有所不同。为了解决这一问题,提出了一种语义匹配预处理算法,用于在不匹配序列中建立语义匹配。该方法是鲁棒的,在这个意义上,查询重复序列只需要近似匹配的目标序列,和比对是不可知的特定的异常检测器使用。本文介绍了提交给KBOC的15个性能最佳的异常检测系统,从自动编码神经网络到集成方法。曼哈顿距离达到了最低的相等出错率5.32%,而所有15个系统的表现优于任何其他提交。性能的提高在很大程度上是由于不特定的异常检测器,但预处理和得分归一化技术。

英文摘要:

The Keystroke Biometrics Ongoing Competition (KBOC) presented an anomaly detection challenge with a public keystroke dataset containing a large number of subjects and real-world aspects. Over 300 subjects typed case-insensitive repetitions of their first and last name, and as a result, keystroke sequences could vary in length and order depending on the usage of modifier keys. To deal with this, a keystroke alignment preprocessing algorithm was developed to establish a semantic correspondence between keystrokes in mismatched sequences. The method is robust in the sense that query keystroke sequences need only approximately match a target sequence, and alignment is agnostic to the particular anomaly detector used. This paper describes the fifteen best-performing anomaly detection systems submitted to the KBOC, which ranged from auto-encoding neural networks to ensemble methods. Manhattan distance achieved the lowest equal error rate of 5.32%, while all fifteen systems performed better than any other submission. Performance gains are shown to be due in large part not to the particular anomaly detector, but to preprocessing and score normalization techniques.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑