A binning approach to quickest change detection with unknown post-change distribution
The problem of quickest detection of a change in distribution is considered under the assumption that the prechange distribution is known, and the postchange distribution is only known to belong to a family of distributions distinguishable from a discretized version of the prechange distribution. A...
Saved in:
Main Authors: | Lau, Tze Siong, Tay, Wee Peng, Veeravalli, Venugopal V. |
---|---|
Other Authors: | School of Electrical and Electronic Engineering |
Format: | Article |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/137146 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Quickest change detection under a nuisance change
by: Lau, Tze Siong, et al.
Published: (2020) -
Quickest change detection in the presence of a nuisance change
by: Lau, Tze Siong, et al.
Published: (2021) -
Asymptotically optimal sampling policy for quickest change detection with observation-switching cost
by: Lau, Tze Siong, et al.
Published: (2021) -
Operationally constrained quickest change detection with multiple post-change distributions
by: Lau, Tze Siong
Published: (2020) -
Discussion on "Quickest detection problems: Fifty years later" by Albert N. Shiryaev
by: Chan, H.P.
Published: (2014)