The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Proceedings of the 2017 SIAM International Conference on Data Mining
Abstract
Discovering the key structure of a database is one of the main goals of data mining.In pattern set mining we do so by discovering a small set of patterns that together describe the data well.The richer the class of patterns we consider, and the more powerful our description language, the better we will be able to summarise the data.In this paper we propose SQUISH, a novel greedy MDL-based method for summarising sequential data using rich patterns that are allowed to interleave.Experiments show SQUISHis orders of magnitude faster than the state of the art, results in better models, as well as discovers meaningful semantics in the form patterns that identify multiple choices of values.
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
Cites
Fast algorithms for mining association rules
Agrawal, R., & Srikant, R. (1998) · Cited by 11,307
Modeling by shortest data description
Rissanen, J. (1978) · Automatica · doi:10.1016/0005-1098(78)90005-5 · Cited by 6,011
A Universal Prior for Integers and Estimation by Minimum Description Length
Rissanen, J. (1983) · The Annals of Statistics · doi:10.1214/aos/1176346150 · Cited by 1,672
The Minimum Description Length Principle
Grünwald, P. D. (2007) · doi:10.7551/mitpress/4643.001.0001 · Cited by 1,644
An Introduction to Kolmogorov Complexity and Its Applications
Li, M., & Vitányi, P. (1993) · Springer eBooks · doi:10.1007/978-1-4757-3860-5 · Cited by 638
BIDE: efficient mining of frequent closed sequences
Wang, J., & Han, J. (2004) · Proceedings - International Conference on Data Engineering · doi:10.1109/icde.2004.1319986 · Cited by 616
Krimp: mining itemsets that compress
Vreeken, J., van Leeuwen, M., & Siebes, A. (2011) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-010-0202-x · Cited by 300
Kolmogorov's Structure Functions and Model Selection
Vereshchagin, N., & Vitanyi, P. M. B. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.838346 · Cited by 151
Discovering Frequent Arrangements of Temporal Intervals
Papapetrou, P., Kollios, G., Sclaroff, S., & Gunopulos, D. (2006) · Proceedings · doi:10.1109/icdm.2005.50 · Cited by 100
Discovering Frequent Closed Partial Orders from Strings
Pei, J., Wang, H., Liu, J., Wang, K., Wang, J., & Yu, P. S. (2006) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2006.172 · Cited by 90
Cited by
An overview of online fake news: Characterization, detection, and discussion
Zhang, X., & Ghorbani, A. A. (2020) · Information Processing & Management · doi:10.1016/j.ipm.2019.03.004 · Cited by 997
Ezugwu, A. E., Ikotun, A. M., Oyelade, O. O., Abualigah, L., Agushaka, J. O., Eke, C. I., & Akinyelu, A. A. (2022) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2022.104743 · Cited by 924
Automated machine learning: Review of the state-of-the-art and opportunities for healthcare
Waring, J., Lindvall, C., & Umeton, R. (2020) · Artificial Intelligence in Medicine · doi:10.1016/j.artmed.2020.101822 · Cited by 834
LSTM-based traffic flow prediction with missing data
Tian, Y., Zhang, K., Li, J., Lin, X., & Yang, B. (2018) · Neurocomputing · doi:10.1016/j.neucom.2018.08.067 · Cited by 544
Explaining anomalies detected by autoencoders using Shapley Additive Explanations
Antwarg, L., Miller, R. M., Shapira, B., & Rokach, L. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2021.115736 · Cited by 496
Metadata
- Venue
- Society for Industrial and Applied Mathematics eBooks
- Published
- 2017-06-09
- OpenAlex
- W3101951402
- Cited by
- 402
- References
- 13
- FWCI
- 32.58
- Type
- book
- 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: Proceedings of the 2017 SIAM International Conference on Data Mining. https://app.cochat.ai/papers/10.1137/1.9781611974973
- The paper
- Proceedings of the 2017 SIAM International Conference on Data Mining. (2017). Society for Industrial and Applied Mathematics eBooks. https://doi.org/10.1137/1.9781611974973
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.