Sequential anomaly detection with observation control under a generalized error metric

Aristomenis Tsopelakos, Georgios Fellouris
{"title":"Sequential anomaly detection with observation control under a generalized error metric","authors":"Aristomenis Tsopelakos, Georgios Fellouris","doi":"10.1109/ISIT44484.2020.9174081","DOIUrl":null,"url":null,"abstract":"The problem of sequential anomaly detection is considered under sampling constraints and generalized error control. It is assumed that there is no prior information on the number of anomalies. It is required to control the probability at least k errors, of any kind, upon stopping, where k is a user specified integer. It is possible to sample only a fixed number of processes at each sampling instance. The processes to be sampled are determined based on the already acquired observations. The goal is to find a procedure that consists of a stopping rule and a decision rule and a sampling rule that satisfy the sampling and error constraints, and have as small as possible average sample size for every possible scenario regarding the subset of anomalous processes. We characterize the optimal expected sample size for this problem to a first order approximation as the error probability vanishes to zero, and we propose procedures that achieve it. The performance of those procedures is compared in a simulation study for different values of k.","PeriodicalId":159311,"journal":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE International Symposium on Information Theory (ISIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT44484.2020.9174081","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

The problem of sequential anomaly detection is considered under sampling constraints and generalized error control. It is assumed that there is no prior information on the number of anomalies. It is required to control the probability at least k errors, of any kind, upon stopping, where k is a user specified integer. It is possible to sample only a fixed number of processes at each sampling instance. The processes to be sampled are determined based on the already acquired observations. The goal is to find a procedure that consists of a stopping rule and a decision rule and a sampling rule that satisfy the sampling and error constraints, and have as small as possible average sample size for every possible scenario regarding the subset of anomalous processes. We characterize the optimal expected sample size for this problem to a first order approximation as the error probability vanishes to zero, and we propose procedures that achieve it. The performance of those procedures is compared in a simulation study for different values of k.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
广义误差度量下具有观测控制的序列异常检测
研究了在采样约束和广义误差控制下的序列异常检测问题。假设没有关于异常数量的先验信息。要求在停止时控制至少k种错误的概率,其中k是用户指定的整数。在每个采样实例中可能只采样固定数量的进程。要采样的过程是根据已经获得的观察结果确定的。目标是找到一个过程,该过程由一个停止规则、一个决策规则和一个满足抽样和误差约束的抽样规则组成,并且对于关于异常过程子集的每个可能场景具有尽可能小的平均样本量。我们将该问题的最佳期望样本量表征为一阶近似,因为错误概率消失为零,并且我们提出了实现它的程序。在不同k值的模拟研究中比较了这些程序的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Community Detection with Secondary Latent Variables Capacity of Line-of-Sight MIMO Channels On the Randomized Babai Point A Universal Low Complexity Compression Algorithm for Sparse Marked Graphs An Ideal Secret Sharing Scheme Realizing an Access Structure Based on a Finite Projective Plane of Order 3
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1