Abstract
ABSTRACTThe quickest multidecision change detection/isolation problem is the generalization of the quickest changepoint detection problem to the case of M post-change hypotheses. It is necessary to detect the change in distribution as soon as possible and to indicate which hypothesis is true after a change occurs. Both the rate of false alarms and the misidentification (false isolation) rate should be controlled by given levels. Several detection/isolation procedures that asymptotically minimize the tradeoff between the expected detection delay and the false alarm/false isolation rates in the worst-case scenario are discussed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
