DocumentCode :
1458410
Title :
Information bounds and quick detection of parameter changes in stochastic systems
Author :
Lai, Tze Leung
Author_Institution :
Dept. of Stat., Stanford Univ., CA, USA
Volume :
44
Issue :
7
fYear :
1998
fDate :
11/1/1998 12:00:00 AM
Firstpage :
2917
Lastpage :
2929
Abstract :
By using information-theoretic bounds and sequential hypothesis testing theory, this paper provides a new approach to optimal detection of abrupt changes in stochastic systems. This approach not only generalizes previous work in the literature on optimal detection far beyond the relatively simple models treated but also suggests alternative performance criteria which are more tractable and more appropriate for general stochastic systems. In addition, it leads to detection rules which have manageable computational complexity for on-line implementation and yet are nearly optimal under the different performance criteria considered
Keywords :
computational complexity; information theory; stochastic processes; abrupt changes; computational complexity; detection rules; information bounds; on-line implementation; parameter changes; performance criteria; quick detection; sequential hypothesis testing; stochastic systems; Computational complexity; Constraint theory; Delay; Density functional theory; Detectors; Fault detection; Helium; Sequential analysis; Statistical distributions; Stochastic systems;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.737522
Filename :
737522
Link To Document :
بازگشت