Discovery of Meaningful Rules in Time Series
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
The ability to make predictions about future events is at the heart of much of science; so, it is not surprising that prediction has been a topic of great interest in the data mining community for the last decade. Most of the previous work has attempted to predict the future based on the current value of a stream. However, for many problems the actual values are irrelevant, whereas the shape of the current time series pattern may foretell the future. The handful of research efforts that consider this variant of the problem have met with limited success. In particular, it is now understood that most of these efforts allow the discovery of spurious rules. We believe the reason why rule discovery in real-valued time series has failed thus far is because most efforts have more or less indiscriminately applied the ideas of symbolic stream rule discovery to real-valued rule discovery. In this work, we show why these ideas are not directly suitable for rule discovery in time series. Beyond our novel definitions/representations, which allow for meaningful and extendable specifications of rules, we further show novel algorithms that allow us to quickly discover high quality rules in very large datasets that accurately predict the occurrence of future events.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cites
The Opportunity challenge: A benchmark database for on-body sensor-based activity recognition
Chavarriaga, R., Sagha, H., Calatroni, A., Digumarti, S. T., Tröster, G., Millán, J. D. R., & Roggen, D. (2013) · Pattern Recognition Letters · doi:10.1016/j.patrec.2012.12.014 · Cited by 742 · cited 1×
“3 Finding Rules in an Activity Data Set We consider a benchmark data set that contains daily activity telemetry [23], of four subjects wearing seven inertial measurement units (IMUs).”
BackgroundAuditory feedback in learning and maintenance of vocal behaviour
Brainard, M. S., & Doupe, A. J. (2000) · Nature Reviews Neuroscience · doi:10.1038/35036205 · Cited by 314
Cited by
Generalizing DTW to the multi-dimensional case requires an adaptive approach
Shokoohi-Yekta, M., Hu, B., Jin, H., Wang, J., & Keogh, E. (2017) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-016-0455-0 · Cited by 320
Self-citationMobile Data Science and Intelligent Apps: Concepts, AI-Based Modeling and Research Directions
Sarker, I. H., Hoque, M. M., Uddin, M. K., & Alsanoosy, T. (2021) · Mobile Networks and Applications · doi:10.1007/s11036-020-01650-z · Cited by 207
Context-aware rule learning from smartphone data: survey, challenges and future directions
Sarker, I. H. (2019) · Journal of Big Data · doi:10.1186/s40537-019-0258-4 · Cited by 105
Steenwinckel, B., De Paepe, D., Vanden Hautte, S., Heyvaert, P., Bentefrit, M., Moens, P., Dimou, A., Van Den Bossche, B., De Turck, F., Van Hoecke, S., et al. (2021) · Future Generation Computer Systems · doi:10.1016/j.future.2020.10.015 · Cited by 102
Metadata
- Authors
- Shokoohi-Yekta, M., Chen, Y., Campana, B., Hu, B., Zakaria, J., & Keogh, E.
- Venue
- Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
- Publisher
- ACM
- Published
- 2015-08-10
- Pages
- 1085-1094
- OpenAlex
- W2002608093
- Cited by
- 82
- References
- 2
- FWCI
- 12.63
- 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: Discovery of Meaningful Rules in Time Series. https://app.cochat.ai/papers/10.1145/2783258.2783306
- The paper
- Shokoohi-Yekta, M., Chen, Y., Campana, B., Hu, B., Zakaria, J., & Keogh, E. (2015). Discovery of Meaningful Rules in Time Series. Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. https://doi.org/10.1145/2783258.2783306
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.