Title :
Dynamic search under false alarms
Author :
Yixuan Zhai ; Qing Zhao
Author_Institution :
Electr. & Comput. Eng., Univ. of California, Davis, Davis, CA, USA
Abstract :
We consider the dynamic search of a target located in one of K cells. At each time, one cell is searched, and the search result is subject to false alarms. The objective is a policy that governs the sequential selection of the cells to minimize the error probability of detecting the whereabouts of the target within a fixed time horizon. We show that the optimal search policy is myopic in nature with a simple structure. The result finds applications in statistical fraud detection, anomaly localization, and target search.
Keywords :
fraud; probability; search problems; security of data; statistical analysis; K cells; anomaly localization; dynamic search; error probability; false alarm; optimal search policy; sequential selection; statistical fraud detection; target search; Computers; Equations; Error probability; Indexes; Search problems; Testing; Yttrium; Dynamic search; anomaly detection; target whereabouts;
Conference_Titel :
Global Conference on Signal and Information Processing (GlobalSIP), 2013 IEEE
Conference_Location :
Austin, TX
DOI :
10.1109/GlobalSIP.2013.6736850