Sorry, you need to enable JavaScript to visit this website.

Performance Benchmarks for Detection Problems

Citation Author(s):
Kelsie Larson, Mireille Boutin
Submitted by:
Kelsie Larson
Last updated:
13 November 2017 - 12:58am
Document Type:
Presentation Slides
Document Year:
2017
Event:
Presenters:
Kelsie Larson
Paper Code:
GS-MLSP-O.1.1
 

We propose a benchmark curve that measures the inherent complexity of a detection problem. The benchmark curve is built using a sequence of simple detection methods based upon random projection. It is parameterized by the area above the receiver-operating characteristic curve of the detection method and its computational cost. It divides the plane into regions that can be used to characterize the computational and structural advantages of a given detection method. Numerical illustrations are provided.

up
0 users have voted: