【24h】

Asymptotically optimal search of unknown anomalies

机译:未知异常的渐近最优搜索

获取原文

摘要

The problem of detecting an anomalous process over multiple processes is considered. We consider a composite hypothesis case, in which the measurements drawn when observing a process follow a common distribution parameterized by an unknown parameter (vector). The unknown parameter belongs to one of two disjoint parameter spaces, depending on whether the process is normal or abnormal. The objective is a sequential search strategy that minimizes the expected detection time subject to an error probability constraint. We develop a deterministic search policy to solve the problem and prove its asymptotic optimality (as the error probability approaches zero) when the parameter under the null hypothesis is known. We further provide an explicit upper bound on the error probability for the finite sample regime.
机译:考虑了在多个过程中检测异常过程的问题。我们考虑一个复合假设的情况,在这种情况下,观察过程时得出的测量结果遵循由未知参数(向量)参数化的公共分布。未知参数属于两个不相交的参数空间之一,具体取决于过程是正常还是异常。目标是一种顺序搜索策略,该策略可将遭受错误概率约束的预期检测时间最小化。我们开发了确定性搜索策略来解决该问题,并在已知零假设下的参数时证明其渐近最优性(当错误概率接近零时)。我们进一步为有限样本制度的错误概率提供了一个明确的上限。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号