DroidTKM: Detection of Trojan Families using the KNN Classifier Based on Manhattan Distance Metric

Diyana Tehrany Dehkordy, A. Rasoolzadegan
{"title":"DroidTKM: Detection of Trojan Families using the KNN Classifier Based on Manhattan Distance Metric","authors":"Diyana Tehrany Dehkordy, A. Rasoolzadegan","doi":"10.1109/ICCKE50421.2020.9303720","DOIUrl":null,"url":null,"abstract":"Currently, the speed of Android malware publications has increased dramatically. The rapid rise of malware has made malware detection and family classification to become an important challenge; because attackers can publish more malware with minor changes in existing android applications. These minor changes in the application lead to the creation of multiple families of malware. So far, many methods have been proposed to detect malware applications and classify them. However, few methods focus on detecting malware families. In this paper, a detection method is proposed to identify Trojan families in order to improve accuracy and reduce error rates. To achieve these purposes, static and dynamic analysis are used to extract the required features of the applications. The k- means method has also been used to preprocess the obtained dataset. Then, a detection model is developed to identify families using the classifiers of K-Nearest Neighbor (KNN), Support Vector Machine, and Iterative Dichotomiser 3. The accuracy of KNN is also measured according to different distance metrics which has not yet been studied among malware detection methods. The proposed method is able to detect a variety of Trojans using KNN based on Manhattan metric with an accuracy of 97.83% and False Positive Rate (FPR) of 0.06%. The comparison between the performance of the proposed method and the other methods shows a 4.83% and 0.94% improvement in terms of accuracy and FPR, respectively.","PeriodicalId":402043,"journal":{"name":"2020 10th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 10th International Conference on Computer and Knowledge Engineering (ICCKE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCKE50421.2020.9303720","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

Currently, the speed of Android malware publications has increased dramatically. The rapid rise of malware has made malware detection and family classification to become an important challenge; because attackers can publish more malware with minor changes in existing android applications. These minor changes in the application lead to the creation of multiple families of malware. So far, many methods have been proposed to detect malware applications and classify them. However, few methods focus on detecting malware families. In this paper, a detection method is proposed to identify Trojan families in order to improve accuracy and reduce error rates. To achieve these purposes, static and dynamic analysis are used to extract the required features of the applications. The k- means method has also been used to preprocess the obtained dataset. Then, a detection model is developed to identify families using the classifiers of K-Nearest Neighbor (KNN), Support Vector Machine, and Iterative Dichotomiser 3. The accuracy of KNN is also measured according to different distance metrics which has not yet been studied among malware detection methods. The proposed method is able to detect a variety of Trojans using KNN based on Manhattan metric with an accuracy of 97.83% and False Positive Rate (FPR) of 0.06%. The comparison between the performance of the proposed method and the other methods shows a 4.83% and 0.94% improvement in terms of accuracy and FPR, respectively.
DroidTKM:基于曼哈顿距离度量的KNN分类器检测木马家族
目前,Android恶意软件发布的速度急剧增加。恶意软件的迅速崛起使得恶意软件的检测和分类成为一个重要的挑战;因为攻击者可以在现有的android应用程序中发布更多的恶意软件。应用程序中的这些微小变化导致了多个恶意软件家族的产生。到目前为止,已经提出了许多方法来检测恶意软件应用程序并对其进行分类。然而,很少有方法专注于检测恶意软件家族。本文提出了一种识别木马家族的检测方法,以提高准确率和降低错误率。为了实现这些目的,使用静态和动态分析来提取应用程序所需的特性。k均值方法也被用于预处理得到的数据集。然后,利用k -最近邻(KNN)、支持向量机和迭代二分器3的分类器建立了一个检测模型来识别家庭。根据不同的距离度量来衡量KNN的准确性,这在恶意软件检测方法中尚未研究。该方法能够利用基于曼哈顿度量的KNN检测多种木马,准确率为97.83%,假阳性率(FPR)为0.06%。与其他方法的性能比较表明,该方法的精度和FPR分别提高了4.83%和0.94%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信