长文本击键动力学中的迁移学习

Hayreddin Çeker, S. Upadhyaya
{"title":"长文本击键动力学中的迁移学习","authors":"Hayreddin Çeker, S. Upadhyaya","doi":"10.1109/ISBA.2017.7947710","DOIUrl":null,"url":null,"abstract":"Conventional machine learning algorithms based on keystroke dynamics build a classifier from labeled data in one or more sessions but assume that the dataset at the time of verification exhibits the same distribution. Ideally, the keystroke data collected at a session is expected to be an invariant representation of an individual's behavioral biometrics. In real applications, however, the data is sensitive to several factors such as emotion, time of the day and keyboard layout. A user's typing characteristics may gradually change over time and space. Therefore, a traditional classifier may perform poorly on another dataset that is acquired under different environmental conditions. In this paper, we apply two transfer learning techniques on long-text data to update a classifier according to the changing environmental conditions with minimum amount of re-training. We show that by using adaptive techniques, it is possible to identify an individual at a different time by acquiring only a few samples from another session, and at the same time obtain up to 19% higher accuracy relative to the traditional classifiers. We make a comparative analysis among the proposed algorithms and report the results with and without the knowledge transfer. At the end, we conclude that adaptive classifiers exhibit a higher start by a good approximation and perform better than the classifiers trained from scratch.","PeriodicalId":436086,"journal":{"name":"2017 IEEE International Conference on Identity, Security and Behavior Analysis (ISBA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Transfer learning in long-text keystroke dynamics\",\"authors\":\"Hayreddin Çeker, S. Upadhyaya\",\"doi\":\"10.1109/ISBA.2017.7947710\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Conventional machine learning algorithms based on keystroke dynamics build a classifier from labeled data in one or more sessions but assume that the dataset at the time of verification exhibits the same distribution. Ideally, the keystroke data collected at a session is expected to be an invariant representation of an individual's behavioral biometrics. In real applications, however, the data is sensitive to several factors such as emotion, time of the day and keyboard layout. A user's typing characteristics may gradually change over time and space. Therefore, a traditional classifier may perform poorly on another dataset that is acquired under different environmental conditions. In this paper, we apply two transfer learning techniques on long-text data to update a classifier according to the changing environmental conditions with minimum amount of re-training. We show that by using adaptive techniques, it is possible to identify an individual at a different time by acquiring only a few samples from another session, and at the same time obtain up to 19% higher accuracy relative to the traditional classifiers. We make a comparative analysis among the proposed algorithms and report the results with and without the knowledge transfer. At the end, we conclude that adaptive classifiers exhibit a higher start by a good approximation and perform better than the classifiers trained from scratch.\",\"PeriodicalId\":436086,\"journal\":{\"name\":\"2017 IEEE International Conference on Identity, Security and Behavior Analysis (ISBA)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE International Conference on Identity, Security and Behavior Analysis (ISBA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISBA.2017.7947710\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE International Conference on Identity, Security and Behavior Analysis (ISBA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISBA.2017.7947710","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

摘要

基于击键动力学的传统机器学习算法从一个或多个会话中的标记数据构建分类器,但假设验证时的数据集呈现相同的分布。理想情况下,在会话中收集的击键数据应该是个体行为生物特征的不变表示。然而,在实际应用中,数据对几个因素很敏感,比如情绪、一天中的时间和键盘布局。用户的打字特征可能会随着时间和空间的变化而逐渐改变。因此,传统的分类器在不同环境条件下获得的另一个数据集上可能表现不佳。在本文中,我们在长文本数据上应用两种迁移学习技术,以最小的再训练量根据不断变化的环境条件更新分类器。我们表明,通过使用自适应技术,可以通过从另一个会话中获取少量样本来识别不同时间的个体,同时相对于传统分类器获得高达19%的准确率。我们对所提出的算法进行了比较分析,并报告了考虑和不考虑知识转移的结果。最后,我们得出结论,自适应分类器通过良好的近似表现出更高的起点,并且比从头开始训练的分类器表现得更好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Transfer learning in long-text keystroke dynamics
Conventional machine learning algorithms based on keystroke dynamics build a classifier from labeled data in one or more sessions but assume that the dataset at the time of verification exhibits the same distribution. Ideally, the keystroke data collected at a session is expected to be an invariant representation of an individual's behavioral biometrics. In real applications, however, the data is sensitive to several factors such as emotion, time of the day and keyboard layout. A user's typing characteristics may gradually change over time and space. Therefore, a traditional classifier may perform poorly on another dataset that is acquired under different environmental conditions. In this paper, we apply two transfer learning techniques on long-text data to update a classifier according to the changing environmental conditions with minimum amount of re-training. We show that by using adaptive techniques, it is possible to identify an individual at a different time by acquiring only a few samples from another session, and at the same time obtain up to 19% higher accuracy relative to the traditional classifiers. We make a comparative analysis among the proposed algorithms and report the results with and without the knowledge transfer. At the end, we conclude that adaptive classifiers exhibit a higher start by a good approximation and perform better than the classifiers trained from scratch.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信