Estimating Entropy and Entropy Norm on Data Streams

DOI10.1007/11672142_15MaRDI QIDQ5449798zbMATH OpenOpenAlexFDO

Authors

Publication date 19 March 2008

Published in STACS 2006 (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/euclid.im/1175266368

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Measures of information, entropy (94A17) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Estimating Entropy and Entropy Norm on Data Streams
• Estimating Entropy over Data Streams
• A near-optimal algorithm for estimating the entropy of a stream
• A near-optimal algorithm for computing the entropy of a stream
• Sublinear estimation of entropy and information distances

Cited in

(14)

• Estimating Entropy and Entropy Norm on Data Streams
• Space‐efficient tracking of persistent items in a massive data stream
• Optimal sampling from sliding windows
• Sorting streamed multisets
• Algorithms - ESA 2003
• Estimating Entropy over Data Streams
• scientific article; zbMATH DE number 5899438 (Why is no real title available?)
• Hierarchical sampling from sketches: Estimating functions over data streams
• Sketching information divergences
• A near-optimal algorithm for computing the entropy of a stream
• Streaming generalized cross entropy
• Compressed counting
• Sublinear estimation of entropy and information distances
• A near-optimal algorithm for estimating the entropy of a stream

This page was built for publication: Estimating Entropy and Entropy Norm on Data Streams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5449798)