Patents by Inventor Roman Krashanitsa

Roman Krashanitsa has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 11604923
    Abstract: A log message classifier employs machine learning for identifying a corresponding parser for interpreting the incoming log message and for retraining a classification logic model processing the incoming log messages. Voluminous log messages generate a large amount of data, typically in a text form. Data fields are parseable from the message by a parser that knows a format of the message. The classification logic is trained by a set of messages having a known format for defining groups of messages recognizable by a corresponding parser. The classification logic is defined by a random forest that outputs a corresponding group and confidence value for each incoming message. Groups may be split to define new groups based on a recurring matching tail (latter portion) of the incoming messages. A trend of decreased confidence scores triggers a periodic retraining of the random forest, and may also generate an alert to operators.
    Type: Grant
    Filed: March 22, 2021
    Date of Patent: March 14, 2023
    Assignee: jSonar Inc.
    Inventors: Ron Ben-Natan, Derek DiFilippo, Uri Hershenhorn, Roman Krashanitsa, Luigi Labigalini, Ury Segal
  • Publication number: 20210209303
    Abstract: A log message classifier employs machine learning for identifying a corresponding parser for interpreting the incoming log message and for retraining a classification logic model processing the incoming log messages. Voluminous log messages generate a large amount of data, typically in a text form. Data fields are parseable from the message by a parser that knows a format of the message. The classification logic is trained by a set of messages having a known format for defining groups of messages recognizable by a corresponding parser. The classification logic is defined by a random forest that outputs a corresponding group and confidence value for each incoming message. Groups may be split to define new groups based on a recurring matching tail (latter portion) of the incoming messages. A trend of decreased confidence scores triggers a periodic retraining of the random forest, and may also generate an alert to operators.
    Type: Application
    Filed: March 22, 2021
    Publication date: July 8, 2021
    Inventors: Ron Ben-Natan, Derek DiFilippo, Uri Hershenhorn, Roman Krashanitsa, Luigi Labigalini, Ury Segal
  • Patent number: 10956672
    Abstract: A log message classifier employs machine learning for identifying a corresponding parser for interpreting the incoming log message and for retraining a classification logic model processing the incoming log messages. Voluminous log messages generate a large amount of data, typically in a text form. Data fields are parseable from the message by a parser that knows a format of the message. The classification logic is trained by a set of messages having a known format for defining groups of messages recognizable by a corresponding parser. The classification logic is defined by a random forest that outputs a corresponding group and confidence value for each incoming message. Groups may be split to define new groups based on a recurring matching tail (latter portion) of the incoming messages. A trend of decreased confidence scores triggers a periodic retraining of the random forest, and may also generate an alert to operators.
    Type: Grant
    Filed: December 19, 2018
    Date of Patent: March 23, 2021
    Assignee: Imperva, Inc.
    Inventors: Ron Ben-Natan, Derek Difilippo, Uri Hershenhorn, Roman Krashanitsa, Luigi Labigalini, Ury Segal