文件名称:alternative-ncd-lzjd
下载1 (586.29kb)
别用迅雷、360浏览器下载。
如迅雷强制弹出，可右键点击选“另存为”。
失败请重下，重下不扣分。
如迅雷强制弹出，可右键点击选“另存为”。
失败请重下，重下不扣分。
介绍说明－－下载内容均来自于网络，请自行研究使用
The Normalized Compression Distance (NCD) has been used in
a number of domains to compare objects with varying feature
types. This exibility comes from the use of general purpose compression algorithms as the means of computing distances between
byte sequences. Such exibility makes NCD particularly attractive
for cases where the right features to use are not obvious, such as
malware classication. However, NCD can be computationally demanding, thereby restricting the scale at which it can be applied.
We introduce an alternative metric also inspired by compression,
the Lempel-Ziv Jaccard Distance (LZJD). We show that this new
distance has desirable theoretical properties, as well as comparable
or superior performance for malware classication, while being
easy to implement and orders of magnitude faster in practice
a number of domains to compare objects with varying feature
types. This exibility comes from the use of general purpose compression algorithms as the means of computing distances between
byte sequences. Such exibility makes NCD particularly attractive
for cases where the right features to use are not obvious, such as
malware classication. However, NCD can be computationally demanding, thereby restricting the scale at which it can be applied.
We introduce an alternative metric also inspired by compression,
the Lempel-Ziv Jaccard Distance (LZJD). We show that this new
distance has desirable theoretical properties, as well as comparable
or superior performance for malware classication, while being
easy to implement and orders of magnitude faster in practice
(系统自动生成,下载前可以参看下载内容)
下载文件列表
压缩包 : alternative-ncd-lzjd.zip 列表 alternative-ncd-lzjd.pdf