A Computationally Efficient Algorithm for Quickest Change Detection in Anonymous Heterogeneous Sensor Networks

The problem of quickest change detection in anonymous heterogeneous sensor networks is studied. The sensors are clustered into K groups, and different groups follow different data generating distributions. At some unknown time, an event occurs in the network and changes the data generating distribut...

Celý popis

Podrobná bibliografia

Vydané v:	2021 IEEE International Symposium on Information Theory (ISIT) s. 599 - 604
Hlavní autori:	Sun, Zhongchang, Li, Qunwei, Zhang, Ruizhi, Zou, Shaofeng
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 12.07.2021
Predmet:	Approximation algorithms Change detection algorithms Computational efficiency Information theory
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!