The DOI matches its Crossref record.
BRAID: stream mining through group lag correlations
Abstract
The goal is to monitor multiple numerical streams, and determine which pairs are correlated with lags, as well as the value of each such lag. Lag correlations (and anti-correlations) are frequent, and very interesting in practice: For example, a decrease in interest rates typically precedes an increase in house sales by a few months; higher amounts of fluoride in the drinking water may lead to fewer dental cavities, some years later. Additional settings include network analysis, sensor monitoring, financial data analysis, and moving object tracking. Such data streams are often correlated (or anti-correlated), but with an unknown lag.We propose BRAID, a method to detect lag correlations between data streams. BRAID can handle data streams of semi-infinite length, incrementally, quickly, and with small resource consumption. We also provide a theoretical analysis, which, based on Nyquist's sampling theorem, shows that BRAID can estimate lag correlations with little, and often with no error at all. Our experiments on real and realistic data show that BRAID detects the correct lag perfectly most of the time (the largest relative error was about 1%); while it is up to 40,000 times faster than the naive implementation.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
k-Shape: Efficient and Accurate Clustering of Time Series
Paparrizos, J., & Gravano, L. (2015) · Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2723372.2737793 · Cited by 680
Rise and fall patterns of information diffusion: model and implications
Matsubara, Y., Sakurai, Y., Prakash, B. A., Li, L., & Faloutsos, C. (2012) · Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2339530.2339537 · Cited by 306
Self-citationLogical-shapelets: an expressive primitive for time series classification
Mueen, A., Keogh, E., & Young, N. (2011) · Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2020408.2020587 · Cited by 282
Incremental tensor analysis: Theory and applications
Sun, J., Tao, D., Papadimitriou, S., Yu, P. S., & Faloutsos, C. (2008) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1409620.1409621 · Cited by 254
Self-citationMFRL-CA: Microservice Fault Root Cause Location based on Correlation Analysis
Chen, Y., Chen, N., Xu, W., Lian, L., & Tu, H. (2021) · 2021 8th International Conference on Dependable Systems and Their Applications (DSA) · doi:10.1109/dsa52907.2021.00018 · Cited by 9
Metadata
- Authors
- Sakurai, Y., Papadimitriou, S., & Faloutsos, C.
- Venue
- Proceedings of the 2005 ACM SIGMOD international conference on Management of data
- Publisher
- ACM
- Published
- 2005-06-14
- Pages
- 599-610
- ISSN
- 0730-8078 (ISSN-L)
- OpenAlex
- W2058437258
- Cited by
- 166
- References
- 0
- FWCI
- 9.18
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: BRAID: stream mining through group lag correlations. https://app.cochat.ai/papers/10.1145/1066157.1066226
- The paper
- Sakurai, Y., Papadimitriou, S., & Faloutsos, C. (2005). BRAID: stream mining through group lag correlations. Proceedings of the 2005 ACM SIGMOD international conference on Management of data. https://doi.org/10.1145/1066157.1066226
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.