Patent classifications
G06F18/23213
Systems for Estimating Terminal Event Likelihood
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.
Method, apparatus and computer program product for determining lane status confidence indicators using probe data
A method, apparatus and computer program product are provided to determine lane status confidence indicators of lane status predictions such as closures and/or shifting. Lane statuses and corresponding confidence indicators are determined based on probe data, such as probe data collected from vehicle and/or mobile devices traveling along a road segment. Probe data may be partitioned into clusters and compared to partitioned subsets of the probe data. Cluster stability for the segment and corresponding lane status confidence indicators can be determined based on the comparison. Accordingly, determinations of whether to transmit predicted lane statuses to another system, service, and/or user device may be made.
Generating approximations of cardiograms from different source configurations
Systems are provided for generating data representing electromagnetic states of a heart for medical, scientific, research, and/or engineering purposes. The systems generate the data based on source configurations such as dimensions of, and scar or fibrosis or pro-arrhythmic substrate location within, a heart and a computational model of the electromagnetic output of the heart. The systems may dynamically generate the source configurations to provide representative source configurations that may be found in a population. For each source configuration of the electromagnetic source, the systems run a simulation of the functioning of the heart to generate modeled electromagnetic output (e.g., an electromagnetic mesh for each simulation step with a voltage at each point of the electromagnetic mesh) for that source configuration. The systems may generate a cardiogram for each source configuration from the modeled electromagnetic output of that source configuration for use in predicting the source location of an arrhythmia.
Machine learning based automatic audience segment in ad targeting
Generating granular clusters for real-time processing is provided. The systems can identify tokens based on aggregating input from computing devices over a time interval. The systems can identify, based on metrics, a subset of tokens for cluster generation. The systems can generate, via a clustering technique, token clusters from the subset of the tokens, each of the token clusters comprising two or more tokens from the subset of the tokens. The systems can apply a de-duplication technique to each of the token clusters. The systems can apply a filtering technique to the token clusters to remove tokens erroneously grouped in a token cluster. The systems can assign, based on a selection process, a label for each of the token clusters. The systems can activate, based on a number of remaining tokens in each of the token clusters, a subset of the token clusters for real-time content selection.
Method for selectively deploying sensors within an agricultural facility
One variation of a method for deploying sensors within an agricultural facility includes: accessing scan data of a set of modules deployed within the agricultural facility; extracting characteristics of plants occupying the set of modules from the scan data; selecting a first subset of target modules from the set of modules, each target module in the set of target modules containing a group of plants exhibiting characteristics representative of plants occupying modules neighboring the target module; for each target module, scheduling a robotic manipulator within the agricultural facility to remove a particular plant from a particular plant slot in the target module and load the particular plant slot with a sensor pod from a population of sensor pods deployed in the agricultural facility; and monitoring environmental conditions at target modules in the first subset of target modules based on sensor data recorded by the first population of sensor pods.
Data clustering
Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for clustering data are disclosed. In one aspect, a method includes the actions of receiving feature vectors. The actions further include, for a subset of the feature vectors, accessing a first label. The actions further include generating a classifier that is configured to associate a given feature vector with a feature vector of the subset of the feature vectors. The actions further include applying the feature vectors that are not included in the subset of the feature vectors to the classifier. The actions further include generating a dissimilarity matrix. The actions further include, based on the dissimilarity matrix, generating a graph. The actions further include, for each node of the graph, determining a second label. The actions further include, based on the second labels and the first labels, determining a training label for each feature vector.
Hybrid clustered prediction computer modeling
Disclosed herein are systems and methods to efficiently execute predictions models to identify future values associated with various nodes. A server retrieves a set of nodes and generates a primary prediction model using data aggregated based on all nodes. The server then executes various clustering algorithms in order to segment the nodes into different clusters. The server then generates a secondary (corrective) prediction model to calculate a correction needed to improve the results achieved by executing the primary prediction model for each cluster. When a node with unknown/limited data and attributes is identified, the server identifies a cluster most similar the new node and further identifies a corresponding secondary prediction model. The server then executes the primary prediction model in conjunction with the identified secondary prediction model to populate a graphical user interface with an accurate predicted future attribute for the new node.
Leader election in a distributed system based on node weight and leadership priority based on network performance
Example implementations relate to consensus protocols in a stretched network. According to an example, a distributed system includes continuously monitoring network performance and/or network latency among a cluster of a plurality of nodes in a distributed computer system. Leadership priority for each node is set based at least in part on the monitored network performance or network latency. Each node has a vote weight based at least in part on the leadership priority of the node. Each node's vote is biased by the node's vote weight. The node having a number of biased votes higher than a maximum possible number of votes biased by respective vote weights received by any other node in the cluster is selected as a leader node.
Processing method and device
The application provides a processing method and device. Weights and input neurons are quantized respectively, and a weight dictionary, a weight codebook, a neuron dictionary, and a neuron codebook are determined. A computational codebook is determined according to the weight codebook and the neuron codebook. Meanwhile, according to the application, the computational codebook is determined according to two types of quantized data, and the two types of quantized data are combined, which facilitates data processing.
Partitioning agricultural fields for annotation
Some implementations herein relate to a graphical user interface (GUI) that facilitates dynamically partitioning agricultural fields into clusters on an individual agricultural field-basis using agricultural features. A map of a geographic area containing a plurality of agricultural fields may be rendered as part of a GUI. The agricultural fields may be partitioned into a first set of clusters based on a first granularity value and agricultural features of individual agricultural fields. The individual agricultural fields may be visually annotated in the GUI to convey the first set of clusters of similar agricultural fields. Upon receipt of a second granularity value different from the first granularity value, the agricultural fields may be partitioned into a second set of clusters of similar agricultural fields. The map of the geographic area may be updated so that individual agricultural fields are visually annotated to convey the second set of clusters.