Abstract: This disclosure relates to learning with transformed data such as determining multiple training samples from multiple data samples. Each of the multiple data samples comprises one or more feature values and a label that classifies that data sample. A processor determines each of the multiple training samples by randomly selecting a subset of the multiple data samples, and combining the feature values of the data samples of the subset based on the label of each of the data samples of the subset. Since the training samples are combinations of randomly chosen data samples, the training samples can be provided to third parties without disclosing the actual training data. This is an advantage over existing methods in cases where the data is confidential and should therefore not be shared with a learner of a classifier, for example.

Abstract: This disclosure relates to learning from distributed data. In particular, it relates to determining multiple first training samples from multiple first data samples. Each of the multiple first data samples comprises multiple first feature values and a first label that classifies that first data sample. A processor determines each of the multiple first training samples by selecting a first subset of the multiple first data samples such that the first subset comprises data samples with corresponding one or more of the multiple first feature values, and combining the first feature values of the data samples of the first subset based on the first label of each of the first data samples of the first subset. The resulting training samples can be combined with training samples from other databases that share the same corresponding features and entity matching is unnecessary.

Abstract: This disclosure relates to learning from distributed data. In particular, it relates to determining multiple first training samples from multiple first data samples. Each of the multiple first data samples comprises multiple first feature values and a first label that classifies that first data sample. A processor determines each of the multiple first training samples by selecting a first subset of the multiple first data samples such that the first subset comprises data samples with corresponding one or more of the multiple first feature values, and combining the first feature values of the data samples of the first subset based on the first label of each of the first data samples of the first subset. The resulting training samples can be combined with training samples from other databases that share the same corresponding features and entity matching is unnecessary.

Abstract: This disclosure relates to learning with transformed data such as determining multiple training samples from multiple data samples. Each of the multiple data samples comprises one or more feature values and a label that classifies that data sample. A processor determines each of the multiple training samples by randomly selecting a subset of the multiple data samples, and combining the feature values of the data samples of the subset based on the label of each of the data samples of the subset. Since the training samples are combinations of randomly chosen data samples, the training samples can be provided to third parties without disclosing the actual training data. This is an advantage over existing methods in cases where the data is confidential and should therefore not be shared with a learner of a classifier, for example.

Abstract: [Object] To provide a gene clustering tool that can perform gene clustering based on the data on gene expression level over time without a priori data forecast but with high precision. [Solving Means] Provided is a gene clustering program for performing at least (1) a step S1 of calculating a feature value reflecting similarity among data from the data representing variation in gene expression level over time, (2) a step S2 of calculating eigenvectors of a similarity matrix M from the calculated feature values for all combinations of the genes, (3) a step S3 of transforming the similarity matrix M into a Boolean matrix N while maintaining eigenvalues of the eigenvectors, and (4) a step S4 of clustering the data based on the Boolean matrix N.