Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 402

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

· 2017 · Society for Industrial and Applied Mathematics eBooks

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1137/1.9781611974973

Cites

13 of 13 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 13 references

Cited by

See all 402

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.