In implementations of systems for estimating terminal event likelihood, a computing device implements a termination system to receive observed data describing values of a treatment metric and indications of a terminal event. Values of the treatment metric are grouped into groups using a mixture model that represents the treatment metric as a mixture of distributions. Parameters of a distribution are estimated for each of the groups and mixing proportions are also estimated for each of the groups. In response to receiving a user input requesting an estimate of a likelihood of the terminal event for a particular value of the treatment metric, the termination system generates an indication of the estimate of the likelihood of the terminal event for the particular value based on a distribution density at the particular value for each of the groups and a probability of including the particular value in each of the groups.

A method for performing bearing defect auto-detection provides an algorithm for processing condition monitoring data including vibration harmonics of at least one bearing coupled to a rotatable shaft, the bearing having an inner and an outer ring. The algorithm is used to confirm with high degree of confidence that a bearing defect is present or not.

A method of detecting unusual motion is provided, including: determining features occurring during a fixed time period; grouping the features into first and second subsets of the fixed time period; grouping the features in each of the first and second subsets into at least one pattern interval; and determining when an unusual event has occurred using at least one of the pattern intervals.

In another aspect, a system for machine learning using a distributed framework, includes a computing device communicatively connected to a plurality of remote devices, the computing device designed and configured to select at least a remote device of a plurality of remote devices, determine a confidence level of the at least a remote device, and assign at least a machine-learning task to the at least a remote device, wherein assigning further comprises assigning at least a secure data storage task to the at least a remote device and assigning at least a model-generation task to the at least a remote device.

A data processing server may receive a set of data objects for frequent pattern (FP) analysis. The set of data objects may be analyzed using an attribute diversity technique. For the set of data attributes of the set of data objects, the server may arrange the attributes in one or more dimensions. The server may initialize a set of centroids on data points and identify mean values of nearby data points. Based on an iteration of the mean value calculation, the server may identify a set of attributes corresponding to final mean values as being groups of similarly frequent attributes. These groups of similarly frequent attributes may be analyzed using an FP analysis procedure to identify frequent patterns of data attributes.

Enhanced techniques and circuitry are presented herein for providing responses to questions from among digital documentation sources spanning various documentation formats, versions, and types. One example includes a method comprising receiving an indication of a question directed to subject having a documentation corpus, determining a set of passages of the documentation corpus related to the question, ranking the set of passages according to relevance to the question, forming semantic clusters comprising sentences extracted from ranked ones of the set of passages according to sentence similarity, and providing a response to the question based at least on a selected semantic cluster.

A mechanism is provided in a data processing system to implement a cognitive natural language processing (NLP) system with descriptor uniqueness identification to support named entity mention clustering. The mechanism annotates a set of documents from a corpus of documents for entity types and mentions, collects descriptor usages from all documents in the corpus of documents, analyzes the descriptor usages to classify the descriptors as base terms or modifier terms, generates compatibility scores for the descriptors, and performs entity merging of entity clusters based on the compatibility scores.

The technology disclosed relates to a variant pathogenicity classifier. The variant pathogenicity classifier comprises memory and runtime logic. The memory stores (i) a reference amino acid sequence of a protein, (ii) an alternative amino acid sequence of the protein that contains a variant amino acid caused by a variant nucleotide, and (iii) a protein contact map of the protein. The runtime logic has access to the memory, and is configured to provide (i) the reference amino acid sequence, (ii) the alternative amino acid sequence, and (iii) the protein contact map as input to a first neural network, and to cause the first neural network to generate a pathogenicity indication of the variant amino acid as output in response to processing (i) the reference amino acid sequence, (ii) the alternative amino acid sequence, and (iii) the protein contact map.

The technology relates to navigating imagery that is organized into clusters based on common patterns exhibited when imagery is captured. For example, a set of captured images which satisfy a predetermined pattern may be determined. The images in the set of set of captured images may be grouped into one or more clusters according to the predetermined pattern. A request to display a first cluster of the one or more clusters may be received and, in response, a first captured image from the requested first cluster may be selected. The selected first captured image may then be displayed.

A computer-implemented clustering method is disclosed for image segmentation, social network analysis, computational biology, market research, search engine and other applications. At the heart of the method is a point-set kernel that measures the similarity between a data point and a set of data points. The method has a procedure that employs the point-set kernel to expand from a seed point to a cluster; and finally identifies all clusters in the given dataset. Applying the method for image segmentation, it identifies several segments in the image, where points in each segment have high similarity: but points in one segment have low similarity with respect to other segments. The method is both effective and efficient that enables it to deal with large scale datasets. In contrast, existing clustering methods are either efficient or effective; and even efficient ones have difficulty dealing with large scale datasets without massive parallelization.