{"title":"未知异常的渐近最优搜索","authors":"Bar Hemo, Kobi Cohen, Qing Zhao","doi":"10.1109/ISSPIT.2016.7886012","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":371691,"journal":{"name":"2016 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Asymptotically optimal search of unknown anomalies\",\"authors\":\"Bar Hemo, Kobi Cohen, Qing Zhao\",\"doi\":\"10.1109/ISSPIT.2016.7886012\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":371691,\"journal\":{\"name\":\"2016 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISSPIT.2016.7886012\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSPIT.2016.7886012","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
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.