发明名称 DETECTING AN ABNORMAL SUBSEQUENCE IN A DATA SEQUENCE
摘要 A method for detecting abnormal subsequences in data sequence includes constructing a hierarchical data structure of a target subsequence, each node in a bottommost layer of the data structure storing corresponding data of the target subsequence, and each node in a layer above the bottommost layer storing values based on data stored in corresponding nodes in a lower layer next to the layer above the bottommost layer; determining a second number of neighbors of the target subsequence based on the data structure of the target subsequence and of the first number of reference subsequences constructed in advance, the second number of neighbors having minimum Euclidean distances from the target subsequence; determining a third number of neighbors of each reference subsequence in the second number of reference subsequences, which have minimum Euclidean distances from each reference subsequence and determining whether the target subsequence is an abnormal subsequence.
申请公布号 US2015212868(A1) 申请公布日期 2015.07.30
申请号 US201514598843 申请日期 2015.01.16
申请人 International Business Machines Corporation 发明人 Chen Xiao Yan;Chen Yao Liang;Huang Sheng;Liu Kai;Wang Chen
分类号 G06F11/07 主分类号 G06F11/07
代理机构 代理人
主权项 1. A method for detecting an abnormal subsequence in a data sequence, the data sequence including a target subsequence to be detected and a first number of reference subsequences, the method comprising: constructing, with a processing device, a hierarchical data structure of the target subsequence, each node in a bottommost layer of the hierarchical data structure storing corresponding data of the target subsequence, and each node in a layer above the bottommost layer storing values derived based on data stored in corresponding nodes in a lower layer next to the layer above the bottommost layer; determining a second number of neighbors of the target subsequence based on the hierarchical data structure of the target subsequence and hierarchical data structures of the first number of reference subsequences constructed in advance, the second number of neighbors of the target subsequence being the second number of reference subsequences, which have minimum Euclidean distances from the target subsequence, in the first number of reference subsequences; determining a third number of neighbors of each reference subsequence in the second number of reference subsequences, the third number of neighbors being the third number of subsequences, which have minimum Euclidean distances from the each reference subsequence, in the data sequence; and determining whether the target subsequence is an abnormal subsequence, according to the second number of neighbors of the target subsequence, and the third number of neighbors of a reference subsequence, which has the target subsequence as a neighbor thereof, in the second number of reference subsequences.
地址 Armonk NY US