Ranking cybersecurity alerts from multiple sources using machine learning

Information

  • Patent Grant
  • 11956253
  • Patent Number
    11,956,253
  • Date Filed
    Friday, April 23, 2021
    3 years ago
  • Date Issued
    Tuesday, April 9, 2024
    9 months ago
Abstract
The present disclosure relates to a machine-learning system, method, and computer program for ranking security alerts from multiple sources. The system self-learns risk levels associated with alerts by calculating risk probabilities for the alerts based on characteristics of the alerts and historical alert data. In response to receiving a security alert from one of a plurality of alert-generation sources, the alert-ranking system evaluates the security alert with respect to a plurality of feature indicators. The system creates a feature vector for the security alert based on the feature indicator values identified for the alert. The system then calculates a probability that the security alert relates to a cybersecurity risk in the computer network based on the created feature vector and historical alert data in the network. The system ranks alerts from a plurality of different sources based on the calculated cybersecurity risk probabilities.
Description
BACKGROUND OF THE INVENTION
1. Field of the Invention

This invention relates generally to cybersecurity analytics in computer networks, and, more specifically, to ranking cybersecurity alerts from multiple sources using machine learning.


2. Description of the Background Art

Organizations are faced with the ever-increasing risks from security threats. Some cyberattacks are perpetrated by outsiders, while others involve insiders. Organizations typically run various cybersecurity products from different vendors. For example, one vendor may detect for malware installed on user devices, and another vendor may model and analyze user behavior to detect anomalies. Each of the different products generate alerts when a suspicious activity for which they are monitoring occurs. For a large organization with many employees, this can result in a large volume of alerts on a daily basis.


The analysts (e.g., Tier-1 analysts, Tier-3 analysts) that process these security alerts are often overwhelmed by the number of alerts. Because of the high volume of alerts, they are not able to quickly decide which alerts are not interesting and which are worthy of further investigation. A cybersecurity analyst may face over 10,000 alerts in a month and over half of them may be false positives. At many organizations, a significant percentage (e.g., 25-75%) of alerts are simply ignored because the organization cannot keep up with the alert volume. Therefore, there is demand for a system that ranks alerts from different sources so that analysts can prioritizes their attentions and focus on the alerts most likely to relate to a malicious event in the network. Such a system would greatly improve the efficiency of these analysts and enable the analysts to better monitor for cybersecurity risks.


SUMMARY OF THE DISCLOSURE

The present disclosure relates to a machine-learning system, method, and computer program for ranking cybersecurity alerts from multiple alert-generation sources in a network. The system uses past alert data to self-learn risk levels associated with alerts from different sources. Specifically, as described in more detail below, for each alert, the system calculates the probability that the alert is a cybersecurity risk based on characteristics of the alert and historical alert data from the various alert-generation sources in the network being monitored.


Multiple network-monitoring applications generate security alerts, which are received by the alert ranking system. In response to receiving a security alert from one of a plurality of alert-generation sources, the alert-ranking system evaluates the security alert with respect to a plurality of feature indicators. The system identifies values for the feature indicators with respect to the alert, and creates a feature vector representation of the alert based on the identified values. The system then calculates a probability that the security alert relates to a cybersecurity risk in the computer network based on the created feature vector and historical alert data in the network. In certain embodiments, the calculated risk probability is a Bayes probability calculated as a function of the probability of seeing the feature vector with respect to a cybersecurity risk and the probability of seeing the feature vector with respect to legitimate or low-interest activity.


A risk probability is calculated for each alert received, and the system ranks the security alerts based on the calculated risk probabilities. The ranked list includes alerts from a plurality of different network-monitoring applications, therefore providing cybersecurity analysts with a unified alert ranking system.





BRIEF DESCRIPTION OF THE FIGURES


FIG. 1 is a flowchart that illustrates a method, according to one embodiment, for ranking computer network security alerts from multiple alert-generation sources.



FIG. 2 is a table that illustrates example feature indicators for security alerts.



FIG. 3 is a table that illustrates an example ranking of security alerts.



FIG. 4 is a block diagram that illustrates an example software architecture for a cybersecurity alert-ranking system.





DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

The present disclosure describes a machine-learning system, method, and computer program for ranking security alerts. The method is performed by a computer system that receives security alerts for a computer network monitored for cybersecurity risks and attacks (“the system”). The system learns from past data to rank alerts. As described in more detail below, the system creates a feature vector representation of each incoming alert, and then calculates the probability that malicious activity has occurred given the feature vector and past alert data. The calculated probability is used to rank the alert.



FIG. 1 illustrates a method for ranking computer network security alerts from multiple sources. The illustrated method is described in more detail below.


1. Evaluating a Security Alert with Respect to Feature Indicators


The system receives a security alert for a computer network from one of a plurality of alert-generation sources (step 110). Alerts are generated by various sources within the monitored computer network. Example sources are third-party security product vendors that produce data loss prevention alerts, web traffic alerts, and endpoint malware alerts, etc. In other cases, an alert may be generated by a user behavior analytics (UBA) or a user and entity behavior analytics (UEBA) system. An example of a UBA/UEBA cybersecurity monitoring system is described in U.S. Pat. No. 9,798,883 issued on Oct. 24, 2017 and titled “System, Method, and Computer Program for Detecting and Assessing Security Risks in a Network,” the contents of which are incorporated by reference herein.


The system evaluates the security alert with respect to multiple feature indicators and identifies values for the feature indicators with respect to the alert (step 120). The feature indicators represent features of an alert or context information for an alert. For some feature indicators, the system may determine whether the feature indictor evaluates to true or false with respect to the alert. In such cases, the value of the feature indicator with respect to the alert may be a Boolean data type corresponding to true or false. For other feature indicators, the value may be a numerical value within a range (e.g., an number representing a severity level) or a text string (e.g., the alert type or name). The table in FIG. 2 lists nine example feature indicators and the corresponding values for which the feature indicators are evaluated, but these are just examples and invention is not limited to these feature indicators.


2. Creating a Feature Vector Representation of the Alert


The system creates a feature vector representation of the alert (step 130). Specifically, the system creates a feature vector for the alert that includes the evaluated values for feature indicators with respect to the alert. Let {right arrow over (f)}a=(f1, f2, . . . fi) denote a feature vector for an alert, where there are I feature indicators and fi is the value for the ith feature indicator.


3. Calculating a Probability that the Security Alert Relates to a Cybersecurity Risk.


The system calculates a probability that that security alert relates to a cybersecurity risk (i.e., to malicious activity in the network) based on the alert's feature vector and the historical alert data for the monitored network (step 140) In one embodiment, the risk probability is a Bayes probability calculated as a function of the probability of seeing the feature vector with respect to a cybersecurity risk and the probability of seeing the feature vector with respect to legitimate activity. Specifically, the probability may be calculated by the system as follows.







P

(

M




"\[LeftBracketingBar]"



f
a





)

=



P

(



f
a







"\[LeftBracketingBar]"

M


)



P

(
M
)





P

(



f
a







"\[LeftBracketingBar]"

M


)



P

(
M
)


+


P

(



f
a







"\[LeftBracketingBar]"

L


)



P

(
L
)










    • Where:

    • P(M|{right arrow over (f)}a) is the posterior probability that the alert relates to a cybersecurity risk given the feature vector {right arrow over (f)}a;

    • P({right arrow over (f)}a|L) is the likelihood of observing the feature vector in connection with legitimate or low-interest activity. The system learns P({right arrow over (f)}a|L) based on the features observed in past alerts. In one embodiment, P({right arrow over (f)}a|L) is a function of how often {right arrow over (f)}a has been observed in the monitored network and is the calculated by the system as follows:










P

(



f
a







"\[LeftBracketingBar]"

L


)

=


count


of


observed


alerts


each


with




f
a





count


of


all


observed


alerts








    • P({right arrow over (f)}a|M) is the likelihood of observing the feature vector in connection with a cybersecurity risk (i.e., in connection with malicious activity in the monitored network). In one embodiment, P({right arrow over (f)}a|M) is assumed to be uniform in which case can be calculated by the system as follows:










P

(



f
a







"\[LeftBracketingBar]"

M


)

=

1

number


of


distinct




f
a











    • P(M) is the a-priori probability of a cybersecurity risk. P(L) is the a-priori probability of a legitimate or low-interest activity. In one embodiment, P(M) and P(L) are set to the value 0.5.





Computationally it may not be practical for the system to calculate P({right arrow over (f)}a|L) and P({right arrow over (f)}a|M) based on joint modeling of all the feature indicators. For example, in the case of the feature indictors in the table in FIG. 2, “fOrg,” “fDev,” “nNewDev7d,” “nVendor7d” are binary features, each with a true/false values. Therefore, the total number of feature values is small, or at most 24 possible scenarios. However, the feature indicators “alert_type” and “alert_name” may have 10 or 20 different values. If the features are modeled jointly, there are 24*10*10 possible scenarios (assuming 10 different values for each), which requires a significant amount of data volume to calculate P({right arrow over (f)}a|L) and ({right arrow over (f)}a|M).


It is more computationally efficient to divide fa into two or more subsets, calculate P({right arrow over (f)}a|L) and P({right arrow over (f)}a|M) for each subset, and then calculate the product of the probabilities for each subset. This can be denoted mathematically as follows:










P


(



f
a







"\[LeftBracketingBar]"

L


)


=




j
=
1

J


P


(



g


i





"\[LeftBracketingBar]"

L


)











P


(



f
a







"\[LeftBracketingBar]"

M


)


=




j
=
1

J


P

(



g


i





"\[LeftBracketingBar]"

M


)



)







Where there are J conditional independent groups {right arrow over (g)}i, each consisting of a non-overlapping subset of features fa, and where P({right arrow over (g)}i|L) and P({right arrow over (g)}i|M) are calculated by the system as follows:











P


(



g


i





"\[LeftBracketingBar]"

L




)

=


count


of


observed


alerts


each


with




g


i



count


of


all


observed


alerts









P


(



g


i





"\[LeftBracketingBar]"

M


)


=

1

number


of


distinct








g


i










The groups may be divided based on which feature indicators are considered probabilistically independent of each other, such that each group is probabilistically independent of the other groups with respect to P({right arrow over (g)}i|L) and P({right arrow over (g)}i|M). For example, for the feature indicators listed in FIG. 2, the features 1-5 may be a first group, features 6-7 may be a second group, feature 8 may be a third singleton group, and feature 9 may be a fourth singleton group.


In certain embodiments, instead of assuming P({right arrow over (g)}i|M) is uniform, human knowledge can be injected to influence the risk rankings. For example, if {right arrow over (g)}={alert_type} and we know a priori that alerts with alert_type=“web attack” are not a good malicious indicator, then an administrator of the system can set P(alert_type=‘web attack’|M) to a smaller number than the rest of the P(alert_Type|M) likelihoods.


In one embodiment, the system profiles alert data in a monitored computer network for a number of days (e.g., 7 days) prior to calculating the risk probabilities and ranking security alerts. Since the probabilities are based in part on alert history in the monitored network, this helps optimize the probability calculations.


4. Ranking Security Alerts Based on the Calculated Risk Probabilities


In one embodiment, the above-described steps are performed for each security alert received by the system to calculate a risk probability for each alert (step 150). The system ranks the security alerts based on the risk probabilities and displays the ranked alerts (steps 160-170). The alerts are preferably ranked and displayed in descending order of risk probability (i.e., highest-risk alerts are ranked highest and displayed at the top of the list). The ranked list may be limited to alerts received within a certain time period (e.g., a 24 hour window).



FIG. 3 illustrates an example of the displayed ranking in which the feature indicators are the same as those listed in the table in FIG. 2. The display includes the feature indicator values for the ranked alerts. Displaying the feature indicator values for the alert enables an analyst to easily see the features associated with high-ranking alerts. For example, the highest-ranked alert in FIG. 3 has alert_name “Hacktool.Jsprat” with alert_type “Security risk found” and the alert has the following features:

    • the first-time-seen-in-org is True (i.e., First_Org is true);
    • first-time-seen-in-device is True (i.e., First_Source is true);
    • the feature for having more than its source device+vendor tuple sees>=2 alert_types returns True (i.e., nAlertType7d is true); and
    • the alert_type is ‘Security risk found”.


In certain embodiments, the system determines the risk probability for each alert in substantially real time as alerts are received by the system, and updates the displayed ranking in substantially real time as new alerts are received by the system.


5. Example Software Architecture



FIG. 4 illustrates an example software architecture for a system 400 that performs the methods described herein. However, the methods described herein may be implemented in other systems and are not limited to system 400. An Alert Receiver module 410 receives (or retrieves) alerts generated by a plurality of different alert generation sources 405a-d. The Alert Feature Evaluator model 420 evaluates alerts with respect to a set of feature indicators and determines feature indicator values for each alert. Feature Vector Creation module 430 creates a feature vector for each alert using the feature indicator values for the alert. The Risk Probability Calculator module 440 calculates a probability that an alert relates to a cybersecurity risk based on the alert's feature vector and historical alert data. The Alert Ranking module 450 ranks alerts based on the risk probabilities calculated for the alerts. The UI Generator module 460 generates a user interface that displays alert rankings, such as the top ranked alerts.


6. General


The methods described herein are embodied in software and performed by a computer system (comprising one or more computing devices) executing the software. A person skilled in the art would understand that a computer system has one or more memory units, disks, or other physical, computer-readable storage media for storing software instructions, as well as one or more processors for executing the software instructions.


As will be understood by those familiar with the art, the invention may be embodied in other specific forms without departing from the spirit or essential characteristics thereof. Accordingly, the above disclosure is intended to be illustrative, but not limiting, of the scope of the invention.

Claims
  • 1. A method, performed by a computer system, for ranking computer network security alerts from multiple sources, the method comprising: (a) receiving a security alert from one of a plurality of alert-generation sources in a computer network;(b) evaluating the security alert with respect to a plurality of feature indicators to obtain feature indicator values for the security alert;(c) creating a feature vector for the security alert that includes the feature indicator values for the security alert;(d) calculating a probability that the security alert relates to a cybersecurity risk in the computer network based on the created feature vector and historical alert data in the network, wherein the probability is a Bayes probability calculated as a function of the probability of seeing the feature vector with respect to a cybersecurity risk and the probability of seeing the feature vector with respect to legitimate or low-interest activity, wherein calculating the probability of seeing the feature vector with respect to a cybersecurity risk and the probability of seeing the feature vector with respect to legitimate or low-interest activity comprises: dividing the feature vector for the alert into a plurality of non-overlapping subsets to create a plurality of subset feature vectors, for each subset feature vector, calculating a probability of seeing the subset feature vector with respect to a cybersecurity risk and a probability of seeing the subset feature vector with respect to legitimate or low-interest activity, and calculating the product of the probabilities calculated for the subset feature vectors to obtain the probability of seeing the feature vector with respect to a cybersecurity risk and the probability of seeing the feature vector with respect to legitimate or low-interest activity;(e) performing steps (a)-(d) for a plurality of security alerts from the plurality of alert-generation sources;(f) ranking the security alerts based on the calculated probabilities; and(g) displaying the ranked security alerts, wherein the alert ranking includes alerts from a plurality of alert-generation sources.
  • 2. The method of claim 1, wherein displaying the alert ranking includes displaying the values of the feature indicators for the ranked alerts.
  • 3. The method of claim 1, wherein the risk probability for alerts is calculated in substantially real time as alerts are received by the system, and wherein the alert ranking is updated in substantially real time as new alerts are received by the system.
  • 4. A non-transitory computer-readable medium comprising a computer program, that, when executed by a computer system, enables the computer system to perform the following method for ranking computer network security alerts from multiple sources, the method comprising: (a) receiving a security alert from one of a plurality of alert-generation sources in a computer network;(b) evaluating the security alert with respect to a plurality of feature indicators to obtain feature indicator values for the security alert;(c) creating a feature vector for the security alert that includes the feature indicator values for the security alert;(d) calculating a probability that the security alert relates to a cybersecurity risk in the computer network based on the created feature vector and historical alert data in the network, wherein the probability is a Bayes probability calculated as a function of the probability of seeing the feature vector with respect to a cybersecurity risk and the probability of seeing the feature vector with respect to legitimate or low-interest activity, wherein calculating the probability of seeing the feature vector with respect to a cybersecurity risk and the probability of seeing the feature vector with respect to legitimate or low-interest activity comprises: dividing the feature vector for the alert into a plurality of non-overlapping subsets to create a plurality of subset feature vectors, for each subset feature vector, calculating a probability of seeing the subset feature vector with respect to a cybersecurity risk and a probability of seeing the subset feature vector with respect to legitimate or low-interest activity, and calculating the product of the probabilities calculated for the subset feature vectors to obtain the probability of seeing the feature vector with respect to a cybersecurity risk and the probability of seeing the feature vector with respect to legitimate or low-interest activity;(e) performing steps (a)-(d) for a plurality of security alerts from the plurality of alert-generation sources;(f) ranking the security alerts based on the calculated probabilities; and(g) displaying the ranked security alerts, wherein the alert ranking includes alerts from a plurality of alert-generation sources.
  • 5. The non-transitory computer-readable medium of claim 4, wherein displaying the alert ranking includes displaying the values of the feature indicators for the ranked alerts.
  • 6. The non-transitory computer-readable medium of claim 4, wherein the risk probability for alerts is calculated in substantially real time as alerts are received by the system, and wherein the alert ranking is updated in substantially real time as new alerts are received by the system.
  • 7. A computer system for ranking computer network security alerts from multiple sources, the system comprising: one or more processors;one or more memory units coupled to the one or more processors, wherein the one or more memory units store instructions that, when executed by the one or more processors, cause the system to perform the operations of: (a) receiving a security alert from one of a plurality of alert-generation sources in a computer network;(b) evaluating the security alert with respect to a plurality of feature indicators to obtain feature indicator values for the security alert;(c) creating a feature vector for the security alert that includes the feature indicator values for the security alert;(d) calculating a probability that the security alert relates to a cybersecurity risk in the computer network based on the created feature vector and historical alert data in the network, wherein the probability is a Bayes probability calculated as a function of the probability of seeing the feature vector with respect to a cybersecurity risk and the probability of seeing the feature vector with respect to legitimate or low-interest activity, wherein calculating the probability of seeing the feature vector with respect to a cybersecurity risk and the probability of seeing the feature vector with respect to legitimate or low-interest activity comprises: dividing the feature vector for the alert into a plurality of non-overlapping subsets to create a plurality of subset feature vectors, for each subset feature vector, calculating a probability of seeing the subset feature vector with respect to a cybersecurity risk and a probability of seeing the subset feature vector with respect to legitimate or low-interest activity, and calculating the product of the probabilities calculated for the subset feature vectors to obtain the probability of seeing the feature vector with respect to a cybersecurity risk and the probability of seeing the feature vector with respect to legitimate or low-interest activity;(e) performing steps (a)-(d) for a plurality of security alerts from the plurality of alert-generation sources;(f) ranking the security alerts based on the calculated probabilities; and(g) displaying the ranked security alerts, wherein the alert ranking includes alerts from a plurality of alert-generation sources.
  • 8. The system of claim 7, wherein displaying the alert ranking includes displaying the values of the feature indicators for the ranked alerts.
  • 9. The system of claim 7, wherein the risk probability for alerts is calculated in substantially real time as alerts are received by the system, and wherein the alert ranking is updated in substantially real time as new alerts are received by the system.
RELATED APPLICATIONS

This application claims the benefit of U.S. Provisional Application No. 63/039,347, filed on Jun. 15, 2020 and titled “Ranking Security Alerts from Multiple Sources Using Machine Learning,” the contents of which are incorporated by reference herein as if fully disclosed herein.

US Referenced Citations (173)
Number Name Date Kind
5941947 Brown et al. Aug 1999 A
6223985 DeLude May 2001 B1
6594481 Johnson et al. Jul 2003 B1
7181768 Ghosh et al. Feb 2007 B1
7624277 Simard et al. Nov 2009 B1
7668776 Ahles Feb 2010 B1
8326788 Allen et al. Dec 2012 B2
8443443 Nordstrom et al. May 2013 B2
8479302 Lin Jul 2013 B1
8484230 Harnett et al. Jul 2013 B2
8539088 Zheng Sep 2013 B2
8583781 Raleigh Nov 2013 B2
8606913 Lin Dec 2013 B2
8676273 Fujisake Mar 2014 B1
8850570 Ramzan Sep 2014 B1
8881289 Basavapatna et al. Nov 2014 B2
9055093 Borders Jun 2015 B2
9081958 Ramzan et al. Jul 2015 B2
9129110 Mason Sep 2015 B1
9185095 Moritz et al. Nov 2015 B1
9189623 Lin et al. Nov 2015 B1
9202052 Fang et al. Dec 2015 B1
9680938 Gil et al. Jun 2017 B1
9690938 Saxe et al. Jun 2017 B1
9692765 Choi et al. Jun 2017 B2
9760240 Maheshwari et al. Sep 2017 B2
9779253 Mahaffey et al. Oct 2017 B2
9798883 Gil et al. Oct 2017 B1
9843596 Averbuch et al. Dec 2017 B1
9898604 Fang et al. Feb 2018 B2
10063582 Feng et al. Aug 2018 B1
10095871 Gil et al. Oct 2018 B2
10178108 Lin et al. Jan 2019 B1
10354015 Kalchbrenner et al. Jul 2019 B2
10360387 Jou Jul 2019 B2
10397272 Bruss et al. Aug 2019 B1
10419470 Segev et al. Sep 2019 B1
10445311 Saurabh et al. Oct 2019 B1
10467631 Dhurandhar et al. Nov 2019 B2
10474828 Gil et al. Nov 2019 B2
10496815 Steiman et al. Dec 2019 B1
10621343 Maciejak et al. Apr 2020 B1
10645109 Lin et al. May 2020 B1
10685293 Heimann et al. Jun 2020 B1
10803183 Gil et al. Oct 2020 B2
10819724 Amiri et al. Oct 2020 B2
10841338 Lin et al. Nov 2020 B1
10887325 Lin et al. Jan 2021 B1
10944777 Lin et al. Mar 2021 B2
11017173 Lu et al. May 2021 B1
11080483 Islam et al. Aug 2021 B1
11080591 van den Oord et al. Aug 2021 B2
11140167 Lin et al. Oct 2021 B1
11151471 Niininen Oct 2021 B2
11178168 Lin et al. Nov 2021 B1
11245716 Roelofs et al. Feb 2022 B2
11423143 Lin et al. Aug 2022 B1
11431741 Lin et al. Aug 2022 B1
11625366 Steiman et al. Apr 2023 B1
20020107926 Lee Aug 2002 A1
20030065926 Schultz Apr 2003 A1
20030147512 Abburi Aug 2003 A1
20040073569 Knott et al. Apr 2004 A1
20060090198 Aaron Apr 2006 A1
20070156771 Hurley et al. Jul 2007 A1
20070282778 Chan et al. Dec 2007 A1
20080028467 Kommareddy et al. Jan 2008 A1
20080040802 Pierson et al. Feb 2008 A1
20080170690 Tysowski Jul 2008 A1
20080262990 Kapoor et al. Oct 2008 A1
20080301780 Ellison et al. Dec 2008 A1
20090144095 Shahi et al. Jun 2009 A1
20090171752 Galvin et al. Jul 2009 A1
20090292954 Jiang Nov 2009 A1
20090293121 Bigus et al. Nov 2009 A1
20100125911 Bhaskaran May 2010 A1
20100191763 Wu Jul 2010 A1
20100269175 Stolfo et al. Oct 2010 A1
20100284282 Golic Nov 2010 A1
20110167495 Antonakakis et al. Jul 2011 A1
20120278021 Lin et al. Nov 2012 A1
20120316835 Maeda et al. Dec 2012 A1
20120316981 Hoover et al. Dec 2012 A1
20130080631 Lin Mar 2013 A1
20130117554 Ylonen May 2013 A1
20130197998 Buhrmann et al. Aug 2013 A1
20130227643 Mccoog et al. Aug 2013 A1
20130268260 Lundberg et al. Oct 2013 A1
20130305357 Ayyagari et al. Nov 2013 A1
20130340028 Rajagopal et al. Dec 2013 A1
20140007238 Magee Jan 2014 A1
20140090058 Ward et al. Mar 2014 A1
20140101759 Antonakakis et al. Apr 2014 A1
20140315519 Nielsen Oct 2014 A1
20150026027 Priess et al. Jan 2015 A1
20150039543 Athmanathan et al. Feb 2015 A1
20150046969 Abuelsaad et al. Feb 2015 A1
20150100558 Fan Apr 2015 A1
20150121503 Xiong Apr 2015 A1
20150205944 Turgeman Jul 2015 A1
20150215325 Ogawa Jul 2015 A1
20150339477 Abrams et al. Nov 2015 A1
20150341379 Lefebvre et al. Nov 2015 A1
20150363691 Gocek et al. Dec 2015 A1
20160005044 Moss et al. Jan 2016 A1
20160021117 Harmon et al. Jan 2016 A1
20160063397 Ylipaavalniemi et al. Mar 2016 A1
20160292592 Patthak et al. Oct 2016 A1
20160306965 Iyer et al. Oct 2016 A1
20160364427 Wedgeworth, III Dec 2016 A1
20170019506 Lee et al. Jan 2017 A1
20170024135 Christodorescu et al. Jan 2017 A1
20170127016 Yu et al. May 2017 A1
20170155652 Most et al. Jun 2017 A1
20170161451 Weinstein et al. Jun 2017 A1
20170178026 Thomas et al. Jun 2017 A1
20170213025 Srivastav et al. Jul 2017 A1
20170236081 Grady Smith et al. Aug 2017 A1
20170264679 Chen et al. Sep 2017 A1
20170318034 Holland et al. Nov 2017 A1
20170323636 Xiao et al. Nov 2017 A1
20180004961 Gil et al. Jan 2018 A1
20180048530 Nikitaki et al. Feb 2018 A1
20180063168 Sofka Mar 2018 A1
20180069893 Amit et al. Mar 2018 A1
20180075343 van den Oord et al. Mar 2018 A1
20180089304 Vizer et al. Mar 2018 A1
20180097822 Huang et al. Apr 2018 A1
20180144139 Cheng et al. May 2018 A1
20180157963 Salti et al. Jun 2018 A1
20180165554 Zhang et al. Jun 2018 A1
20180181883 Ikeda Jun 2018 A1
20180190280 Cui et al. Jul 2018 A1
20180234443 Wolkov et al. Aug 2018 A1
20180248895 Watson et al. Aug 2018 A1
20180285340 Murphy et al. Oct 2018 A1
20180288063 Koottayi et al. Oct 2018 A1
20180288086 Amiri et al. Oct 2018 A1
20180307994 Cheng et al. Oct 2018 A1
20180316701 Holzhauer Nov 2018 A1
20180322368 Zhang et al. Nov 2018 A1
20190014149 Cleveland et al. Jan 2019 A1
20190028496 Fenoglio et al. Jan 2019 A1
20190034641 Gil et al. Jan 2019 A1
20190066185 More et al. Feb 2019 A1
20190080225 Agarwal Mar 2019 A1
20190089721 Pereira et al. Mar 2019 A1
20190103091 Chen Apr 2019 A1
20190114419 Chistyakov et al. Apr 2019 A1
20190124045 Zong et al. Apr 2019 A1
20190132629 Kendrick May 2019 A1
20190149565 Hagi et al. May 2019 A1
20190171655 Psota et al. Jun 2019 A1
20190182280 La Marca et al. Jun 2019 A1
20190205750 Zheng et al. Jul 2019 A1
20190213247 Pala et al. Jul 2019 A1
20190244603 Angkititrakul et al. Aug 2019 A1
20190303703 Kumar et al. Oct 2019 A1
20190318100 Bhatia et al. Oct 2019 A1
20190334784 Kvernvik et al. Oct 2019 A1
20190349400 Bruss et al. Nov 2019 A1
20190378051 Widmann et al. Dec 2019 A1
20200021607 Muddu et al. Jan 2020 A1
20200021620 Purathepparambil et al. Jan 2020 A1
20200082098 Gil et al. Mar 2020 A1
20200228557 Lin et al. Jul 2020 A1
20200302118 Cheng et al. Sep 2020 A1
20200327886 Shalaby et al. Oct 2020 A1
20210089884 Macready et al. Mar 2021 A1
20210125050 Wang Apr 2021 A1
20210182612 Zeng et al. Jun 2021 A1
20210232768 Ling et al. Jul 2021 A1
20220006814 Lin et al. Jan 2022 A1
Non-Patent Literature Citations (19)
Entry
Bahnsen, Alejandro Correa “Classifying Phishing URLs Using Recurrent Neural Networks”, IEEE 2017.
Chen, Jinghui, et al., “Outlier Detection with Autoencoder Ensembles”, Proceedings of the 2017 SIAM International Conference on Data Mining, pp. 90-98.
Cooley, R., et al., “Web Mining: Information and Pattern Discovery on the World Wide Web”, Proceedings Ninth IEEE International Conference on Tools with Artificial Intelligence, Nov. 3-8, 1997, pp. 558-567.
DatumBox Blog, “Machine Learning Tutorial: The Naive Bayes Text Classifier”, DatumBox Machine Learning Blog and Software Development News, Jan. 2014, pp. 1-11.
Fargo, Farah “Resilient Cloud Computing and Services”, PHD Thesis, Department of Electrical and Computer Engineering, University of Arizona, 2015, pp. 1-115.
Freeman, David, et al., “Who are you? A Statistical Approach to Measuring User Authenticity”, NDSS, Feb. 2016, pp. 1-15.
Goh, Jonathan et al., “Anomaly Detection in Cyber Physical Systems using Recurrent Neural Networks”, IEEE 2017.
Guo, Diansheng et al., “Detecting Non-personal and Spam Users on Geo-tagged Twitter Network”, Transactions in GIS, 2014, pp. 370-384.
Ioannidis, Yannis, “The History of Histograms (abridged)”, Proceedings of the 29th VLDB Conference (2003), pp. 1-12.
Kim, Jihyun et al., “Long Short Term Memory Recurrent Neural Network Classifier for Intrusion Detection”, IEEE 2016.
Malik, Hassan, et al., “Automatic Training Data Cleaning for Text Classification”, 11th IEEE International Conference on Data Mining Workshops, 2011, pp. 442-449.
Mietten, Markus et al., “ConXsense-Automated Context Classification for Context-Aware Access Control”, Asia CCS'14, 2014, pp. 293-304.
Poh, Norman, et al., “EER of Fixed and Trainable Fusion Classifiers: A Theoretical Study with Application to Biometric Authentication Tasks”, Multiple Classifier Systems, MCS 2005, Lecture Notes in Computer Science, vol. 3541, pp. 1-11.
Shi, Yue et al., “Cloudlet Mesh for Securing Mobile Clouds from Intrusions and Network Attacks”, 2015 3rd IEEE International Conference on Mobile Cloud Computing, Services, and Engineering, pp. 109-118.
Taylor, Adrian et al., “Anomaly Detection in Automobile Control Network Data with Long Short-Term Memory Networks”, IEEE 2016.
Taylor, Adrian “Anomaly-Based Detection of Malicious Activity in In-Vehicle Networks”, Ph.D. Thesis, University of Ottawa 2017.
Wang, Alex Hai, “Don't Follow Me Spam Detection in Twitter”, International Conference on Security and Cryptography, 2010, pp. 1-10.
Wang, Shuhao et al., “Session-Based Fraud Detection in Online E-Commerce Transactions Using Recurrent Neural Networks”, 2017.
Zhang, Ke et al., “Automated IT System Failure Prediction: A Deep Learning Approach”, IEEE 2016.
Provisional Applications (1)
Number Date Country
63039347 Jun 2020 US