IP Library Granted Patent US 7,499,891
Granted Patent B2
US 7,499,891 · App. 11/735,028 · Granted Mar 3, 2009

Heuristic method of classification

Assignee: Correlogic Systems, Inc.
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 7,499,891
App. No.
11/735,028
Granted
Mar 3, 2009
Kind
B2
Abstract

The invention concerns heuristic algorithms for the classification of Objects. A first learning algorithm comprises a genetic algorithm that is used to abstract a data stream associated with each Object and a pattern recognition algorithm that is used to classify the Objects and measure the fitness of the chromosomes of the genetic algorithm. The learning algorithm is applied to a training data set. The learning algorithm generates a classifying algorithm, which is used to classify or categorize unknown Objects. The invention is useful in the areas of classifying texts and medical samples, predicting the behavior of one financial market based on price changes in others and in monitoring the state of complex process facilities to detect impending failures.

Claims (29)

1. A computer implemented method of creating a classifying pattern for biological samples using a plurality of data strings, comprising:

selecting a set of data elements from each data string using a learning algorithm, each data string being associated with one of a plurality of biological samples to be classified, each of the plurality of biological samples being of a first state or a second state;

classifying the set of data elements using a pattern recognition algorithm; and

repeating the selecting and the classifying with a different set of data elements selected from each data string until a classifying pattern is created that is acceptable to classify biological samples as being of a first state or a second state.

2. The method of claim 1 , wherein the learning algorithm is an evolutionary algorithm.

3. The method of claim 1 , wherein the learning algorithm is a genetic algorithm.

4. The method of claim 1 , wherein the data strings are of a type are selected from the group consisting of: (a) mass spectrometry data, (b) hybridization data, (c) gene expression data, and (d) microarray data.

5. The method of claim 1 , wherein the pattern recognition algorithm is an adaptive pattern recognition algorithm.

6. A computer readable medium having stored thereon data representing a classifying pattern constructed using the method of claim 1 .

7. A classifying pattern constructed using the method of claim 1 .

8. A computer implemented method of creating a classifying pattern for objects using a plurality of data strings, each data string associated with one of a plurality of objects to be classified, comprising:

selecting a set of data elements from each data string using a learning algorithm, the set of data elements being less than all of the data elements of each data string;

classifying the set of data elements using a pattern recognition algorithm; and

repeating the selecting and the classifying with a different set of data elements selected from each data string until a classifying pattern is created that is acceptable to classify the objects.

9. The method of claim 8 , wherein the learning algorithm is an evolutionary algorithm.

10. The method of claim 8 , wherein the learning algorithm is a genetic algorithm.

11. The method of claim 8 , wherein the data strings are of a type are selected from the group consisting of: (a) mass spectrometry data, (b) hybridization data, (c) gene expression data, (d) microarray data, (e) financial data, (f) stock market data, (g) text, (h) currency exchange rates, and (i) processing plant control status values.

12. The method of claim 8 , wherein the pattern recognition algorithm is an adaptive pattern recognition algorithm.

13. The method of claim 12 , wherein the pattern recognition algorithm creates a cluster map having a plurality of clusters associated with the set of data points.

14. The method of claim 13 , wherein acceptability of a grouping as a classifying pattern to classify the objects is based on the homogeneity of the clusters in the cluster map.

15. The method of claim 13 , wherein a grouping is acceptable as a classifying pattern to classify the objects if a homogeneity of the cluster map is within a predetermined tolerance.

16. The method of claim 13 , wherein the cluster map is created by

calculating a vector for each set of data points; and

mapping the vectors into a vector space.

17. The method of claim 16 , further comprising:

determining if a distance of at least one of the vectors from a closest preexisting centroid is within a predetermined threshold distance.

18. A computer readable medium having stored thereon data representing a classifying pattern constructed using the method of claim 8 .

19. A classifying pattern constructed using the method of claim 8 .

20. The method of claim 8 , wherein the objects are known to be of a first state or a second state and the classifying pattern classifies objects by state.

Assignments (3)
SECURITY INTEREST Recorded Mar 24, 2016
From: VERMILLION, INC.
To: STATE OF CONNECTICUT DEPARTMENT OF ECONOMIC AND COMMUNITY DEVELOPMENT
Reel/Frame 038087/0448 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 15, 2012
From: CORRELOGIC SYSTEMS, INC.
To: VERMILLION, INC.
Reel/Frame 028209/0828 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 13, 2007
From: HITT, BEN A.
To: CORRELOGIC SYSTEMS, INC.
Reel/Frame 019158/0672 →
Continuity (4)
Continuation 1127343200 · Nov 15, 2005
Continuation 0988319600 · Jun 19, 2001
Provisional Application 6021240400 · Jun 19, 2000
Related Publication 20070185824A1 · Aug 9, 2007