首页 | 官方网站   微博 | 高级检索  
     

面向海量病毒样本家族聚类方法的研究
引用本文:赵跃华,林聚伟.面向海量病毒样本家族聚类方法的研究[J].计算机工程与应用,2014,50(18):118-121.
作者姓名:赵跃华  林聚伟
作者单位:江苏大学 计算机科学与通信工程学院,江苏 镇江 212013
摘    要:计算机反病毒厂商每天接收成千上万的病毒样本,如何快速有效地将这些海量样本家族化是一个亟待解决的问题。提出了一种可伸缩性的聚类方法,面对输入海量的病毒样本向量化特征集,使用局部敏感哈希索引技术进行初次快速聚类,使用扩展K均值算法进行二次细致聚类。实验表明该聚类方法在有限牺牲准确度的情况下,大为提高了病毒聚类的时间效率。

关 键 词:病毒家族  可伸缩性聚类  局部敏感哈希  扩展K均值  

Research on familial clustering of massive malware samples
ZHAO Yuehua,LIN Juwei.Research on familial clustering of massive malware samples[J].Computer Engineering and Applications,2014,50(18):118-121.
Authors:ZHAO Yuehua  LIN Juwei
Affiliation:School of Computer Science and Telecommunication Engineering,Jiangsu University,Zhenjiang,Jiangsu 212013,China
Abstract:Anti-malware companies receive thousands of malware samples every day, so it becomes more and more pressing to handle these samples timely and effectively. A scalable clustering approach is proposed to group these massive malware samples. LSH algorithm is used to cluster samples rapidly. Extended K-means algorithm is employed to perform accurately clustering. Experimental results show that this approach can improve malware clustering efficiency observably at the cost of little accuracy.
Keywords:malware family  scalable clustering  Locality Sensitive Hash(LSH)algorithm  extended K-means
本文献已被 CNKI 维普 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号