IP Library Granted Patent US 9,843,596
Granted Patent B1
US 9,843,596 · App. 14/791,269 · Granted Dec 12, 2017

Anomaly detection in dynamically evolving data and systems

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 9,843,596
App. No.
14/791,269
Granted
Dec 12, 2017
Kind
B1
Abstract

Detection of abnormalities in multi-dimensional data is performed by processing the multi-dimensional data to obtain a reduced dimension embedding matrix, using the reduced dimension embedding matrix to form a lower dimension (of at least 2D) embedded space, applying an out-of-sample extension procedure in the embedded space to compute coordinates of a newly arrived data point and using the computed coordinates of the newly arrived data point and Euclidean distances to determine whether the newly arrived data point is normal or abnormal.

Claims (31)

1. A method, comprising:

a) obtaining a data set of network traffic comprising N-dimensional data points from a traffic analyzer, wherein N>3 and wherein the traffic analyzer is configured to generate a statistics matrix comprising the N-dimensional data points;

b) by a computer,

i. processing the statistics matrix into a Markov kernel matrix,

ii. processing the Markov kernel matrix to obtain processed data points with a dimension r lower than N, wherein the processing includes finding r discriminating eigenvectors by providing i=1, . . . , r eigenvalues and respective associated eigenvectors, generating for each i=2, . . . , r a respective i th cluster based on the i th eigenvector and generating other respective clusters based on eigenvectors 1, . . . , i−1, i+1, . . . , r, computing a distance between each respective i th cluster based on the i th eigenvector and each of the other respective clusters based on eigenvectors 1, . . . , i−1, i−1, . . . , r, and finding r eigenvalues and associated respective eigenvectors that provide the highest distance, the associated respective eigenvectors that provide the highest distance being the discriminating eigenvectors,

wherein the r discriminating eigenvectors thus found form an embedded space in which processed data points with a reduced dimension r form a normal cluster,

iii. detecting an abnormal data point in the processed data points with a dimension r lower than N without relying on a signature of a threat and without use of a threshold, and

iv. blocking the abnormal data point.

2. The method of claim 1 , further comprising receiving and processing a newly arrived N-dimensional data point into a newly-arrived data point with reduced dimension r, and wherein the detecting an abnormal data point in the processed data points with reduced dimension r includes determining that the newly-arrived data point with reduced dimension r resides outside the normal cluster.

3. The method of claim 2 , wherein the determining that the newly-arrived data point with reduced dimension r resides outside the normal cluster includes applying an out-of-sample extension (OOSE) procedure to the newly arrived N-dimensional data point with reduced dimension r to compute its coordinates in the embedded space and determining whether the newly arrived N-dimensional data point resides outside the normal cluster based on its computed coordinates.

4. The method of claim 3 , wherein the determining is based on a histogram of density values of embedded data points computed from the embedding matrix, wherein the histogram of density values is divided into bins of a given size and wherein the abnormal data point is included in a bin with the smallest size.

5. The method of claim 1 , wherein the detecting an abnormal data point in the processed data points with a dimension r further includes detecting the abnormal data point without tuning a method parameter.

6. The method of claim 1 , further comprising generating an alert on the abnormal data point.

7. The method of claim 6 , further comprising visualizing the abnormal data point.

8. The method of claim 7 , wherein the visualizing is two-dimensional or three-dimensional.

9. The method of claim 1 , further comprising generating an alert on the abnormal data point.

10. The method of claim 9 , further comprising visualizing the abnormal data point.

11. The method of claim 10 , wherein the visualizing is two-dimensional or three-dimensional.

12. The method of claim 2 , further comprising generating an alert on the abnormal data point.

13. The method of claim 12 , further comprising visualizing the abnormal data point.

14. The method of claim 13 , wherein the visualizing is two-dimensional or three-dimensional.

15. The method of claim 1 , wherein the traffic analyzer includes a communications network traffic analyzer.

16. The method of claim 1 , wherein the traffic analyzer includes a financial network traffic analyzer.

17. A system, comprising:

a) a traffic analyzer for providing a data set of network traffic comprising N-dimensional data points, wherein N>3 and wherein the traffic analyzer is configured to generate a statistics matrix comprising the N-dimensional data points; and

b) a computer program stored on a non-transitory computer readable medium, the computer program dedicated to:

i. process the statistics matrix into a Markov kernel matrix,

ii. process the Markov kernel matrix to obtain processed data points with a reduced dimension r lower than N by forming an embedded space defined by r discriminating eigenvectors, wherein r≦N and wherein the discriminating eigenvectors are selected by providing i=1, . . . , r eigenvalues and respective associated eigenvectors, and, for each i=2, . . . , r, by generating a respective i th cluster based on the i th eigenvector and other clusters based on eigenvectors 1, . . . , i−1, i+1, . . . , M, by computing a distance between each i th cluster and each of the other clusters, and by finding the r eigenvalues and their respective eigenvectors that provide the highest distance to define a normal cluster of processed data points with reduced dimension M,

iii detect an abnormal data point in the processed data points with reduced dimension r without relying on a signature of a threat and without use of a threshold, and

iv. block the abnormal data point.

18. The system of claim 17 , wherein the computer program is further dedicated to process a newly arrived N-dimensional data point into a newly-arrived data point with reduced dimension r, and to detect an abnormal data point in the processed data points with reduced dimension r by determining that the newly-arrived data point with reduced dimension r resides outside the normal cluster.

Assignments (5)
SECURITY INTEREST Recorded Jun 25, 2024
From: THETA RAY LTD
To: HSBC BANK PLC
Reel/Frame 067826/0839 →
SECURITY INTEREST Recorded Feb 21, 2023
From: THETA RAY LTD
To: SILICON VALLEY BANK
Reel/Frame 062752/0430 →
SECURITY INTEREST Recorded Dec 27, 2022
From: THETA RAY LTD
To: KREOS CAPITAL VI (EXPERT FUND) L.P.
Reel/Frame 062207/0011 →
SECURITY INTEREST Recorded Jun 30, 2021
From: THETARAY LTD.
To: KREOS CAPITAL VI (EXPERT FUND) L.P.
Reel/Frame 056711/0546 →
SECURITY INTEREST Recorded Oct 10, 2019
From: THETA RAY LTD
To: SILICON VALLEY BANK
Reel/Frame 050682/0517 →