University of Cambridge > Talks.cam > Optimization and Incentives Seminar > Efficient entropy-based detection of change-points in streaming data

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Efficient entropy-based detection of change-points in streaming data

Download to your calendar using vCal

If you have a question about this talk, please contact Elena Yudovina .

It is well-known that the entropy of an unknown stationary source can be consistently estimated using an estimator based on the lengths of long repeated sections of text. I will discuss a method for detecting change points in data sources based on similar information theory-based quantities. I will present the results of some simulations and theoretical results based on properties of the typical set which justify how successful this method can be.

Joint work with Oliver Johnson, Dino Sejdinovic, Christophe Andrieu, Ayalvadi Ganesh and Robert Piechocki

This talk is part of the Optimization and Incentives Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Stephen Roskill Memorial Lecture Average on weekdays: 8881.54032258 kWh 2D and 3D Heterogeneous Photonic Integration for Future Information Systems - Professor S. J. Ben Yoo, University of California

Other talks

Rothschild Public Lecture: The Quantum Centenary: from Order to Chaos Talk TBC  Life, death, and the discovery of PDAR: the Pol II Degradation-dependent Apoptotic Response  Title to be confirmed Coming soon Title to be confirmed
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity