IP Library › Granted Patent US 12,189,463
Granted Patent B2
US 12,189,463 · App. 17/977,704 · Granted Jan 7, 2025

Extended dynamic intelligent log analysis tool

Inventors: Nirjar Gandhi (New Delhi, IN); Anviti Srivastava (Gurugam, IN); Sudhir Verma (Gurgaon, IN); Martin Adam (Prisnotice, CZ); Vitezslav Visek (Brno, CZ)
Assignee: SAP SE
G06F11/0778G06F11/0709G06F11/0769G06F11/0781G06F11/3476
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,189,463
App. No.
17/977,704
Filed
Oct 31, 2022
Granted
Jan 7, 2025
Kind
B2
Art Unit
2114
USPC
714/57
Abstract

This disclosure describes implementations for categorizing and displaying a Gantt chart of categorized errors, as well as performing an odd pattern analysis to identify anomalous errors including obtaining a log file that includes a number of log entries where each log entry includes an error message. Converting each error message into an error vector using a predictive model. Determining a category for each error vector using a K-nearest neighbor algorithm, and generating a Gantt chart representing error messages arranged hierarchically by category as a function of time for display at a user interface.

Claims (38)

1. A computer implemented method comprising:

obtaining, from a network during a period of minimal network activity, and by a computer system coupled to the network through a network interface device, a log file comprising a plurality of log entries, each log entry comprising an error message;

converting, by the computer system and using a predictive model, each error message into an error vector;

determining, by the computer system and using a K-nearest neighbors algorithm, a category for each error vector; and

generating, by the computer system and for display in a user interface, a Gantt chart representing error messages arranged hierarchically by category as a function of time.

2. The method of claim 1 , wherein the predictive model is an N-gram model or a Sent2Vec algorithm.

3. The method of claim 2 , wherein the predictive model is selected based on performance criteria.

4. The method of claim 3 , wherein the performance criteria comprise a determination of topic coherence.

5. The method of claim 1 , comprising:

parsing the log file to extract each error message from the plurality of log entries; and

converting each error message into an error vector by generating, for each error message, an error object to be converted into the error vector, the error object comprising at least one attribute associated with an error.

6. The method of claim 5 , wherein at least one attribute comprises a date and time of the error, and a text phrase associated with the error.

7. The method of claim 1 , comprising transmitting the error messages and determined categories to a backend system for training of one or more machine learning models.

8. The method of claim 7 , wherein the error messages and categories are transmitted during a period of low network activity, and wherein training the one or more machine learning models comprises an N-gram model, a Sent2Vec algorithm, or a K-nearest neighbor algorithm.

9. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations comprising:

obtaining, from a network through a network interface device during a period of minimal network activity, a log file comprising a plurality of log entries, each log entry comprising an error message;

converting, using a predictive model, each error message into an error vector;

determining, using a K-nearest neighbors algorithm, a category for each error vector; and

generating, for display in a user interface, a Gantt chart representing error messages arranged hierarchically by category as a function of time.

10. The computer-readable medium of claim 9 , wherein the predictive model is an N-gram model or a Sent2Vec algorithm.

11. The computer-readable medium of claim 10 , wherein the predictive model is selected based on performance criteria.

12. The computer-readable medium of claim 11 , wherein the performance criteria comprise a determination of topic coherence.

13. The computer-readable medium of claim 9 , comprising:

parsing the log file to extract each error message from the plurality of log entries; and

converting each error message into an error vector by generating, for each error message, an error object to be converted into the error vector, the error object comprising at least one attribute associated with an error.

14. The computer-readable medium of claim 13 , wherein at least one attribute comprises a date and time of the error, and a text phrase associated with the error.

15. The computer-readable medium of claim 9 , comprising transmitting the error messages and determined categories to a backend system for training of one or more machine learning models.

16. The computer-readable medium of claim 15 , wherein the error messages and categories are transmitted during a period of low network activity, and wherein training the one or more machine learning models comprises an N-gram model, a Sent2Vec algorithm, or a K-nearest neighbor algorithm.

17. A computer-implemented system, comprising:

one or more computers; and

one or more computer memory devices interoperably coupled with the one or more computers and having tangible, non-transitory, machine-readable media storing one or more instructions that, when executed by the one or more computers, perform one or more operations comprising:

obtaining, from a network through a network interface device during a period of minimal network activity, a log file comprising a plurality of log entries, each log entry comprising an error message;

converting, using a predictive model, each error message into an error vector;

determining, using a K-nearest neighbors algorithm, a category for each error vector; and

generating, for display in a user interface, a Gantt chart representing error messages arranged hierarchically by category as a function of time.

18. The system of claim 17 , wherein the predictive model is an N-gram model or a Sent2Vec algorithm.

19. The system of claim 18 , wherein the predictive model is selected based on performance criteria.

20. The system of claim 19 , wherein the performance criteria comprise a determination of topic coherence.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 31, 2022
From: GANDHI, NIRJAR; SRIVASTAVA, ANVITI; VERMA, SUDHIR; ADAM, MARTIN; VISEK, VITEZSLAV
To: SAP SE
Reel/Frame 061600/0609 →
Continuity (2)
Provisional Application 63419908 · Oct 27, 2022
Related Publication 20240143428A1 · May 2, 2024
References Cited (25)
US 9336196B2 · Bhatnagar et al. · 2016 [cited by applicant]
US 10210280B2 · Verma · 2019 [cited by applicant]
US 10235100B2 · Verma · 2019 [cited by applicant]
US 10248622B2 · Verma · 2019 [cited by applicant]
US 10339121B2 · Verma · 2019 [cited by applicant]
US 10706065B2 · Gupta et al. · 2020 [cited by applicant]
US 20040006566A1 · Taylor · 2004 [cited by examiner]
US 20150161629A1 · Verma · 2015 [cited by applicant]
US 20150379073A1 · Verma et al. · 2015 [cited by applicant]
US 20180144027A1 · Gupta et al. · 2018 [cited by applicant]
US 20200169565A1 · Badawy et al. · 2020 [cited by applicant]
US 20210090694A1 · Colley · 2021 [cited by examiner]
US 20210209159A1 · Verma et al. · 2021 [cited by applicant]
US 20220360604A1 · Smith et al. · 2022 [cited by applicant]
US 20220385673A1 · Dong et al. · 2022 [cited by applicant]
US 20240143430A1 · Gandhi · 2024 [cited by examiner]
CN 114143015 · 2022 [cited by applicant]
CN 114596015 · 2022 [cited by applicant]
CN 115169455 · 2022 [cited by applicant]
Wikipedia “GUI” page, retrieved from https://en.wikipedia.org/wiki/Graphical_user_interface (Year: 2023). [cited by examiner]
U.S. Appl. No. 17/977,683, filed Oct. 31, 2022, Gandhi et al. [cited by applicant]
Faith Karabiber, “TF-IDF—Term Frequency-Inverse Document Frequency” Submitted on Apr. 15, 2021, <https://www.learndatasci.com/glossary/tf-idf-term-frequency-inverse-document-frequency/#:˜:text=The%20TF%2DIDF%20of%20a,mu… [cited by applicant]
Neo4j.com [online], “Closeness Centrality” Aug. 2020, retrieved on Oct. 25, 2022, retrieved from URL <https://neo4j.com/docs/graph-data-science/current/algorithms/closeness-centrality/>, 9 pages. [cited by applicant]
Pagliardini et al., “Unsupervised learning of sentence embeddings using compositional n-gram features.” submitted on Mar. 7, 2017, arXiv preprint arXiv:1703.02507, 13 pages. [cited by applicant]
Wikipedia.org [online], “Louvain Method” created on Nov. 2014, retrieved on Oct. 25, 2022, retrieved from URL <https://en.wikipedia.org/wiki/Louvain_method>, 5 pages. [cited by applicant]
Cited By (1)
US 12,487,873