IP Library Granted Patent US 12,506,763
Granted Patent B1
US 12,506,763 · App. 18/141,190 · Granted Dec 23, 2025

System, method, and computer program for scoring and organizing evidence of cybersecurity threats from multiple data sources

Inventors: Derek Lin (San Mateo, CA); Carlos Bernal Valdez (Lawrenceville, GA)
Assignee: Exabeam, Inc.
H04L63/1433H04L63/1416H04L63/20
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 12,506,763
App. No.
18/141,190
Granted
Dec 23, 2025
Kind
B1
Abstract

The present disclosure relates to a system, method, and computer program for scoring and organizing evidence of cybersecurity threats from multiple data sources. The system receives potential evidence of cybersecurity threats from multiple different data sources, typically each with their own scoring scale. The system scores/rescores the incoming data items on a common scale based on a set of behavior indicators specific to each data stream. Threat paths are then identified and scored from the scored/rescored data from the different sources. In certain embodiments, the system alters the initial data item scores based on a set of prioritization weights that enables certain factors to be prioritized over other factors in assessing the cybersecurity risk associated with the data items. Likewise, in certain embodiments, the initial threat path scores are also altered based on another set of prioritization weights for threat paths. In certain embodiments, cases are automatically created for threat paths scores satisfying a case-creation threshold.

Claims (53)

1 . 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 scoring and organizing evidence of cybersecurity threats from multiple data sources, the method comprising:

receiving a plurality of data streams usable in cybersecurity evaluations, wherein the plurality of data streams is from a plurality of different sources;

applying a risk scoring process to the plurality of data streams to obtain detections from each data stream that are scored on a common scale based on a set of behavior indicators specific to each data stream, wherein a detection is a single piece of evidence indicating a potential security threat, and wherein the risk scoring process outputs a first risk score for each detection;

identifying a plurality of threat paths from the detections, wherein a threat path comprises one or more related detections;

calculating a first path score for each threat path based on the first risk scores for the detections in the threat path, wherein the first path score for at least one of the threat paths is based on the first risk scores of detections from different data streams;

evaluating each detection outputted by the scoring process to determine whether the detection should be categorized as a high-value detection by performing the following for each such detection:

applying a first score-modification function that includes a first set of prioritization weights to the risk score for the detection to obtain a second risk score for the detection;

determining whether the second risk score for the detection exceeds a first threshold; and

in response to the second risk score exceeding the first threshold, categorizing the detection as a high-value detection;

applying a second score-modification function that includes second set of prioritization weights to each first path score to generate a second path score for each threat path, wherein the second set of prioritization weights includes a weight corresponding to the number of high-value detections in the path;

evaluating the second path score against a case-creation threshold; and

creating a cybersecurity case for each threat path having a second path score exceeding the case-creation threshold.

2 . The non-transitory computer-readable medium of claim 1 , wherein the method is performed for a plurality of different customers, and wherein the first and second sets of prioritization weights are customizable by each customer.

3 . The non-transitory computer-readable medium of claim 1 , wherein identifying a threat path comprises:

identifying an attack technique associated with each detection;

classifying each of the detections with an attack tactic in an attack framework having a sequence of attack tactics, wherein the classification is based on the attack technique associated with the detection;

grouping the detections into tactic blocks, where each tactic block is associated with a start time, an end time, and an attack tactic;

constructing a graph of tactic blocks by directionally connecting blocks based on a time criterion, a tactic criterion, and a matching criterion related to one or more fields in the detections;

identifying one or more clusters of interconnected components in the graph of tactic blocks, wherein a cluster is a group of tactic blocks that are directionally coupled; and

for each of the clusters, identifying a threat path in the cluster.

4 . The non-transitory computer-readable medium of claim 3 , wherein the method further comprises categorizing each threat path with a known threat category based on the attack techniques in the threat path.

5 . The non-transitory computer-readable medium of claim 4 , further comprising performing a matching confidence calculation for the known threat categorization.

6 . The non-transitory computer-readable medium of claim 4 , wherein the second set of prioritization weights includes a weight related to the known threat category for a threat path.

7 . The non-transitory computer-readable medium of claim 1 , wherein the plurality of data streams includes a stream of log events and a stream of detections from a system associated with the source of the detections.

8 . The non-transitory computer-readable medium of claim 1 , wherein, for each detection, the first risk score is a probabilistic risk calculation based on the behavior indicators that evaluate to true for the detection and historical behavior data for the data stream from which the detection originates.

9 . A method, performed a computer system, for scoring and organizing evidence of cybersecurity threats from multiple data sources, the method comprising:

receiving a plurality of data streams usable in cybersecurity evaluations, wherein the plurality of data streams is from a plurality of different sources;

applying a risk scoring process to the plurality of data streams to obtain detections from each data stream that are scored on a common scale based on a set of behavior indicators specific to each data stream, wherein a detection is a single piece of evidence indicating a potential security threat, and wherein the risk scoring process outputs a first risk score for each detection;

identifying a plurality of threat paths from the detections, wherein a threat path comprises one or more related detections;

calculating a first path score for each threat path based on the first risk scores for the detections in the threat path, wherein the first path score for at least one of the threat paths is based on the first risk scores of detections from different data streams;

evaluating each detection outputted by the scoring process to determine whether the detection should be categorized as a high-value detection by performing the following for each such detection:

applying a first score-modification function that includes a first set of prioritization weights to the risk score for the detection to obtain a second risk score for the detection;

determining whether the second risk score for the detection exceeds a first threshold; and

in response to the second risk score exceeding the first threshold, categorizing the detection as a high-value detection;

applying a second score-modification function that includes second set of prioritization weights to each first path score to generate a second path score for each threat path, wherein the second set of prioritization weights includes a weight corresponding to the number of high-value detections in the path;

evaluating the second path score against a case-creation threshold; and

creating a cybersecurity case for each threat path having a second path score exceeding the case-creation threshold.

10 . The method of claim 9 , wherein the method is performed for a plurality of different customers, and wherein the first and second sets of prioritization weights are customizable by each customer.

11 . A computer system for scoring and organizing evidence of cybersecurity threats from multiple data 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:

receiving a plurality of data streams usable in cybersecurity evaluations, wherein the plurality of data streams is from a plurality of different sources;

applying a risk scoring process to the plurality of data streams to obtain detections from each data stream that are scored on a common scale based on a set of behavior indicators specific to each data stream, wherein a detection is a single piece of evidence indicating a potential security threat, and wherein the risk scoring process outputs a first risk score for each detection;

identifying a plurality of threat paths from the detections, wherein a threat path comprises one or more related detections;

calculating a first path score for each threat path based on the first risk scores for the detections in the threat path, wherein the first path score for at least one of the threat paths is based on the first risk scores of detections from different data streams;

evaluating each detection outputted by the scoring process to determine whether the detection should be categorized as a high-value detection by performing the following for each such detection:

applying a first score-modification function that includes a first set of prioritization weights to the risk score for the detection to obtain a second risk score for the detection;

determining whether the second risk score for the detection exceeds a first threshold; and

in response to the second risk score exceeding the first threshold, categorizing the detection as a high-value detection;

applying a second score-modification function that includes second set of prioritization weights to each first path score to generate a second path score for each threat path, wherein the second set of prioritization weights includes a weight corresponding to the number of high-value detections in the path;

evaluating the second path score against a case-creation threshold; and

creating a cybersecurity case for each threat path having a second path score exceeding the case-creation threshold.

12 . The system of claim 11 , wherein the method is performed for a plurality of different customers, and wherein the first and second sets of prioritization weights are customizable by each customer.

Assignments (2)
SECURITY INTEREST Recorded Jul 3, 2024
From: LOGRHYTHM, INC.; EXABEAM, INC.
To: 26N DL SERVICING LP, AS THE COLLATERAL AGENT
Reel/Frame 068105/0797 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 19, 2023
From: LIN, DEREK; VALDEZ, CARLOS BERNAL
To: EXABEAM, INC.
Reel/Frame 063706/0509 →
References Cited (234)
US 5941947A · Brown et al. · 1999 [cited by applicant]
US 6223985B1 · DeLude · 2001 [cited by applicant]
US 6594481B1 · Johnson et al. · 2003 [cited by applicant]
US 7181768B1 · Ghosh et al. · 2007 [cited by applicant]
US 7624277B1 · Simard et al. · 2009 [cited by applicant]
US 7668776B1 · Ahles · 2010 [cited by applicant]
US 8326788B2 · Allen et al. · 2012 [cited by applicant]
US 8443443B2 · Nordstrom et al. · 2013 [cited by applicant]
US 8479302B1 · Lin · 2013 [cited by applicant]
US 8484230B2 · Harnett et al. · 2013 [cited by applicant]
US 8539088B2 · Zheng · 2013 [cited by applicant]
US 8583781B2 · Raleigh · 2013 [cited by applicant]
US 8606913B2 · Lin · 2013 [cited by applicant]
US 8676273B1 · Fujisake · 2014 [cited by applicant]
US 8850570B1 · Ramzan · 2014 [cited by applicant]
US 8881289B2 · Basavapatna et al. · 2014 [cited by applicant]
US 9055093B2 · Borders · 2015 [cited by applicant]
US 9081958B2 · Ramzan et al. · 2015 [cited by applicant]
US 9129110B1 · Mason et al. · 2015 [cited by applicant]
US 9185095B1 · Moritz et al. · 2015 [cited by applicant]
US 9189623B1 · Lin et al. · 2015 [cited by applicant]
US 9202052B1 · Fang et al. · 2015 [cited by applicant]
US 9680938B1 · Gil et al. · 2017 [cited by applicant]
US 9690938B1 · Saxe et al. · 2017 [cited by applicant]
US 9692765B2 · Choi et al. · 2017 [cited by applicant]
US 9760240B2 · Maheshwari et al. · 2017 [cited by applicant]
US 9779253B2 · Mahaffey et al. · 2017 [cited by applicant]
US 9798883B1 · Gil et al. · 2017 [cited by applicant]
US 9832138B1 · Skalski et al. · 2017 [cited by applicant]
US 9843596B1 · Averbuch et al. · 2017 [cited by applicant]
US 9898604B2 · Fang et al. · 2018 [cited by applicant]
US 10063582B1 · Feng et al. · 2018 [cited by applicant]
US 10095871B2 · Gil et al. · 2018 [cited by applicant]
US 10178108B1 · Lin et al. · 2019 [cited by applicant]
US 10354015B2 · Kalchbrenner et al. · 2019 [cited by applicant]
US 10360387B2 · Jou et al. · 2019 [cited by applicant]
US 10397272B1 · Bruss et al. · 2019 [cited by applicant]
US 10419470B1 · Segev et al. · 2019 [cited by applicant]
US 10445311B1 · Saurabh et al. · 2019 [cited by applicant]
US 10467631B2 · Dhurandhar et al. · 2019 [cited by applicant]
US 10474828B2 · Gil et al. · 2019 [cited by applicant]
US 10496815B1 · Steiman et al. · 2019 [cited by applicant]
US 10621343B1 · Maciejak et al. · 2020 [cited by applicant]
US 10645109B1 · Lin et al. · 2020 [cited by applicant]
US 10685293B1 · Heimann et al. · 2020 [cited by applicant]
US 10803183B2 · Gil et al. · 2020 [cited by applicant]
US 10819724B2 · Amiri et al. · 2020 [cited by applicant]
US 10841338B1 · Lin et al. · 2020 [cited by applicant]
US 10887325B1 · Lin et al. · 2021 [cited by applicant]
US 10944777B2 · Lin et al. · 2021 [cited by applicant]
US 11017173B1 · Lu et al. · 2021 [cited by applicant]
US 11080483B1 · Islam et al. · 2021 [cited by applicant]
US 11080591B2 · van den Oord et al. · 2021 [cited by applicant]
US 11128600B2 · Bansal et al. · 2021 [cited by applicant]
US 11140167B1 · Lin et al. · 2021 [cited by applicant]
US 11151471B2 · Niininen et al. · 2021 [cited by applicant]
US 11178168B1 · Lin et al. · 2021 [cited by applicant]
US 11245716B2 · Roelofs et al. · 2022 [cited by applicant]
US 11423143B1 · Lin et al. · 2022 [cited by applicant]
US 11431741B1 · Lin et al. · 2022 [cited by applicant]
US 11463331B1 · Arlitt et al. · 2022 [cited by applicant]
US 11625366B1 · Steiman et al. · 2023 [cited by applicant]
US 11736527B1 · Durairaj et al. · 2023 [cited by applicant]
US 11843505B1 · Cruise et al. · 2023 [cited by applicant]
US 11956253B1 · Lin et al. · 2024 [cited by applicant]
US 12034732B2 · Lin et al. · 2024 [cited by applicant]
US 12063226B1 · Lin et al. · 2024 [cited by applicant]
US 12164402B1 · Xie et al. · 2024 [cited by applicant]
US 12368729B1 · Lin et al. · 2025 [cited by applicant]
US 20020107926A1 · Lee · 2002 [cited by applicant]
US 20030065926A1 · Schultz et al. · 2003 [cited by applicant]
US 20030147512A1 · Abburi · 2003 [cited by applicant]
US 20040073569A1 · Knott et al. · 2004 [cited by applicant]
US 20060090198A1 · Aaron · 2006 [cited by applicant]
US 20070156771A1 · Hurley et al. · 2007 [cited by applicant]
US 20070282778A1 · Chan et al. · 2007 [cited by applicant]
US 20080028467A1 · Kommareddy et al. · 2008 [cited by applicant]
US 20080040802A1 · Pierson et al. · 2008 [cited by applicant]
US 20080170690A1 · Tysowski · 2008 [cited by applicant]
US 20080262990A1 · Kapoor et al. · 2008 [cited by applicant]
US 20080301780A1 · Ellison et al. · 2008 [cited by applicant]
US 20090144095A1 · Shahi et al. · 2009 [cited by applicant]
US 20090171752A1 · Galvin et al. · 2009 [cited by applicant]
US 20090292954A1 · Jiang et al. · 2009 [cited by applicant]
US 20090293121A1 · Bigus et al. · 2009 [cited by applicant]
US 20100125911A1 · Bhaskaran · 2010 [cited by applicant]
US 20100191763A1 · Wu · 2010 [cited by applicant]
US 20100269175A1 · Stolfo et al. · 2010 [cited by applicant]
US 20100284282A1 · Golic · 2010 [cited by applicant]
US 20110167495A1 · Antonakakis et al. · 2011 [cited by applicant]
US 20120278021A1 · Lin et al. · 2012 [cited by applicant]
US 20120316835A1 · Maeda et al. · 2012 [cited by applicant]
US 20120316981A1 · Hoover et al. · 2012 [cited by applicant]
US 20130080631A1 · Lin · 2013 [cited by applicant]
US 20130086273A1 · Wray et al. · 2013 [cited by applicant]
US 20130117554A1 · Ylonen · 2013 [cited by applicant]
US 20130197998A1 · Buhrmann et al. · 2013 [cited by applicant]
US 20130227643A1 · Mccoog et al. · 2013 [cited by applicant]
US 20130268260A1 · Lundberg et al. · 2013 [cited by applicant]
US 20130305357A1 · Ayyagari et al. · 2013 [cited by applicant]
US 20130340028A1 · Rajagopal et al. · 2013 [cited by applicant]
US 20140007238A1 · Magee · 2014 [cited by applicant]
US 20140090058A1 · Ward et al. · 2014 [cited by applicant]
US 20140101759A1 · Antonakakis et al. · 2014 [cited by applicant]
US 20140315519A1 · Nielsen · 2014 [cited by applicant]
US 20140365418A1 · Grant · 2014 [cited by applicant]
US 20150026027A1 · Priess et al. · 2015 [cited by applicant]
US 20150039543A1 · Athmanathan et al. · 2015 [cited by applicant]
US 20150046969A1 · Abuelsaad et al. · 2015 [cited by applicant]
US 20150058993A1 · Choi · 2015 [cited by examiner]
US 20150100558A1 · Fan · 2015 [cited by applicant]
US 20150121503A1 · Xiong · 2015 [cited by applicant]
US 20150205944A1 · Turgeman · 2015 [cited by applicant]
US 20150215325A1 · Ogawa · 2015 [cited by applicant]
US 20150339477A1 · Abrams et al. · 2015 [cited by applicant]
US 20150341379A1 · Lefebvre et al. · 2015 [cited by applicant]
US 20150363691A1 · Gocek et al. · 2015 [cited by applicant]
US 20160005044A1 · Moss et al. · 2016 [cited by applicant]
US 20160021117A1 · Harmon et al. · 2016 [cited by applicant]
US 20160063397A1 · Ylipaavalniemi et al. · 2016 [cited by applicant]
US 20160292592A1 · Patthak et al. · 2016 [cited by applicant]
US 20160306965A1 · Iyer et al. · 2016 [cited by applicant]
US 20160364427A1 · Wedgeworth, III · 2016 [cited by applicant]
US 20170019506A1 · Lee et al. · 2017 [cited by applicant]
US 20170024135A1 · Christodorescu et al. · 2017 [cited by applicant]
US 20170127016A1 · Yu et al. · 2017 [cited by applicant]
US 20170155652A1 · Most et al. · 2017 [cited by applicant]
US 20170161451A1 · Weinstein et al. · 2017 [cited by applicant]
US 20170178026A1 · Thomas et al. · 2017 [cited by applicant]
US 20170213025A1 · Srivastav et al. · 2017 [cited by applicant]
US 20170223035A1 · Watanabe · 2017 [cited by applicant]
US 20170236081A1 · Grady Smith et al. · 2017 [cited by applicant]
US 20170264679A1 · Chen et al. · 2017 [cited by applicant]
US 20170318034A1 · Holland et al. · 2017 [cited by applicant]
US 20170322959A1 · Tidwell et al. · 2017 [cited by applicant]
US 20170323636A1 · Xiao et al. · 2017 [cited by applicant]
US 20180004961A1 · Gil et al. · 2018 [cited by applicant]
US 20180039699A1 · Wan et al. · 2018 [cited by applicant]
US 20180048530A1 · Nikitaki et al. · 2018 [cited by applicant]
US 20180063168A1 · Sofka · 2018 [cited by applicant]
US 20180069893A1 · Amit et al. · 2018 [cited by applicant]
US 20180075343A1 · van den Oord et al. · 2018 [cited by applicant]
US 20180089304A1 · Vizer et al. · 2018 [cited by applicant]
US 20180097822A1 · Huang et al. · 2018 [cited by applicant]
US 20180144139A1 · Cheng et al. · 2018 [cited by applicant]
US 20180157963A1 · Salti et al. · 2018 [cited by applicant]
US 20180165554A1 · Zhang et al. · 2018 [cited by applicant]
US 20180181883A1 · Ikeda · 2018 [cited by applicant]
US 20180190280A1 · Cui et al. · 2018 [cited by applicant]
US 20180234443A1 · Wolkov et al. · 2018 [cited by applicant]
US 20180248895A1 · Watson et al. · 2018 [cited by applicant]
US 20180285340A1 · Murphy et al. · 2018 [cited by applicant]
US 20180288063A1 · Koottayi et al. · 2018 [cited by applicant]
US 20180288086A1 · Amiri et al. · 2018 [cited by applicant]
US 20180307994A1 · Cheng et al. · 2018 [cited by applicant]
US 20180316701A1 · Holzhauer et al. · 2018 [cited by applicant]
US 20180322368A1 · Zhang et al. · 2018 [cited by applicant]
US 20190014149A1 · Cleveland et al. · 2019 [cited by applicant]
US 20190028496A1 · Fenoglio et al. · 2019 [cited by applicant]
US 20190034641A1 · Gil et al. · 2019 [cited by applicant]
US 20190066185A1 · More et al. · 2019 [cited by applicant]
US 20190080225A1 · Agarwal · 2019 [cited by applicant]
US 20190081957A1 · Thrash et al. · 2019 [cited by applicant]
US 20190089721A1 · Pereira et al. · 2019 [cited by applicant]
US 20190089727A1 · Mulchandani · 2019 [cited by examiner]
US 20190103091A1 · Chen · 2019 [cited by applicant]
US 20190114419A1 · Chistyakov et al. · 2019 [cited by applicant]
US 20190122078A1 · Ura et al. · 2019 [cited by applicant]
US 20190124045A1 · Zong et al. · 2019 [cited by applicant]
US 20190124093A1 · Sharma et al. · 2019 [cited by applicant]
US 20190132629A1 · Kendrick · 2019 [cited by applicant]
US 20190149565A1 · Hagi et al. · 2019 [cited by applicant]
US 20190164092A1 · Argyros et al. · 2019 [cited by applicant]
US 20190171655A1 · Psota et al. · 2019 [cited by applicant]
US 20190173804A1 · Nicas et al. · 2019 [cited by applicant]
US 20190182280A1 · La Marca et al. · 2019 [cited by applicant]
US 20190205750A1 · Zheng et al. · 2019 [cited by applicant]
US 20190207969A1 · Brown · 2019 [cited by applicant]
US 20190213247A1 · Pala et al. · 2019 [cited by applicant]
US 20190244603A1 · Angkititrakul et al. · 2019 [cited by applicant]
US 20190303703A1 · Kumar et al. · 2019 [cited by applicant]
US 20190318100A1 · Bhatia et al. · 2019 [cited by applicant]
US 20190334784A1 · Kvernvik et al. · 2019 [cited by applicant]
US 20190349400A1 · Bruss et al. · 2019 [cited by applicant]
US 20190378051A1 · Widmann et al. · 2019 [cited by applicant]
US 20190384762A1 · Hill et al. · 2019 [cited by applicant]
US 20200021607A1 · Muddu et al. · 2020 [cited by applicant]
US 20200021620A1 · Purathepparambil et al. · 2020 [cited by applicant]
US 20200034481A1 · Asplund et al. · 2020 [cited by applicant]
US 20200082098A1 · Gil et al. · 2020 [cited by applicant]
US 20200137104A1 · Hassanzadeh et al. · 2020 [cited by applicant]
US 20200177618A1 · Hassanzadeh et al. · 2020 [cited by applicant]
US 20200228557A1 · Lin et al. · 2020 [cited by applicant]
US 20200302118A1 · Cheng et al. · 2020 [cited by applicant]
US 20200327886A1 · Shalaby et al. · 2020 [cited by applicant]
US 20210081459A1 · Chung · 2021 [cited by applicant]
US 20210089884A1 · Macready et al. · 2021 [cited by applicant]
US 20210125050A1 · Wang · 2021 [cited by applicant]
US 20210126938A1 · Trost et al. · 2021 [cited by applicant]
US 20210133331A1 · Lipkis et al. · 2021 [cited by applicant]
US 20210182612A1 · Zeng et al. · 2021 [cited by applicant]
US 20210232768A1 · Ling et al. · 2021 [cited by applicant]
US 20210248240A1 · Comish et al. · 2021 [cited by applicant]
US 20210398043A1 · Lacey · 2021 [cited by applicant]
US 20220006814A1 · Lin et al. · 2022 [cited by applicant]
US 20220030017A1 · Infante-Lopez et al. · 2022 [cited by applicant]
US 20220076164A1 · Conort et al. · 2022 [cited by applicant]
US 20220147622A1 · Chesla · 2022 [cited by applicant]
US 20220232032A1 · Mo · 2022 [cited by examiner]
US 20220245093A1 · Batsakis et al. · 2022 [cited by applicant]
US 20220247776A1 · Hecht · 2022 [cited by applicant]
CN 116074058A · 2023 [cited by examiner]
WO WO2022151726A1 · 2022 [cited by examiner]
English language translation of Chinese Patent CN116074058 (12 pages) (Year: 2022). [cited by examiner]
English language translation of PCT Publication WO2022/151726 (51 pages) (Year: 2021). [cited by examiner]
Bahnsen, Alejandro Correa “Classifying Phishing URLs Using Recurrent Neural Networks”, IEEE 2017, 8 pages. [cited by applicant]
Chen, Jinghui, et al., “Outlier Detection with Autoencoder Ensembles”, Proceedings of the 2017 SIAM International Conference on Data Mining, pp. 90-98. [cited by applicant]
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. [cited by applicant]
DatumBox Blog, “Machine Learning Tutorial: The Naïve Bayes Text Classifier”, DatumBox Machine Learning Blog and Software Development News, Jan. 2014, pp. 1-11. [cited by applicant]
Fargo, Farah “Resilient Cloud Computing and Services”, PHD Thesis, Department of Electrical and Computer Engineering, University of Arizona, 2015, pp. 1-115. [cited by applicant]
Freeman, David, et al., “Who are you? A Statistical Approach to Measuring User Authenticity”, NDSS, Feb. 2016, pp. 1-15. [cited by applicant]
Goh, Jonathan et al., “Anomaly Detection in Cyber Physical Systems using Recurrent Neural Networks”, IEEE 2017, pp. 140-145. [cited by applicant]
Guo, Diansheng et al., “Detecting Non-personal and Spam Users on Geo-tagged Twitter Network”, Transactions in GIS, 2014, pp. 370-384. [cited by applicant]
Ioannidis, Yannis, “The History of Histograms (abridged)”, Proceedings of the 29th VLDB Conference (2003), pp. 1-12. [cited by applicant]
Kim, Jihyun et al., “Long Short Term Memory Recurrent Neural Network Classifier for Intrusion Detection”, IEEE 2016, 5 pages. [cited by applicant]
Malik, Hassan, et al., “Automatic Training Data Cleaning for Text Classification”, 11th IEEE International Conference on Data Mining Workshops, 2011, pp. 442-449. [cited by applicant]
Mietten, Markus et al., “ConXsense-Automated Context Classification for Context-Aware Access Control”, ASIA CCS'14, 2014, pp. 293-304. [cited by applicant]
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… [cited by applicant]
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. [cited by applicant]
Taylor, Adrian et al., “Anomaly Detection in Automobile Control Network Data with Long Short-Term Memory Networks”, IEEE 2016, pp. 130-139. [cited by applicant]
Taylor, Adrian “Anomaly-Based Detection of Malicious Activity in In-Vehicle Networks”, Ph.D. Thesis, University of Ottawa 2017, 151 pages. [cited by applicant]
Wang, Alex Hai, “Don't Follow Me Spam Detection in Twitter”, International Conference on Security and Cryptography, 2010, pp. 1-10. [cited by applicant]
Wang, Shuhao et al., “Session-Based Fraud Detection in Online E-Commerce Transactions Using Recurrent Neural Networks”, 2017, 16 pages. [cited by applicant]
Zhang, Ke et al., “Automated IT System Failure Prediction: A Deep Learning Approach”, IEEE 2016, pp. 1291-1300. [cited by applicant]