Detecting and ordering salient regions |
| |
Authors: | Larry Shoemaker Robert E Banfield Lawrence O Hall Kevin W Bowyer W Philip Kegelmeyer |
| |
Affiliation: | 1. Computer Science and Engineering, University of South Florida, Tampa, FL, 33620-5399, USA 2. Computer Science and Engineering, University of Notre Dame, South Bend, IN, 46556, USA 3. Sandia National Labs, Computer and Information Sciences, P.O. Box 969, MS 9951, Livermore, CA, 94551, USA
|
| |
Abstract: | We describe an ensemble approach to learning salient regions from arbitrarily partitioned data. The partitioning comes from the distributed processing requirements of large-scale simulations. The volume of the data is such that classifiers can train only on data local to a given partition. Since the data partition reflects the needs of the simulation, the class statistics can vary from partition to partition. Some classes will likely be missing from some or even most partitions. We combine a fast ensemble learning algorithm with scaled probabilistic majority voting in order to learn an accurate classifier from such data. Since some simulations are difficult to model without a considerable number of false positive errors, and since we are essentially building a search engine for simulation data, we order predicted regions to increase the likelihood that most of the top-ranked predictions are correct (salient). Results from simulation runs of a canister being torn and from a casing being dropped show that regions of interest are successfully identified in spite of the class imbalance in the individual training sets. Lift curve analysis shows that the use of data driven ordering methods provides a statistically significant improvement over the use of the default, natural time step ordering. Significant time is saved for the end user by allowing an improved focus on areas of interest without the need to conventionally search all of the data. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|