Real-Time Change-Point Detection Using Sequentially Discounting Normalized Maximum Likelihood Coding

被引:0
|
作者
Urabe, Yasuhiro [1 ,2 ]
Yamanishi, Kenji [1 ]
Tomioka, Ryota [1 ]
Iwai, Hiroki [3 ]
机构
[1] Univ Tokyo, Bunkyo Ku, 7-3-1 Hongo, Tokyo 113, Japan
[2] Miyazaki Univ, Fac Med, Miyazaki, Japan
[3] Little EArth Corp Co Ltd, Chiyoda Ku, Tokyo, Japan
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We are concerned with the issue of real-time change-point detection in time series. This technology has recently received vast attentions in the area of data mining since it can be applied to a wide variety of important risk management issues such as the detection of failures of computer devices from computer performance data, the detection of masqueraders/malicious executables from computer access logs, etc. In this paper we propose a new method of real-time change point detection employing the sequentially discounting normalized maximum likelihood coding (SDNML). Here the SDNML is a method for sequential data compression of a sequence, which we newly develop in this paper. It attains the least code length for the sequence and the effect of past data is gradually discounted as time goes on, hence the data compression can be done adaptively to nonstationary data sources. In our method, the SDNML is used to learn the mechanism of a time series, then a change-point score at each time is measured in terms of the SDNML code-length. We empirically demonstrate the significant superiority of our method over existing methods, such as the predictive-coding method and the hypothesis testing-method, in terms of detection accuracy and computational efficiency for artificial data sets. We further apply our method into real security issues called malware detection. We empirically demonstrate that our method is able to detect unseen security incidents at significantly early stages.
引用
收藏
页码:185 / 197
页数:13
相关论文
共 50 条