Patent application number | Description | Published |
20140156235 | MODELING MULTIPLE INTERACTIONS BETWEEN MULTIPLE LOCI - Various embodiments generate a quantitative model of genetic effect. In one embodiment, a processor receives a set of loci of an entity. Each locus is associated with a contribution value to a given physical trait. A first set of interacting loci associated with a first interaction and at least a second set of interacting loci associated with at least a second interaction are identified. The first interaction type is associated with a first interaction model. The at least the second interaction is associated at least a second interaction model. A model of a quantitative value of the entity is generated based on at least the contribution value associated with each locus in the set of loci, a contribution value of the first interaction as defined by the first interaction model, and a contribution value of the second interaction as defined by the at least the second interaction model. | 06-05-2014 |
20140156236 | MODELING MULTIPLE INTERACTIONS BETWEEN MULTIPLE LOCI - Various embodiments generate a quantitative model of genetic effect. In one embodiment, a processor receives a set of loci of an entity. Each locus is associated with a contribution value to a given physical trait. A first set of interacting loci associated with a first interaction and at least a second set of interacting loci associated with at least a second interaction are identified. The first interaction type is associated with a first interaction model. The at least the second interaction is associated at least a second interaction model. A model of a quantitative value of the entity is generated based on at least the contribution value associated with each locus in the set of loci, a contribution value of the first interaction as defined by the first interaction model, and a contribution value of the second interaction as defined by the at least the second interaction model. | 06-05-2014 |
20140207427 | FEATURE SELECTION FOR EFFICIENT EPISTASIS MODELING FOR PHENOTYPE PREDICTION - Various embodiments select markers for modeling epistasis effects. In one embodiment, a processor receives a set of genetic markers and a phenotype. A relevance score is determined with respect to the phenotype for each of the set of genetic markers. A threshold is set based on the relevance score of a genetic marker with a highest relevancy score. A relevance score is determined for at least one genetic marker in the set of genetic markers for at least one interaction between the at least one genetic marker and at least one other genetic marker in the set of genetic markers. The at least one interaction is added to a top-k feature set based on the relevance score of the at least one interaction satisfying the threshold. | 07-24-2014 |
20140207436 | FEATURE SELECTION FOR EFFICIENT EPISTASIS MODELING FOR PHENOTYPE PREDICTION - Various embodiments select markers for modeling epistasis effects. In one embodiment, a processor receives a set of genetic markers and a phenotype. A relevance score is determined with respect to the phenotype for each of the set of genetic markers. A threshold is set based on the relevance score of a genetic marker with a highest relevancy score. A relevance score is determined for at least one genetic marker in the set of genetic markers for at least one interaction between the at least one genetic marker and at least one other genetic marker in the set of genetic markers. The at least one interaction is added to a top-k feature set based on the relevance score of the at least one interaction satisfying the threshold. | 07-24-2014 |
20140207710 | TRANSDUCTIVE LASSO FOR HIGH-DIMENSIONAL DATA REGRESSION PROBLEMS - Various embodiments select features from a feature space. In one embodiment, a set of training samples and a set of test samples are received. A first centered Gram matrix of a given dimension is determined for each of a set of feature vectors that include at least one of the set of training samples and at least one of the set of test samples. A second centered Gram matrix of the given dimension is determined for a target value vector that includes target values from the set of training samples. A set of columns and rows associated with the at least one of the test samples in the second centered Gram matrix is set to 0. A subset of features is selected from a set of features based on the first and second centered Gram matrices. | 07-24-2014 |
20140207711 | TRANSDUCTIVE FEATURE SELECTION WITH MAXIMUM-RELEVANCY AND MINIMUM-REDUNDANCY CRITERIA - Various embodiments select features from a feature space. In one embodiment, a set of training samples and a set of test samples are received. The set of training samples includes a set of features and a class value. The set of test samples includes the set of features absent the class value. A relevancy with respect to the class value is determined for each of a plurality of unselected features based on the set of training samples. A redundancy with respect to one or more of the set of features is determined for each of the plurality of unselected features in the first set of features based on the set of training samples and the set of test samples. A set of features is selected from the plurality of unselected features based on the relevancy and the redundancy determined for each of the plurality of unselected features. | 07-24-2014 |
20140207713 | TRANSDUCTIVE FEATURE SELECTION WITH MAXIMUM-RELEVANCY AND MINIMUM-REDUNDANCY CRITERIA - Various embodiments select features from a feature space. In one embodiment, a set of training samples and a set of test samples are received. The set of training samples includes a set of features and a class value. The set of test samples includes the set of features absent the class value. A relevancy with respect to the class value is determined for each of a plurality of unselected features based on the set of training samples. A redundancy with respect to one or more of the set of features is determined for each of the plurality of unselected features in the first set of features based on the set of training samples and the set of test samples. A set of features is selected from the plurality of unselected features based on the relevancy and the redundancy determined for each of the plurality of unselected features. | 07-24-2014 |
20140207714 | TRANSDUCTIVE LASSO FOR HIGH-DIMENSIONAL DATA REGRESSION PROBLEMS - Various embodiments select features from a feature space. In one embodiment, a set of training samples and a set of test samples are received. A first centered Gram matrix of a given dimension is determined for each of a set of feature vectors that include at least one of the set of training samples and at least one of the set of test samples. A second centered Gram matrix of the given dimension is determined for a target value vector that includes target values from the set of training samples. A set of columns and rows associated with the at least one of the test samples in the second centered Gram matrix is set to 0. A subset of features is selected from a set of features based on the first and second centered Gram matrices. | 07-24-2014 |
20140207764 | DYNAMIC FEATURE SELECTION WITH MAX-RELEVANCY AND MINIMUM REDUNDANCY CRITERIA - Various embodiments select features from a feature space. In one embodiment a set of features and a class value are received. A redundancy score is obtained for a feature that was previously selected from the set of features. A redundancy score is determined, for each of a plurality of unselected features in the set of features, based on the redundancy score that has been obtained, and a redundancy between the unselected feature and the feature that was previously selected. A relevance to the class value is determined for each of the unselected features. A feature from the plurality of unselected features with a highest relevance to the class value and a lowest redundancy score is selected. | 07-24-2014 |
20140207765 | DYNAMIC FEATURE SELECTION WITH MAX-RELEVANCY AND MINIMUM REDUNDANCY CRITERIA - Various embodiments select features from a feature space. In one embodiment a set of features and a class value are received. A redundancy score is obtained for a feature that was previously selected from the set of features. A redundancy score is determined, for each of a plurality of unselected features in the set of features, based on the redundancy score that has been obtained, and a redundancy between the unselected feature and the feature that was previously selected. A relevance to the class value is determined for each of the unselected features. A feature from the plurality of unselected features with a highest relevance to the class value and a lowest redundancy score is selected. | 07-24-2014 |
20140207799 | HILL-CLIMBING FEATURE SELECTION WITH MAX-RELEVANCY AND MINIMUM REDUNDANCY CRITERIA - Various embodiments select features from a feature space. In one embodiment a candidate feature set of k′ features is selected from at least one set of features based on maximum relevancy and minimum redundancy (MRMR) criteria. A target feature set of k features is identified from the candidate feature set, where k′>k. Each a plurality of features in the target feature set is iteratively updated with each of a plurality of k′−k features from the candidate feature set. The feature from the plurality of k′−k features is maintained in the target feature set, for at least one iterative update, based on a current MRMR score of the target feature set satisfying a threshold. The target feature set is stored as a top-k feature set of the at least one set of features after a given number of iterative updates. | 07-24-2014 |
20140207800 | HILL-CLIMBING FEATURE SELECTION WITH MAX-RELEVANCY AND MINIMUM REDUNDANCY CRITERIA - Various embodiments select features from a feature space. In one embodiment a candidate feature set of k′ features is selected from at least one set of features based on maximum relevancy and minimum redundancy (MRMR) criteria. A target feature set of k features is identified from the candidate feature set, where k′>k. Each a plurality of features in the target feature set is iteratively updated with each of a plurality of k′−k features from the candidate feature set. The feature from the plurality of k′−k features is maintained in the target feature set, for at least one iterative update, based on a current MRMR score of the target feature set satisfying a threshold. The target feature set is stored as a top-k feature set of the at least one set of features after a given number of iterative updates. | 07-24-2014 |