Learning with a Non-Exhaustive Training Dataset: Detection of Bacteria Cultures Using Optical-Scattering Technology
Description
For a training dataset with a nonexhaustive list of classes, i.e. some classes are not yet known and hence are not represented, the resulting learning problem is ill-defined. In this case a sample from a missing class is incorrectly classified to one of the existing classes. For some applications the cost of misclassifying a sample could be negligible. However, the significance of this problem can better be acknowledged when the potentially undesirable consequences of incorrectly classifying a food pathogen as a nonpathogen are considered. Our research is directed towards the real-time detection of food pathogens using optical-scattering technology. Bacterial colonies consisting of the progeny of a single parent cell scatter light at 635 nm to produce unique forward-scatter signatures. These spectral signatures contain descriptive characteristics of bacterial colonies, which can be used to identify bacteria cultures in real time. One bottleneck that remains to be addressed is the nonexhaustive nature of the training library. It is very difficult if not impractical to collect samples from all possible bacteria colonies and construct a digital library with an exhaustive set of scatter signatures. This study deals with the real-time detection of samples from a missing class and the associated problem of learning with a nonexhaustive training dataset. Our proposed method assumes a common prior for the set of all classes, known and missing. The parameters of the prior are estimated from the samples of the known classes. This prior is then used to generate a large number of samples to simulate the space of missing classes. Finally a Bayesian maximum likelihood classifier is implemented using samples from real as well as simulated classes. Experiments performed with samples collected for 28 bacteria subclasses favor the proposed approach over the state of the art.
| Slides | |
| 0:00 | Learning with a Non-exhaustive Training Dataset |
| 0:21 | Outline |
| 0:37 | Outline - Motivation |
| 0:39 | Non-exhaustive Training Dataset (1) |
| 1:31 | Non-exhaustive Training Dataset (2) |
| 1:47 | Non-exhaustive Training Dataset (3) |
| 1:53 | Non-exhaustive Training Dataset (4) |
| 2:36 | Non-exhaustive training set: An Ill-Defined setting (1) |
| 2:38 | Non-exhaustive training set: An Ill-Defined setting (2) |
| 2:43 | Non-exhaustive training set: An Ill-Defined setting (3) |
| 2:56 | Non-exhaustive training set: An Ill-Defined setting (4) |
| 3:03 | Non-exhaustive training set: An Ill-Defined setting (5) |
| 3:14 | An Illustrative Example |
| 3:48 | Outline - Motivation |
| 3:54 | Recent food outbreaks (1) |
| 4:14 | Recent food outbreaks (2) |
| 4:20 | Recent food outbreaks (3) |
| 4:25 | Recent food outbreaks (4) |
| 4:38 | Recent food outbreaks (5) |
| 4:43 | Traditional bacteria recognition methods (1) |
| 4:55 | Traditional bacteria recognition methods (2) |
| 5:04 | Traditional bacteria recognition methods (3) |
| 5:27 | BARDOT: BActeria Rapid Detection using Optical scattering Technology |
| 6:30 | Feature Extraction and Classification (1) |
| 6:46 | Feature Extraction and Classification (2) |
| 6:51 | Feature Extraction and Classification (3) |
| 7:21 | Training library of bacteria colonies (1) |
| 7:35 | Training library of bacteria colonies (2) |
| 7:43 | Training library of bacteria colonies (3) |
| 8:51 | Training library of bacteria colonies (4) |
| 9:01 | Outline - Motivation |
| 9:03 | Traditional Supervised Classification (1) |
| 9:45 | Traditional Supervised Classification (2) |
| 9:57 | Traditional Supervised Classification (3) |
| 9:59 | Non-exhaustive learning vs. Anomaly Detection (1) |
| 10:33 | Non-exhaustive learning vs. Anomaly Detection (2) |
| 10:46 | Non-exhaustive learning vs. Anomaly Detection (3) |
| 11:09 | Non-exhaustive learning vs. Novelty Detection [2, 3] (1) |
| 11:20 | Non-exhaustive learning vs. Novelty Detection [2, 3] (2) |
| 11:23 | Non-exhaustive learning vs. Novelty Detection [2, 3] (3) |
| 11:29 | Non-exhaustive learning vs. Novelty Detection [2, 3] (4) |
| 11:39 | Support Vector Domain Description (1) |
| 12:14 | Support Vector Domain Description (2) |
| 12:41 | Density Based Models (1) |
| 12:47 | Density Based Models (2) |
| 13:00 | Density Based Models (3) |
| 13:07 | Density Based Models (4) |
| 13:18 | Outline - Proposed Approach |
| 13:23 | Notation (1) |
| 13:29 | Notation (2) |
| 13:31 | Notation (3) |
| 13:33 | Notation (4) |
| 13:41 | Notation (5) |
| 13:53 | Notation (6) |
| 14:03 | Notation (7) |
| 14:10 | Notation (8) |
| 14:16 | Outline - Proposed Approach |
| 14:22 | Maximum Likelihood Decision Function |
| 15:28 | Class Modeling (1) |
| 15:33 | Class Modeling (2) |
| 15:45 | Class Modeling (3) |
| 16:07 | Class Modeling (4) |
| 16:50 | Simulating Unknown Classes (1) |
| 16:55 | Simulating Unknown Classes (2) |
| 17:12 | Simulating Unknown Classes (3) |
| 17:44 | Simulating Unknown Classes (4) |
| 17:57 | Outline - Proposed Approach |
| 17:59 | Algorithm for Training |
| 18:40 | Algorithm for Detection |
| 19:30 | Outline - Experimental Results |
| 19:32 | Bacteria Dataset |
| 20:02 | Outline - Experimental Results |
| 20:04 | Make Titles Informative. (1) |
| 20:07 | Make Titles Informative. (2) |
| 20:09 | Make Titles Informative. (3) |
| 20:32 | Make Titles Informative. (4) |
| 20:35 | Make Titles Informative. (5) |
| 20:37 | Make Titles Informative. (6) |
| 20:43 | Outline - Experimental Results |
| 20:46 | Make Titles Informative.(1) |
| 20:50 | Make Titles Informative.(2) |
| 20:52 | Make Titles Informative.(3) |
| 20:54 | Make Titles Informative.(4) |
| 21:08 | Make Titles Informative.(5) |
| 21:10 | Outline - Experimental Results |
| 21:11 | ROC Curves |
| 22:02 | Conclusions (1) |
| 22:08 | Conclusions (2) |
| 22:12 | Conclusions (3) |
| 22:15 | Conclusions (4) |
| 22:33 | Conclusions (5) |
| 23:23 | For Further Reading I |
| 23:25 | For Further Reading II |
Lecture rating
| People found this lecture: | ||
| Worth seeing | ||
| because it is: | ||
| Valuable and informative | ||
| Well presented | ||
| Easily understandable | ||
| Acceptably recorded | ||
| You need to login to cast your vote. | ||
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Related content
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !



