Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for constructing and programming quantum hardware for machine learning processes. A Quantum Statistic Machine (QSM) is described, consisting of three distinct classes of strongly interacting degrees of freedom including visible, hidden and control quantum subspaces or subsystems. The QSM is defined with a programmable non-equilibrium ergodic open quantum Markov chain with a unique attracting steady state in the space of density operators. The solution of an information processing task, such as a statistical inference or optimization task, can be encoded into the quantum statistics of an attracting steady state, where quantum inference is performed by minimizing the energy of a real or fictitious quantum Hamiltonian. The couplings of the QSM between the visible and hidden nodes may be trained to solve hard optimization or inference tasks.

Abstract: Some embodiments include a system operable to construct hierarchical training data sets for use with machine-learning for multiple controlled devices. Other embodiments of related systems and methods are also provided.

Abstract: A machine learning system continuously receives tag signals indicating membership relations between data objects from a data corpus and tag targets. The machine learning system is asynchronously and iteratively trained with the received tag signals to identify further data objects from the data corpus predicted to have a membership relation with the single tag target. The machine learning system constantly improves its predictive accuracy in short time by the continuous training of a backend machine learning model based on implicit and explicit tag signals gathered from a non-intrusive monitoring of user interactions during a review process of the data corpus.

Abstract: An individual having a plurality of first features and a second characteristic is identified. A plurality of second features associated with a second characteristic is determined. For each first feature among the plurality of first features, a respective probability distribution indicating, for each respective second feature, a probability that a person having the respective second feature has the first feature, is determined, thereby generating a plurality of probability distributions. A probabilistic classifier is used to combine the plurality of probability distributions, thereby generating a merged probability distribution. A Monte Carlo method is used to generate a prediction set based on the merged probability distribution, the prediction set including a plurality of prediction values for the second characteristic of the individual, each respective prediction value being associated with one of the plurality of second features. The prediction set is stored in a memory.

Abstract: A business prediction method includes: obtaining a first business sample set and a second business sample set; performing training based on the first business sample set and the second business sample set to obtain a business prediction model, and predicting received to-be-predicted business information based on the business prediction model to obtain a business prediction result corresponding to the received to-be-predicted business information. A business prediction apparatus is further provided. The business prediction method and the business prediction apparatus take into account data features of some business samples of being rejected in a business validation, while considering business samples of passing the business validation. This restores a business scenario, reduces the waste of costs of the rejected samples, and balances demands for a modeling sample and a rejected sample reasonably when there are insufficient samples of passing the business validation.

Abstract: A system comprising a classical computing subsystem to perform classical operations in a three-dimensional (3D) classical space unit using decomposed stopping points along a consecutive sequence of stopping points of sub-cells, along a vector with a shortest path between two points of the 3D classical space unit. The system includes a quantum computing subsystem to perform quantum operations in a 3D quantum space unit using decomposed stopping points along a consecutive sequence of stopping points of sub-cells, along a vector selected to have a shortest path between two points of the 3D quantum space unit. The system includes a control subsystem to decompose classical subproblems and quantum subproblems into the decomposed points and provide computing instructions and state information to the classical computing subsystem to perform the classical operations to the quantum computing subsystem to perform the quantum operations. A method and computer readable medium are provided.

Abstract: A computer-implemented method includes generating, by a processor, a set of training data for each phenotype in a database including a set of subjects. The set of training data is generated by dividing genomic information of N subjects selected with or without repetition into windows, computing a distribution of genomic events in the windows for each of N subjects, and extracting, for each window, a tensor that represents the distribution of genomic events for each of N subjects. A set of test data is generated for each phenotype in the database, a distribution of genomic events in windows for each phenotype is computed, and a tensor is extracted for each window that represents a distribution of genomic events for each phenotype. The method includes classifying each phenotype of the test data with a classifier, and assigning a phenotype to a patient.

Abstract: Methods and systems for receiving a request to implement a neural network comprising an average pooling layer on a hardware circuit, and in response, generating instructions that when executed by the hardware circuit, cause the hardware circuit to, during processing of a network input by the neural network, generate a layer output tensor that is equivalent to an output of the average pooling neural network layer by performing a convolution of an input tensor to the average pooling neural network layer and a kernel with a size equal to a window of the average pooling neural network layer and composed of elements that are each an identity matrix to generate a first tensor, and performing operations to cause each element of the first tensor to be divided by a number of elements in the window of the average pooling neural network layer to generate an initial output tensor.

Abstract: A method for generating a project saturation model for one or more projects is provided. Historical project data is analyzed to define a plurality of project change factors for one or more proposed projects. A plurality of scoring values associated with the plurality of project change factors is received for each of the one or more proposed projects. One or more saturation model components are generated based on the historical project data and based on the received plurality of scoring values for each of the proposed projects. A saturation model is generated by combining the saturation model components for each of the proposed projects. The saturation model identifies risks associated with a corresponding project.

Abstract: A processing apparatus is disclosed for representing cognitively biased selection behavior of a consumer as a learnable model with high prediction accuracy taking into account even feature values of a product and the consumer. The processing apparatus generates a selection model obtained by modeling selection behavior of a selection entity that selects at least one choice out of presented input choices. The processing apparatus includes an acquiring unit to acquire training data including a plurality of input feature vectors that indicate features of a plurality of the choices presented to the selection entity and an output feature vector that indicates a feature of an output choice. The processing apparatus further includes an input combining unit to combine the plurality of input vectors to generate an input combined vector, and a learning processing unit to learn a selection model on the basis of the input combined vector and the output vector.

Abstract: Disclosed herein are system, method, and computer program product embodiments for generating labels for training a machine learning mode using an incremental time window process. The described process may be used in a recurrence detection system. A dataset may be analyzed using incremental split dates to divide the dataset into an analysis portion and a holdout portion. The analysis portion may be analyzed to determine input features related to a predicted recurrence in the dataset. The holdout portion may be tested against the analysis portion and the input features to generate a label. The label may indicate whether or not the holdout portion confirms the prediction. The testing of the holdout portion against the analysis portion may be repeated by incrementally using different split dates and multiple separate analysis portions and holdout portions to generate multiple labels and corresponding input features.

Abstract: The present disclosure provides a medical data analysis method and device. The method comprises locating a semantic subspace of the subject in a medical data set by taking the physical parameter as a feature; and analyzing the probability P1 of the subject being in the semantic subspace that the subject belongs to by judging the semantic consistency of the semantic subspace where the physical parameter of the subject exists. In addition, it is also possible to analyze the probability P2 of the subject being in the node that the subject belongs to based on the evidence transference score of the physical parameter of the subject on the medical knowledge graph. P=?×P1+(1??)×P2 The probability P of the subject being in the semantic subspace or node that the subject belongs to can be determined by P=?×P1+(1??)×P2, wherein ? is a reconciling parameter, 0<?<1. Through these solutions, the analysis accuracy and efficiency can be improved and the cost can be decreased.

Abstract: A system for generating a statistical model for fault diagnosis comprising at least one hardware processor, adapted to: extract a plurality of structured values, each associated with at least one of a plurality of semantic entities of a semantic model or at least one of a plurality of semantic relationships of the semantic model, from structured historical information organized in an identified structure and related to at least some of a plurality of historical events, the semantic model represents an ontology of an identified diagnosis domain, each of the plurality of semantic entities relates to at least one of a plurality of domain entities existing in the identified diagnosis domain, and each of the plurality of semantic relationships connects two of the plurality of semantic entities and represents a parent-child relationship therebetween; extract a plurality of unstructured values, each associated with at least one of the plurality of semantic entities.

Abstract: Techniques regarding autonomously determining an entity's susceptibility towards one or more treatment services are provided. For example, one or more embodiments described herein can comprise a system, which can comprise a memory that can store computer executable components. The system can also comprise a processor, operably coupled to the memory, and that can execute the computer executable components stored in the memory. The computer executable components can comprise an assessment component that can determine a susceptibility disposition value that measures a susceptibility of an entity to a treatment service based on a trust disposition value. The trust disposition value can be determined based on a communication with the entity using machine learning technology.

Abstract: The techniques herein include using an input context to determine a suggested action. One or more explanations may also be determined and returned along with the suggested action. The one or more explanations may include (i) one or more most similar cases to the suggested case (e.g., the case associated with the suggested action) and, optionally, a conviction score for each nearby cases; (ii) action probabilities, (iii) excluding cases and distances, (iv) archetype and/or counterfactual cases for the suggested action; (v) feature residuals; (vi) regional model complexity; (vii) fractional dimensionality; (viii) prediction conviction; (ix) feature prediction contribution; and/or other measures such as the ones discussed herein, including certainty. In some embodiments, the explanation data may be used to determine whether to perform a suggested action.

Abstract: System, apparatus and method may permit users to collaboratively engage in inference on a computer and visualize structure of that inference, and provide a formal verification system for informal argumentation and inference. The system and method may generate and allow for modification of graphical structures that represent sequences of structured rational argumentation; and automatically monitor, compute and represent ratings or scores of nodes within the structure; indicate whether a node is supported by a chain of argumentation that has not been validly rebutted. The graphical structures may be displayed to bring into focus contentious and significant underlying points within an argument, and simulate the effects of alternative resolutions of these contentious points. The graphical displays may provide a transparent verification to other users of the state of what can be demonstrated and refuted, allow discovery of weak or missing points in a logical argument, and allow rational inference by users.

Abstract: A method includes improved techniques for preparing the initial state of a quantum computer by reducing the number of redundant or unnecessary gates in a quantum circuit. Starting from an initial state preparation circuit ansatz, the method recursively removes gates and re-optimizes the circuit parameters to generate a reduced-depth state preparation.

Abstract: An automated Web portal template generation method includes parsing, via a parser subsystem, a number of Webpages of a first Website from which a Web portal template to be customized is to be accessed. The method further includes producing an entity feature set for the first Website based on a result of the parsing and processing the entity feature set for the first Website via a classifier subsystem to produce a set of data that represents, for each of a plurality of entities, a respective probability of the entity belonging to a respective one of a plurality of classes. The method additionally includes performing, by a color matching subsystem, color matching on the set of data produced by the classifier subsystem to generate a number of proposed color combinations for a proposed customization of the Web portal template.

Abstract: Energy usage can be monitored within at least one building having a plurality of energy consuming components. A database can be generated that contains values for a set of data points corresponding to data received from the plurality of energy consuming components. A change in a configuration can be detected for the plurality of energy consuming components based upon a change in values received from plurality of energy consuming components relative to the database. Based upon the change, an additional data point can be added to the set of data points in the database. Based upon the values for the set of data points, a probability can be determined that a rule for the additional data point is valid. A message can then be generated that includes the determined probability.

Abstract: A method, computer program product, and computer system, for receiving a first set of ground truth instances from a first source. A second set of ground truth instances may be received from a second source. The first and second sets of ground truth instances may be weighed differently based on a level of trust associated with each of the first and second sources. The weighted first and second sets of ground truth instances may be applied in a machine learning task executed by a computer.