IP Library Granted Patent US 12,710,981
Granted Patent B2
US 12,710,981 · App. 18/673,114 · Granted Aug 18, 2026

Swappable online artificial intelligence algorithms implemented in a data intake and query system

Inventor: Ram Sriharsha (Oakland, CA)
Assignee: Cisco Technology, Inc.
G06F9/4881G06F9/3885G06F9/3891G06F9/544G06F16/144G06F16/156G06F16/168G06F16/1734G06F16/2246G06F16/23G06F16/2379G06F16/242G06F16/24534G06F16/24568G06F16/2465G06F16/285G06F16/901G06F17/16G06F17/18G06F18/2148G06F18/2185G06N20/00G06N20/20G06F16/22G06F16/2264G06F16/2282
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,710,981
App. No.
18/673,114
Filed
May 23, 2024
Granted
Aug 18, 2026
Kind
B2
Examiner
LIN, ALLEN S
Art Unit
2153
USPC
707/776
Abstract

Systems and methods are described for processing ingested data, detecting anomalies in the ingested data, and providing explanations of a possible cause of the detected anomalies as the data is being ingested. For example, a token or field in the ingested data may have an anomalous value. Tokens or fields from another portion of the ingested data can be extracted and analyzed to determine whether there is any correlation between the values of the extracted tokens or fields and the anomalous token or field having an anomalous value. If a correlation is detected, this information can be surfaced to a user.

Claims (61)

1 . A method, comprising:

obtaining first raw machine data from an event data stream generated by one or more components in an information technology environment;

comparing, using a set of data, an accuracy of a first model and an accuracy of a second model by at least (i) comparing an output produced by the first model processing the set of data to an actual or expected output to generate a first data result being a first prediction of one or more values of the set of data, (ii) comparing an output produced by the second model processing the set of data to the actual or expected output to generate a second data result being a second prediction of the one or more values of the set of data, and (iii) comparing the first data result and the second data result to determine that the second model is more accurate with respect to the actual or expected output than the first model, wherein the first model is generated using a first artificial intelligence algorithm code, the first raw machine data, and a base model, and wherein the second model is generated using a second artificial intelligence algorithm code, the first raw machine data, and the base model;

responsive to determining that the second model is more accurate than the first model, obtaining second raw machine data from the event data stream generated by the one or more components in the information technology environment; and

processing the second raw machine data from the event data stream using the second model by swapping a portion of the first artificial intelligence algorithm code with a portion of the second artificial intelligence algorithm code,

wherein the second artificial intelligence algorithm code includes at least a second transformation operation and a second reference to a storage location of a model state of the second model and the first artificial intelligence algorithm code includes at least a first transformation operation and a reference to a storage location of a model state of the first model in lieu of variables defining the model state of the first model to avoid loss of the model state of the first model during swapping of the first artificial intelligence algorithm code for the second artificial intelligence algorithm code and avoid re-training of the second model using previously ingested raw machine data by the first artificial intelligence algorithm code, and

wherein the swapping of the portion of the first artificial intelligence algorithm code comprises swapping the first transformation operation with the second transformation operation in response to the determination that the second model is more accurate than the first model and the second artificial intelligence code utilizing the model state of the first model.

2 . The method of claim 1 , wherein the swapping of the portion of the first artificial intelligence algorithm code with the portion of the second artificial intelligence algorithm code further comprises swapping the first transformation operation with the second transformation operation in response to the determination that the second model is more accurate than the first model.

3 . The method of claim 1 , wherein the first model and the second model obtain the set of data from a source specified by a graph representing a data processing pipeline.

4 . The method of claim 1 , wherein the first model and the second model obtain the set of data from a source specified by a graph representing a data processing pipeline, and wherein a version of an output of the first model is written to an external storage system specified by the graph.

5 . The method of claim 1 , wherein the first model and the second model obtain the set of data from a source specified by a graph representing a data processing pipeline, wherein a version of an output of the first model is written to an external storage system specified by the graph, and wherein an output of the second model is not written to any external storage system until the second model is determined to be more accurate than the first model.

6 . The method of claim 1 , wherein the first model and the second model obtain the set of data from a source specified by a graph representing a data processing pipeline, wherein a version of an output of the first model is written to an external storage system specified by the graph, wherein an output of the second model is not written to any external storage system until the second model is determined to be more accurate than the first model, wherein comparing an accuracy of the first model and an accuracy of the second model further comprises:

determining, a time period after the second model is generated, whether to continue writing the version of the output of the first model to the external storage system or whether to begin writing a version of the output of the second model to the external storage system; and

comparing the accuracy of the first model and the accuracy of the second model to determine which version of output to write to the external storage system.

7 . The method of claim 1 , wherein comparing an accuracy of the first model and an accuracy of the second model further comprises:

obtaining a set of subsequent raw machine data being the set of data from the event data stream;

generating the output produced by the first model corresponding to one or more first predictions associated with the set of subsequent raw machine data in response to an application of the set of subsequent raw machine data as an input to the first model;

generating the output produced by the second model corresponding to one or more second predictions associated with the set of subsequent raw machine data in response to an application of the set of subsequent raw machine data as an input to the second model; and

comparing an accuracy of the one or more first predictions to the actual or expected output to an accuracy of the one or more second predictions to the actual or expected output.

8 . The method of claim 1 , wherein comparing an accuracy of the first model and an accuracy of the second model further comprises:

obtaining a set of subsequent raw machine data being the set of data from the event data stream that represents raw machine data obtained from the event stream over a threshold period of time;

generating the output produced by the first model corresponding to one or more first predictions associated with the set of subsequent raw machine data in response to an application of the set of subsequent raw machine data as an input to the first model;

generating the output produced by the second model corresponding to one or more second predictions associated with the set of subsequent raw machine data in response to an application of the set of subsequent raw machine data as an input to the second model; and

comparing an accuracy of the one or more first predictions to the actual or expected output to an accuracy of the one or more second predictions to the actual or expected output.

9 . The method of claim 1 , wherein comparing an accuracy of the first model and an accuracy of the second model further comprises comparing a loss associated with the first model corresponding to the first data result and a loss associated with the second model corresponding to the second data result.

10 . The method of claim 1 , further comprising:

obtaining a set of subsequent raw machine data being the set of data from the event data stream;

generating, in a production stack, the output produced by the first model corresponding to one or more first predictions associated with the set of subsequent raw machine data in response to an application of the set of subsequent raw machine data as an input to the first model;

generating, in a test stack separate from the production stack, the output produced by the second model corresponding to one or more second predictions associated with the set of subsequent raw machine data in response to an application of the set of subsequent raw machine data as an input to the second model; and

generating, in the production stack, a third prediction the third raw machine data and the second model.

11 . The method of claim 1 , wherein processing the second raw machine data from the event data stream using the second model further comprises:

swapping the first model with the second model in a production stack; and

processing the second raw machine data and subsequent raw machine data using the second model in the production stack.

12 . The method of claim 1 , wherein a data ingestion pipeline comprises an operator that implements the first artificial intelligence algorithm code, and wherein the method further comprises refreshing the data ingestion pipeline to replace the operator with a second operator that implements the second artificial intelligence algorithm code.

13 . The method of claim 1 , wherein a data ingestion pipeline comprises an operator that implements the first artificial intelligence algorithm code, and wherein the method further comprises:

refreshing the data ingestion pipeline to replace the operator with a second operator that implements the second artificial intelligence algorithm code; and

processing the second raw machine data and subsequent raw machine data in the data ingestion pipeline using the second operator.

14 . A system, comprising:

one or more data stores including computer-executable instructions; and

one or more processors configured to execute the computer-executable instructions, wherein execution of the computer-executable instructions causes the system to:

obtain first raw machine data from an event data stream generated by one or more components in an information technology environment;

compare, using a set of data, an accuracy of a first model and an accuracy of a second model by at least (i) comparing an output produced by the first model processing the set of data to an actual or expected output to generate a first data result being a first prediction of one or more values of the set of data, (ii) comparing an output produced by the second model processing the set of data to the actual or expected output to generate a second data result being a second prediction of the one or more values of the set of data, and (iii) comparing the first data result and the second data result to determine that the second model is more accurate with respect to the actual or expected output than the first model, wherein the first model is generated using a first artificial intelligence algorithm code, the first raw machine data, and a base model, and wherein the second model is generated using a second artificial intelligence algorithm code, the first raw machine data, and the base model;

responsive to determination that the second model is more accurate than the first model, obtain second raw machine data from the event data stream generated by the one or more components in the information technology environment; and

process the second raw machine data from the event data stream using the second model by swapping a portion of the first artificial intelligence algorithm code with a portion of the second artificial intelligence algorithm code,

wherein the second artificial intelligence algorithm code includes at least a second transformation operation and a second reference to a storage location of a model state of the second model and the first artificial intelligence algorithm code includes at least a first transformation operation and a reference to a storage location of a model state of the first model in lieu of variables defining the model state of the first model to avoid loss of the model state of the first model during swapping of the first artificial intelligence algorithm code for the second artificial intelligence algorithm code and avoid re-training of the second model using previously ingested raw machine data by the first artificial intelligence algorithm code, and

wherein the swapping of the portion of the first artificial intelligence algorithm code comprises swapping the first transformation operation with the second transformation operation in response to the determination that the second model is more accurate than the first model and the second artificial intelligence code utilizing the model state of the first model.

15 . The system of claim 14 , wherein the first artificial intelligence algorithm code further comprises a transformation operation and a reference to a storage location of a model state of the first model.

16 . The system of claim 14 , wherein a data ingestion pipeline comprises an operator that implements the first artificial intelligence algorithm code, and wherein execution of the computer-executable instructions further causes the system to:

refresh the data ingestion pipeline to replace the operator with a second operator that implements the second artificial intelligence algorithm code; and

process the second raw machine data and subsequent raw machine data in the data ingestion pipeline using the second operator.

17 . A non-transitory computer-readable media comprising instructions executable by one or more processors of a computing system to:

obtain first raw machine data from an event data stream generated by one or more components in an information technology environment;

compare, using a set of data, an accuracy of a first model and an accuracy of a second model by at least (i) comparing an output produced by the first model processing the set of data to an actual or expected output to generate a first data result being a first prediction of one or more values of the set of data, (ii) comparing an output produced by the second model processing the set of data to the actual or expected output to generate a second data result being a second prediction of the one or more values of the set of data, and (iii) comparing the first data result and the second data result to determine that the second model is more accurate with respect to the actual or expected output than the first model, wherein the first model is generated using a first artificial intelligence algorithm code, the first raw machine data, and a base model, and wherein the second model is generated using a second artificial intelligence algorithm code, the first raw machine data, and the base model;

determine that the second model is more accurate than the first model;

obtain second raw machine data from the event data stream generated by the one or more components in the information technology environment; and

process the second raw machine data from the event data stream using the second model by swapping a portion of the first artificial intelligence algorithm code with a portion of the second artificial intelligence algorithm code,

wherein the second artificial intelligence algorithm code includes at least a second transformation operation and a second reference to a storage location of a model state of the second model and the first artificial intelligence algorithm code includes at least a first transformation operation and a reference to a storage location of a model state of the first model in lieu of variables defining the model state of the first model to avoid loss of the model state of the first model during swapping of the first artificial intelligence algorithm code for the second artificial intelligence algorithm code and avoid re-training of the second model using previously ingested raw machine data by the first artificial intelligence algorithm code, and

wherein the swapping of the portion of the first artificial intelligence algorithm code comprises swapping the first transformation operation with the second transformation operation in response to the determination that the second model is more accurate than the first model and the second artificial intelligence code utilizing the model state of the first model.

18 . The non-transitory computer-readable media of claim 17 , wherein the swapping of the portion of the first artificial intelligence algorithm code with the portion of the second artificial intelligence algorithm code further comprises swapping the first transformation operation with the second transformation operation in response to the determination that the second model is more accurate than the first model.

19 . The non-transitory computer-readable media of claim 17 , wherein the first model and the second model obtain the set of data from a source specified by a graph representing a data processing pipeline.

20 . The non-transitory computer-readable media of claim 17 , wherein the first model and the second model obtain the set of data from a source specified by a graph representing a data processing pipeline, and wherein a version of an output of the first model is written to an external storage system specified by the graph.

Assignments (2)
CHANGE OF NAME Recorded Jul 22, 2025
From: SPLUNK INC.
To: SPLUNK LLC
Reel/Frame 072170/0599 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 22, 2025
From: SPLUNK LLC
To: CISCO TECHNOLOGY, INC.
Reel/Frame 072173/0058 →
Continuity (4)
Continuation 17874751 · Jul 27, 2022
Continuation 16779460 · Jan 31, 2020
Provisional Application 62923447 · Oct 18, 2019
Related Publication 20240320267A1 · Sep 26, 2024
References Cited (164)
US 6714941B1 · Lerman et al. · 2004 [cited by applicant]
US 7080046B1 · Rezvani et al. · 2006 [cited by applicant]
US 7937344B2 · Baum et al. · 2011 [cited by applicant]
US 8112425B2 · Baum et al. · 2012 [cited by applicant]
US 8135580B1 · Jin et al. · 2012 [cited by applicant]
US 8639650B1 · Gill · 2014 [cited by applicant]
US 8751529B2 · Zhang et al. · 2014 [cited by applicant]
US 8788525B2 · Neels et al. · 2014 [cited by applicant]
US 8855997B2 · Cai et al. · 2014 [cited by applicant]
US 9037528B2 · Helfman et al. · 2015 [cited by applicant]
US 9215240B2 · Merza et al. · 2015 [cited by applicant]
US 9262519B1 · Saurabh et al. · 2016 [cited by applicant]
US 9286413B1 · Coates et al. · 2016 [cited by applicant]
US 9760240B2 · Maheshwari et al. · 2017 [cited by applicant]
US 9838410B2 · Muddu et al. · 2017 [cited by applicant]
US 9843596B1 · Averbuch et al. · 2017 [cited by applicant]
US 10127258B2 · Lamas et al. · 2018 [cited by applicant]
US 10163063B2 · Chaturvedi et al. · 2018 [cited by applicant]
US 10235638B2 · Maheshwari et al. · 2019 [cited by applicant]
US 10367827B2 · Seward et al. · 2019 [cited by applicant]
US 10387236B2 · Gerstl et al. · 2019 [cited by applicant]
US 10409817B1 · Dias et al. · 2019 [cited by applicant]
US 10474680B2 · Ramani et al. · 2019 [cited by applicant]
US 10496817B1 · Furbish et al. · 2019 [cited by applicant]
US 10503348B2 · Maheshwari et al. · 2019 [cited by applicant]
US 10536353B2 · Gupta et al. · 2020 [cited by applicant]
US 10776719B2 · Maheshwari et al. · 2020 [cited by applicant]
US 11087263B2 · Boe et al. · 2021 [cited by applicant]
US 11106734B1 · Batsakis et al. · 2021 [cited by applicant]
US 11269939B1 · Sammer et al. · 2022 [cited by applicant]
US 11275768B2 · Salomon et al. · 2022 [cited by applicant]
US 11288283B2 · Chauhan et al. · 2022 [cited by applicant]
US 11294941B1 · Sammer et al. · 2022 [cited by applicant]
US 11388211B1 · Breeden et al. · 2022 [cited by applicant]
US 11442941B2 · Chamarajnagar · 2022 [cited by applicant]
US 11475024B2 · Sriharsha · 2022 [cited by applicant]
US 11577722B1 · Packer · 2023 [cited by examiner]
US 11599549B2 · Sriharsha · 2023 [cited by applicant]
US 11615101B2 · Sriharsha et al. · 2023 [cited by applicant]
US 11615102B2 · Sriharsha · 2023 [cited by applicant]
US 11620157B2 · Sriharsha et al. · 2023 [cited by applicant]
US 11620296B2 · Sriharsha · 2023 [cited by applicant]
US 11650968B2 · Nair et al. · 2023 [cited by applicant]
US 11663176B2 · Sriharsha et al. · 2023 [cited by applicant]
US 11677634B1 · Nookula · 2023 [cited by examiner]
US 11687438B1 · Torbett et al. · 2023 [cited by applicant]
US 11704490B2 · Sriharsha et al. · 2023 [cited by applicant]
US 11809492B2 · Sriharsha · 2023 [cited by applicant]
US 20050187962A1 · Grondin et al. · 2005 [cited by applicant]
US 20050243366A1 · Fukuda · 2005 [cited by applicant]
US 20070156786A1 · May et al. · 2007 [cited by applicant]
US 20090144123A1 · Malov · 2009 [cited by examiner]
US 20090144216A1 · Zhou et al. · 2009 [cited by applicant]
US 20110040733A1 · Sercinoglu et al. · 2011 [cited by applicant]
US 20110267964A1 · Baltatu et al. · 2011 [cited by applicant]
US 20120197896A1 · Li et al. · 2012 [cited by applicant]
US 20120246303A1 · Petersen et al. · 2012 [cited by applicant]
US 20130110895A1 · Valentino et al. · 2013 [cited by applicant]
US 20130166188A1 · Zheng et al. · 2013 [cited by applicant]
US 20130173218A1 · Maeda et al. · 2013 [cited by applicant]
US 20130304909A1 · Pappu · 2013 [cited by applicant]
US 20140126830A1 · Suganuma et al. · 2014 [cited by applicant]
US 20150280973A1 · Ko et al. · 2015 [cited by applicant]
US 20150339351A1 · Swan et al. · 2015 [cited by applicant]
US 20160070736A1 · Swan et al. · 2016 [cited by applicant]
US 20160134694A1 · Berdichevsky et al. · 2016 [cited by applicant]
US 20160203498A1 · Das et al. · 2016 [cited by applicant]
US 20160224600A1 · Munk · 2016 [cited by applicant]
US 20160292592A1 · Patthak et al. · 2016 [cited by applicant]
US 20160350646A1 · Leeman-Munk et al. · 2016 [cited by applicant]
US 20170031659A1 · Burke et al. · 2017 [cited by applicant]
US 20170063896A1 · Muddu · 2017 [cited by examiner]
US 20170109364A1 · Hasegawa et al. · 2017 [cited by applicant]
US 20170139961A1 · Baum et al. · 2017 [cited by applicant]
US 20170139984A1 · Bordawekar et al. · 2017 [cited by applicant]
US 20170199902A1 · Mishra et al. · 2017 [cited by applicant]
US 20170220672A1 · Sainani et al. · 2017 [cited by applicant]
US 20170353477A1 · Faigon et al. · 2017 [cited by applicant]
US 20180004948A1 · Martin et al. · 2018 [cited by applicant]
US 20180032862A1 · Oliner et al. · 2018 [cited by applicant]
US 20180069888A1 · Muddu et al. · 2018 [cited by applicant]
US 20180075361A1 · Yu et al. · 2018 [cited by applicant]
US 20180089561A1 · Oliner et al. · 2018 [cited by applicant]
US 20180129967A1 · Herreshoff · 2018 [cited by applicant]
US 20180211176A1 · Khurshudov et al. · 2018 [cited by applicant]
US 20180219889A1 · Oliner et al. · 2018 [cited by applicant]
US 20180241557A1 · Maes et al. · 2018 [cited by applicant]
US 20180300888A1 · Tanaka · 2018 [cited by applicant]
US 20180302342A1 · Zaifman et al. · 2018 [cited by applicant]
US 20180307576A1 · Debnath et al. · 2018 [cited by applicant]
US 20190034767A1 · Sainani et al. · 2019 [cited by applicant]
US 20190098106A1 · Mungel et al. · 2019 [cited by applicant]
US 20190130902A1 · Itoh et al. · 2019 [cited by applicant]
US 20190163840A1 · Pal et al. · 2019 [cited by applicant]
US 20190236273A1 · Saxe et al. · 2019 [cited by applicant]
US 20190243836A1 · Nanda · 2019 [cited by examiner]
US 20190251457A1 · Byrnes et al. · 2019 [cited by applicant]
US 20190294933A1 · Gupta et al. · 2019 [cited by applicant]
US 20190317885A1 · Heinecke · 2019 [cited by examiner]
US 20190370500A1 · Lee · 2019 [cited by examiner]
US 20200004736A1 · Liu et al. · 2020 [cited by applicant]
US 20200064818A1 · Lajevardi et al. · 2020 [cited by applicant]
US 20200065212A1 · Chanda et al. · 2020 [cited by applicant]
US 20200065340A1 · Hodge et al. · 2020 [cited by applicant]
US 20200097579A1 · Manjappa et al. · 2020 [cited by applicant]
US 20200167395A1 · Pal et al. · 2020 [cited by applicant]
US 20200183711A1 · Kurien et al. · 2020 [cited by applicant]
US 20200184272A1 · Zhang et al. · 2020 [cited by applicant]
US 20200184337A1 · Baker · 2020 [cited by applicant]
US 20200195656A1 · Marsh et al. · 2020 [cited by applicant]
US 20200210538A1 · Wang et al. · 2020 [cited by applicant]
US 20200320769A1 · Chen et al. · 2020 [cited by applicant]
US 20200349181A1 · Carbune et al. · 2020 [cited by applicant]
US 20200349469A1 · Katzenberger et al. · 2020 [cited by applicant]
US 20200379609A1 · Jacob et al. · 2020 [cited by applicant]
US 20200409339A1 · Arashanipalai et al. · 2020 [cited by applicant]
US 20210064624A1 · Carbune et al. · 2021 [cited by applicant]
US 20210075528A1 · Akimoto · 2021 [cited by examiner]
US 20210081423A1 · Specter et al. · 2021 [cited by applicant]
US 20210089040A1 · Ebrahimi Afrouzi et al. · 2021 [cited by applicant]
US 20210089961A1 · Zeise · 2021 [cited by examiner]
US 20210092161A1 · Crabtree et al. · 2021 [cited by applicant]
US 20210117232A1 · Sriharsha et al. · 2021 [cited by applicant]
US 20210117382A1 · Sriharsha · 2021 [cited by applicant]
US 20210117415A1 · Sriharsha · 2021 [cited by applicant]
US 20210117416A1 · Sriharsha et al. · 2021 [cited by applicant]
US 20210117857A1 · Sriharsha · 2021 [cited by applicant]
US 20210117868A1 · Sriharsha · 2021 [cited by applicant]
US 20210248146A1 · Fry · 2021 [cited by applicant]
US 20220035775A1 · Sriharsha et al. · 2022 [cited by applicant]
US 20220036002A1 · Sriharsha et al. · 2022 [cited by applicant]
US 20220036177A1 · Sriharsha et al. · 2022 [cited by applicant]
US 20220230093A1 · Kostakis et al. · 2022 [cited by applicant]
US 20220269953A1 · Takeoka · 2022 [cited by examiner]
US 20220358124A1 · Sriharsha · 2022 [cited by applicant]
US 20230205819A1 · Sriharsha · 2023 [cited by applicant]
US 20230237094A1 · Sriharsha et al. · 2023 [cited by applicant]
EP 3107026A1 · 2016 [cited by applicant]
EP 3107026B1 · 2018 [cited by applicant]
WO 2019043163A1 · 2019 [cited by applicant]
WO 2021076775A1 · 2021 [cited by applicant]
Bitincka L., et al., “Optimizing Data Analysis with a Semi-structured Time Series Database”, Conference: Proceedings of the 2010 Workshop on Managing Systems via Log Analysis and Machine Learning Techniques, Vancouver, … [cited by applicant]
Carasso D., et al., “Exploring Splunk: Search Processing Language (SPL) Primer and Cookbook.” Splunk Inc., CITO Research, New York, Apr. 2012, 156 Pages, (Nov. 28, 2018). [cited by applicant]
Co-Pending U.S. Appl. No. 18/295,166, filed Apr. 3, 2023, 283 Pages. [cited by applicant]
Co-Pending U.S. Appl. No. 17/248,612, filed Jan. 29, 2021, 303 Pages, (SPLK.084A). [cited by applicant]
Co-Pending U.S. Appl. No. 17/874,751, filed Jul. 27, 2022, 371 Pages, (SPLK.066A2C1). [cited by applicant]
Co-Pending U.S. Appl. No. 18/104,089, filed Jan. 31, 2023, 373 Pages. [cited by applicant]
Co-Pending U.S. Appl. No. 18/117,319, filed Mar. 3, 2023, 370 Pages. [cited by applicant]
Co-Pending U.S. Appl. No. 18/190,519, filed Mar. 27, 2023, 277 Pages. [cited by applicant]
Haihong E., et al., “Spark-based Machine Learning Pipeline Construction Method,” International Conference on Machine Learning and Data Engineering (iCMLDE). IEEE, 2019, 6 Pages. [cited by applicant]
He S., et al., “Experience Report: System Log Analysis for Anomaly Detection,” IEEE 27th International Symposium on Software Reliability Engineering (ISSRE), IEEE, Oct. 23, 2016, pp. 207-218, XP033018817, DOI : 10.1109/… [cited by applicant]
International Preliminary Report on Patentability for International Application No. PCT/US2020/055811, dated Jan. 20, 2022, 15 Pages. [cited by applicant]
International Preliminary Report on Patentability for International Application No. PCT/US2021/070923, dated Jan. 31, 2023, 09 Pages. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2020/055811, dated Jan. 26, 2021, 15 Pages. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2021/070923, dated Jan. 3, 2022, 15 Pages. [cited by applicant]
Karanasos K., et al., “Extending Relational Query Processing With ML Inference,” arXiv Preprint arXiv:1911.00231, Nov. 1, 2019, 6 Pages. [cited by applicant]
Settles B., et al., “Active Learning, Synthesis Lectures on Artificial Intelligence and Machine Learning,” Morgan & Claypool Publishers, Jun. 2012, pp. 1-32. [cited by applicant]
Snell C., et al., “Scaling LLM Test-Time Compute Optimally Can be More Effective than Scaling Model Parameters”, arXiv:2408.03314v1, Aug. 6, 2024, 37 Pages. [cited by applicant]
Snell J., et al., “Prototypical Networks for Few-short Learning,” 31st Conference on Neural Information Processing Systems (NIPS 2017), Long Beach, CA, USA, 2017, pp. 1-11, (11 Pages). [cited by applicant]
Splunk: “Splunk Cloud User Manual 8.0.2004”, Splunk Turn Data in Doing, Splunk Inc, May 20, 2020, 66 Pages, Retrieved from URL: https://docs.splunk.com/Documentation. [cited by applicant]
Splunk: “Splunk Enterprise Overview 8.0.0,” Splunk Turn Data into Doing, May 20, 2020, 17 Pages, [Retrieved on May 20, 2020], Retrieved from URL: https://docs.splunk.com/Documentation. [cited by applicant]
Splunk: “Splunk Quick Reference Guide”, 2021, 6 Pages, https://www.splunk.com/pdfs/solution-guides/splunk-quick-reference-guide.pdf. [cited by applicant]
Tromba I.M., “MakeML: Automated Machine Learning from Data to Predictions,” Massachusetts Institute of Technology, Jun. 2018, 64 Pages. [cited by applicant]
Vaid K., “QPS, KW-hr,MTBF,DeltaT,PUE,IOPS,DB/RH: A Day in the Life of a Datacenter Architect,” Workshop on Managing Systems via Log Analysis and Machine Learning Techniques, (SLAML '10) , Vancouver, BC, Canada, Conferen… [cited by applicant]