International Business Machines Corporation

Pawel Slowikowski

Lukasz Grzegorz Cmielowski

Rafal Bigaj

Bartlomiej Tomasz Malecki

Michal S Paluch

Piotr Kania

Tomasz L Prudzic

Patryk M Walawender

Slawomir T Mezyk

Grzegorz Poniewozik

Monika Grabska

Wojciech Sobala

Andrzej Jan Wrobel

Marek Oszajec

Umit M Cakmak

Kamila Baron-Palucka

Embodiments of the present invention enable a comparison of different machine-learning models based on a single neural network design may be provided. A deep learning architecture for an experimentation framework is represented as a directed acyclic graph with nodes representing neural network layers. Embodiments of the present invention specify a first machine-learning model in a first branch and a second machine-learning model in a second branch of the directed acyclic graph. Each branch has its own optimizer node. Embodiments of the present invention generate source code for the first machine-learning model and the second machine-learning model out of the directed acyclic graph, and train the first machine-learning model and the second machine-learning model simultaneously, thereby enabling the comparison of different machine-learning models.

Deep learning experiment content generation based on single design

An exclusion database is maintained for software discovery scans where directories within a file system are excluded according to discovered software artifacts, scan time parameters, and pre-defined exclusion definitions associated with software applications. A file system tree having directory-specific attributes for causing software discovery scans to limit scanning within the file system.

Software discovery using exclusion

A processor may identify, using historical data, an amount of computing resources consumed to remedy the failure with an automatic remedy step. The processor may determine that the amount of consumed computing resources to remedy the failure is less than an amount of computing resources consumed by restarting the process. The processor may perform the automatic remedy step. The processor may identify that the automatic remedy step has failed. The processor may determine a waiting period based on an estimated time to receive a user response to the failure and an estimated load on the computing cluster. The processor may display a generated alert to a user during the waiting period. The processor may identify that no user input has been received during the waiting period. The processor may release computing resources corresponding to the process.

Automatic correcting of computing cluster execution failure

One or more processors determine that one or more memory locations in a client computing device contain one or more software artifacts that provide a match to a first software signature. One or more processors send instructions not to scan the one or more memory locations against a second software signature.

A current data set with multiple records is fed into a data analysis model. The current data set is limited to data occurring in a current time window with a predetermined window size. The model is run on the current data set and a current data prediction result is generated. Limited historical data sets having multiple records are selected. Each record has values for several features. Each historical data set is limited to data occurring in a historical time window having the window size. A historical class label distribution is determined for the historical data sets and an upper and lower control limit are determined for the historical data sets using the historical class label distribution. A current class label distribution having a mean value is determined for the current prediction result. An alert is provided when the mean value is not between the upper and lower control limit.

Prediction quality assessment

Described herein is an approach for automatically determining the semantic relatedness of documents to semantic concepts. A first text mining analysis extracts a set of reference concepts from reference documents. A second text mining analysis extracts a set of test concepts from test documents that include a mixture of new concepts and reference concepts. An extended co-occurrence matrix is computed that indicates a frequency of co-occurrence (RCCF) of each new and each reference concept in the test documents with all other new and reference concepts. The extended co-occurrence matrix is used for computing a new concept relatedness score (NCRS) for the new concepts. A document similarity score (DSS) is computed for each of the test documents by aggregating, inter alia, the NCRS of each new concept with the RCCF of each reference concept. The DSS represents the semantic relatedness of the test document to the totality of the reference concepts.

Growing community of inventors

Cracow, Poland

Pawel Slowikowski