On the public citation graph
Estimating Entropy and Entropy Norm on Data Streams
0 signed · 81 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-94-011-3488-0_5openalex-snapshot
MJRTY—A Fast Majority Vote Algorithm
inferredcites →https://doi.org/10.1016/j.jalgor.2003.12.001openalex-snapshot
An improved data stream summary: the count-min sketch and its applications
inferredcites →https://doi.org/10.1016/s0065-2458(08)60342-3openalex-snapshot
Communication Complexity
inferredcites →https://doi.org/10.1109/wetice.2005.35openalex-snapshot
Entropy Based Worm and Anomaly Detection in Fast IP Networks
inferredcites →https://doi.org/10.1145/1007568.1007575openalex-snapshot
Holistic UDAFs at streaming speeds
inferredcites →https://doi.org/10.1145/1060590.1060621openalex-snapshot
Optimal approximations of the frequency moments of data streams
inferredcites →https://doi.org/10.1145/1066157.1066159openalex-snapshot
Sampling algorithms in a stream operator
inferredcites →https://doi.org/10.1145/1080091.1080112openalex-snapshot
Profiling internet backbone traffic
inferredcites →https://doi.org/10.1145/1109557.1109637openalex-snapshot
Streaming and sublinear approximation of entropy and information distances
inferredcites →https://doi.org/10.1145/1330107.1330148openalex-snapshot
Detecting anomalies in network traffic using maximum entropy estimation
inferredcites →https://doi.org/10.1145/237814.237823openalex-snapshot
The space complexity of approximating the frequency moments
inferredcites →https://doi.org/10.1145/543613.543615openalex-snapshot
Models and issues in data stream systems
inferredcites →https://doi.org/10.1145/859716.859719openalex-snapshot
New directions in traffic measurement and accounting
inferredcites →https://doi.org/10.1561/9781933019604openalex-snapshot
Data Streams: Algorithms and Applications
inferredcites →https://doi.org/10.5555/1251086.1251118openalex-snapshot
Detecting anomalies in network traffic using maximum entropy estimation
inferredcites →https://doi.org/10.5555/982792.982815openalex-snapshot
An improved data stream algorithm for frequency moments
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/sam.11214openalex-snapshot
Space‐efficient tracking of persistent items in a massive data stream
inferred← citeshttps://doi.org/10.1002/widm.1115openalex-snapshot
Data stream mining in ubiquitous environments: state‐of‐the‐art and current directions
inferred← citeshttps://doi.org/10.1007/11841036_16openalex-snapshot
Estimating Entropy over Data Streams
inferred← citeshttps://doi.org/10.1007/978-3-030-89543-3_44openalex-snapshot
Symmetric Norm Estimation and Regression on Sliding Windows
inferred← citeshttps://doi.org/10.1007/978-3-540-74450-4_5openalex-snapshot
CR-precis: A Deterministic Summary Structure for Update Data Streams
inferred← citeshttps://doi.org/10.1007/978-3-642-18178-8_19openalex-snapshot
Summary-Invisible Networking: Techniques and Defenses
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_45openalex-snapshot
Arthur-Merlin Streaming Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-40328-6_43openalex-snapshot
A Tight Lower Bound for High Frequency Moment Estimation with Small Error
inferred← citeshttps://doi.org/10.1007/978-3-662-48054-0_16openalex-snapshot
Optimal Bounds for Estimating Entropy with PMF Queries
inferred← citeshttps://doi.org/10.1007/978-3-662-55696-2_1openalex-snapshot
Lightweight Metric Computation for Distributed Massive Data Streams
inferred← citeshttps://doi.org/10.1007/978-981-16-8325-1_6openalex-snapshot
Real-Time Network Behavior Analysis
inferred← citeshttps://doi.org/10.1007/s00453-008-9260-5openalex-snapshot
Hierarchical Sampling from Sketches: Estimating Functions over Data Streams
inferred← citeshttps://doi.org/10.1007/s00453-016-0194-zopenalex-snapshot
Improved Algorithms for Distributed Entropy Monitoring
inferred← citeshttps://doi.org/10.1007/s00778-007-0087-5openalex-snapshot
Online pairing of VoIP conversations
inferred← citeshttps://doi.org/10.1007/s13748-011-0002-6openalex-snapshot
A survey on learning from data streams: current and future trends
inferred← citeshttps://doi.org/10.1016/j.ic.2014.12.011openalex-snapshot
Arthur–Merlin streaming complexity
inferred← citeshttps://doi.org/10.1016/j.jcss.2011.04.004openalex-snapshot
Optimal sampling from sliding windows
inferred← citeshttps://doi.org/10.1049/el.2014.2377openalex-snapshot
Hardware‐assisted estimation of entropy norm for high‐speed network traffic
inferred← citeshttps://doi.org/10.1109/access.2022.3210336openalex-snapshot
Tabular Interpolation Approach Based on Stable Random Projection for Estimating Empirical Entropy of High-Speed Network Traffic
inferred← citeshttps://doi.org/10.1109/edcc.2012.9openalex-snapshot
AnKLe: Detecting Attacks in Large Scale Systems via Information Divergence
inferred← citeshttps://doi.org/10.1109/focs.2008.76openalex-snapshot
Sketching and Streaming Entropy via Approximation Theory
inferred← citeshttps://doi.org/10.1109/ipdpsw.2010.5470852openalex-snapshot
Distributed monitoring of conditional entropy for anomaly detection in streams
inferred← citeshttps://doi.org/10.1109/iwqos.2007.376561openalex-snapshot
Detecting Stealthy Spreaders Using Online Outdegree Histograms
inferred← citeshttps://doi.org/10.1109/mdm.2019.00-77openalex-snapshot
MR-Cubes: On-the-Fly Computation of Location Popularity from Check-in Data Streams
inferred← citeshttps://doi.org/10.1109/nca.2012.16openalex-snapshot
An Information Divergence Estimation over Data Streams
inferred← citeshttps://doi.org/10.1109/nca.2013.11openalex-snapshot
Sketch ⋆-Metric: Comparing Data Streams via Sketching
inferred← citeshttps://doi.org/10.1109/tic-sth.2009.5444396openalex-snapshot
Randomized algorithm based entropy norm computation in hardware for anomaly detection of IP data streams
inferred← citeshttps://doi.org/10.1109/titb.2012.2226905openalex-snapshot
A Framework for Daily Activity Monitoring and Fall Detection Based on Surface Electromyography and Accelerometer Signals
inferred← citeshttps://doi.org/10.1145/1140103.1140295openalex-snapshot
Data streaming algorithms for estimating entropy of network traffic
inferred← citeshttps://doi.org/10.1145/1140277.1140295openalex-snapshot
Data streaming algorithms for estimating entropy of network traffic
inferred← citeshttps://doi.org/10.1145/1298306.1298345openalex-snapshot
A data streaming algorithm for estimating entropies of od flows
inferred← citeshttps://doi.org/10.1145/1559795.1559818openalex-snapshot
Optimal sampling from sliding windows
inferred← citeshttps://doi.org/10.1145/1597036.1597038openalex-snapshot
Sublinear estimation of entropy and information distances
inferred← citeshttps://doi.org/10.1145/1798596.1798604openalex-snapshot
A near-optimal algorithm for estimating the entropy of a stream
inferred← citeshttps://doi.org/10.1145/1993636.1993733openalex-snapshot
Near-optimal private approximation protocols via a black box transformation
inferred← citeshttps://doi.org/10.1145/1993636.1993735openalex-snapshot
Fast moment estimation in data streams in optimal space
inferred← citeshttps://doi.org/10.1145/2002259.2002294openalex-snapshot
Space-efficient tracking of persistent items in a massive data stream
inferred← citeshttps://doi.org/10.1145/2432622.2432626openalex-snapshot
Testing Closeness of Discrete Distributions
inferred← citeshttps://doi.org/10.1145/2591796.2591812openalex-snapshot
Turnstile streaming algorithms might as well be linear sketches
inferred← citeshttps://doi.org/10.1145/3055399.3055424openalex-snapshot
Streaming symmetric norms via measure concentration
inferred← citeshttps://doi.org/10.1145/3400903.3400905openalex-snapshot
Accessible Streaming Algorithms for the Chi-Square Test
inferred← citeshttps://doi.org/10.1349/ddlp.334openalex-snapshot
Anomaly detection in network streams through a distributional lens
inferred← citeshttps://doi.org/10.17863/cam.104783openalex-snapshot
Arthur–Merlin streaming complexity
inferred← citeshttps://doi.org/10.31274/etd-180810-2263openalex-snapshot
Detecting exploit patterns from network packet streams
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2015.591openalex-snapshot
Universal Sketches for the Frequency Negative Moments and Other Decreasing Streaming Sums
inferred← citeshttps://doi.org/10.4230/lipics.disc.2019.33openalex-snapshot
Distributed Data Summarization in Well-Connected Networks
inferred← citeshttps://doi.org/10.48550/arxiv.0908.3961openalex-snapshot
A simple sketching algorithm for entropy estimation
inferred← citeshttps://doi.org/10.48550/arxiv.0910.1403openalex-snapshot
On the Sample Complexity of Compressed Counting
inferred← citeshttps://doi.org/10.48550/arxiv.0910.1495openalex-snapshot
Estimating Entropy of Data Streams Using Compressed Counting
inferred← citeshttps://doi.org/10.48550/arxiv.1004.3782openalex-snapshot
On Practical Algorithms for Entropy Estimation and the Improved Sample Complexity of Compressed Counting
inferred← citeshttps://doi.org/10.48550/arxiv.1009.5397openalex-snapshot
Testing Closeness of Discrete Distributions
inferred← citeshttps://doi.org/10.48550/arxiv.1403.6348openalex-snapshot
Updating Formulas and Algorithms for Computing Entropy and Gini Index from Time-Changing Data Streams
inferred← citeshttps://doi.org/10.48550/arxiv.1408.5096openalex-snapshot
Universal sketches for the frequency negative moments and other decreasing streaming sums
inferred← citeshttps://doi.org/10.48550/arxiv.1511.01111openalex-snapshot
Streaming Symmetric Norms via Measure Concentration
inferred← citeshttps://doi.org/10.48550/arxiv.1704.06710openalex-snapshot
Continuous monitoring of $\ell_p$ norms in data streams
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0610010openalex-snapshot
One-Pass, One-Hash n-Gram Statistics Estimation
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0702151openalex-snapshot
Succinct Sampling on Streams
inferred← citeshttps://doi.org/10.5555/1283383.1283418openalex-snapshot
A near-optimal algorithm for computing the entropy of a stream
inferred← citeshttps://doi.org/10.5821/dissertation-2117-94426openalex-snapshot
Load shedding in network monitoring applications
inferred← citeshttps://doi.org/10.7282/t33t9hm0openalex-snapshot
Streaming techniques for statistical modeling
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.