Genetic Algorithm Classifier Optimization for Genomic Diagnostics

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing genetic algorithms face challenges in optimizing classifiers for genomic diagnostic tests due to large search spaces and small patient datasets, leading to potential false correlations and slow discovery rates, especially when determining optimal subsets of measurements for medical diagnostics.

Innovation Solution

The method involves producing a first generation chromosome population with a selected number of genes specifying a subset of measurements, using an expressed subset-size gene to distinguish between expressed and unexpressed genes, and computationally genetically evolving these chromosomes to produce successive generations, while introducing simulated noise and selectively mutating unique gene values to optimize classifier performance without prior knowledge of measurement subsets.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If traditional genetic algorithms are used to search for optimal measurement subsets, then the search can cover the entire measurement space, but the computation time becomes prohibitively long due to the large search space

Engineering Contradiction:
Improveaccuracy of classifierVSAvoidcomputation time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The patent segments the large search space by introducing domain knowledge constraints that divide the measurement space into smaller, more manageable regions. By incorporating prior knowledge about which measurements are likely to be relevant, the search is segmented into focused subsets rather than exhaustively searching the entire space, thereby reducing computation time while maintaining classifier accuracy.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent performs preliminary action by pre-processing the measurement data and pre-identifying potentially relevant measurements before the genetic algorithm search begins. This preliminary filtering reduces the effective search space that the genetic algorithm must explore, allowing faster convergence to optimal measurement subsets without sacrificing accuracy.

Inventive Principle:
Principle #10Preliminary action

2Productivity

If the genetic algorithm uses a small patient dataset for optimization, then the computational burden is reduced, but false correlations may arise due to insufficient statistical power

Engineering Contradiction:
Improvediscovery rateVSAvoidaccuracy of correlations
Core Design Contradiction:
ProductivityVSReliability

Solution Approach 1:

The patent implements feedback mechanisms where the genetic algorithm continuously evaluates classifier performance on the patient dataset and uses this feedback to guide subsequent generations of measurement subsets. By incorporating cross-validation and performance monitoring, the system provides feedback that helps distinguish true correlations from false ones, improving the reliability of results even with limited data.

Inventive Principle:
Principle #23Feedback

Solution Approach 2:

The patent changes parameters such as population size, mutation rates, and selection pressures during the genetic algorithm execution based on observed performance. By dynamically adjusting these parameters, the system can adapt to the limitations of small datasets, reducing the risk of false correlations while maintaining an acceptable discovery rate.

Inventive Principle:
Principle #35Parameter changes

3Adaptability or versatility

If the genetic algorithm evolves chromosomes with variable numbers of genes, then the flexibility to find optimal subset sizes is improved, but the complexity of the evolutionary process increases

Engineering Contradiction:
Improveflexibility in measurement subset selectionVSAvoidcomplexity of genetic algorithm
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The patent applies dynamics by allowing the chromosome structure to be variable rather than fixed. Each chromosome can have a different number of genes corresponding to different measurement subset sizes. This dynamic structure enables the genetic algorithm to explore various subset sizes and compositions, providing flexibility in finding optimal measurement subsets while the underlying genetic operations remain standardized.

Inventive Principle:
Principle #15Dynamics

Data Source

PatentUS8798937B2Methods for optimizing and using medical diagnostic classifiers based on genetic algorithms
Publication Date: 2014.08.05 KONINKLIJKE PHILIPS NV
  • US8798937B2 patent drawing
  • US8798937B2 patent drawing
  • US8798937B2 patent drawing

AI summary

In a genetic optimization method, the genes of a chromosome population are computationally genetically evolved. The evolving includes evolving a number of expressed genes in each chromosome and employing a fitness criterion evaluated without reference to unexpressed genes of each chromosome. An optimized chromosome produced by the genetic evolving is selected.