METHOD FOR IMPROVING CLASSIFICATION RESULTS OF A CLASSIFIER
First Claim
1. A method for improving classification results of a classifier including:
- receiving, using a processor, classification results for a plurality of elements that have been classified by a classifier as one of a plurality of classes,constructing, using a processor, a graph having a plurality of nodes, each node corresponding to one of the elements, and a plurality of labels, each label corresponding to one of the classes,adding, using a processor, edges between nodes corresponding to related elements,adding, using a processor, edges between each node and each label, andusing a graph cut algorithm to cut edges to a node and partition the graph into classes, the graph cut algorithm using as input the classification results for the element corresponding to that node and related elements.
2 Assignments
0 Petitions
Accused Products
Abstract
A method for improving classification results of a classifier including receiving classification results for a plurality of elements that have been classified by a classifier as one of a plurality of classes, constructing a graph having a plurality of nodes, each node corresponding to one of the elements, and a plurality of labels, each label corresponding to one of the classes, adding edges between nodes corresponding to related elements, adding edges between each node and each label, and using a graph cut algorithm to cut edges to a node and partition the graph into classes, the graph cut algorithm using as input the classification results for the element corresponding to that node and related elements.
-
Citations
20 Claims
-
1. A method for improving classification results of a classifier including:
-
receiving, using a processor, classification results for a plurality of elements that have been classified by a classifier as one of a plurality of classes, constructing, using a processor, a graph having a plurality of nodes, each node corresponding to one of the elements, and a plurality of labels, each label corresponding to one of the classes, adding, using a processor, edges between nodes corresponding to related elements, adding, using a processor, edges between each node and each label, and using a graph cut algorithm to cut edges to a node and partition the graph into classes, the graph cut algorithm using as input the classification results for the element corresponding to that node and related elements. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17)
-
-
18. (canceled)
-
19. A non-transitory computer readable media including software for use with a computer including a processor and memory for storing the software, the software including a series of instructions executable by the processor to carry out a method for improving classification results of a classifier, the method including:
-
receiving, using a processor, classification results for a plurality of elements that have been classified by a classifier as one of a plurality of classes, constructing, using a processor, a graph having a plurality of nodes, each node corresponding to one of the elements, and a plurality of labels, each label corresponding to one of the classes, adding, using a processor, edges between nodes corresponding to related elements, adding, using a processor, edges between each node and each label, and using a graph cut algorithm to cut edges to a node and partition the graph into classes, the graph cut algorithm using as input the classification results for the element corresponding to that node and related elements.
-
-
20. Apparatus including
a processor; -
a memory; and software resident in memory accessible to the processor, the software including a series of instructions executable by the processor to carry out a method for improving classification results of a classifier, the method including; receiving, using a processor, classification results for a plurality of elements that have been classified by a classifier as one of a plurality of classes, constructing, using a processor, a graph having a plurality of nodes, each node corresponding to one of the elements, and a plurality of labels, each label corresponding to one of the classes, adding, using a processor, edges between nodes corresponding to related elements, adding, using a processor, edges between each node and each label, and using a graph cut algorithm to cut edges to a node and partition the graph into classes, the graph cut algorithm using as input the classification results for the element corresponding to that node and related elements.
-
Specification