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

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Can we push more constraints into frequent pattern mining?

Pei, Jian, Han, Jiawei · 2000 · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining

Abstract

Article Can we push more constraints into frequent pattern mining? Share on Authors: Jian Pei School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada V5A 1S6 School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada V5A 1S6View Profile , Jiawei Han School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada V5A 1S6 School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada V5A 1S6View Profile Authors Info & Claims KDD '00: Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data miningAugust 2000 Pages 350–354https://doi.org/10.1145/347090.347166Online:01 August 2000Publication History 120citation852DownloadsMetricsTotal Citations120Total Downloads852Last 12 Months13Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

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.

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

Integrity signals

Registry

Crossref · 10.1145/347090.347166

Cites

1 of 1 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.

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.

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 1 references

Cited by

See all 191

Metadata

Authors
Pei, J., & Han, J.
Venue
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Publisher
ACM
Published
2000-08
Pages
350-354
OpenAlex
W1972870286
Cited by
191
References
1
FWCI
14.09
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: Can we push more constraints into frequent pattern mining? https://app.cochat.ai/papers/10.1145/347090.347166
The paper
Pei, J., & Han, J. (2000). Can we push more constraints into frequent pattern mining? Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining. https://doi.org/10.1145/347090.347166

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.