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

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

Leakage in data mining: Formulation, detection, and avoidance

Kaufman, Shachar, Rosset, Saharon, Perlich, Claudia, Stitelman, Ori · 2012 · ACM Transactions on Knowledge Discovery from Data

Abstract

Deemed “one of the top ten data mining mistakes”, leakage is the introduction of information about the data mining target that should not be legitimately available to mine from. In addition to our own industry experience with real-life projects, controversies around several major public data mining competitions held recently such as the INFORMS 2010 Data Mining Challenge and the IJCNN 2011 Social Network Challenge are evidence that this issue is as relevant today as it has ever been. While acknowledging the importance and prevalence of leakage in both synthetic competitions and real-life data mining projects, existing literature has largely left this idea unexplored. What little has been said turns out not to be broad enough to cover more complex cases of leakage, such as those where the classical independently and identically distributed (i.i.d.) assumption is violated, that have been recently documented. In our new approach, these cases and others are explained by explicitly defining modeling goals and analyzing the broader framework of the data mining problem. The resulting definition enables us to derive general methodology for dealing with the issue. We show that it is possible to avoid leakage with a simple specific approach to data management followed by what we call a learn-predict separation, and present several ways of detecting leakage when the modeler has no control over how the data have been collected. We also offer an alternative point of view on leakage that is based on causal graph modeling concepts.

Overview

Integrity signals

Registry

Crossref · 10.1145/2382577.2382579

Cites

23 of 23 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Research works printed but not linked: 4

  1. Buneman P., Proceedings of the International Conference on Database Theory (ICDT'01)
  2. Kohavi R., Proceedings of the 5th WEBKDD Workshop.
  3. Laiy S. Xiang L. Diao R. Liu Y. Gu H. Xu L. Li H. Wang D. Liu K. Zhao J. etal 2011. Hybrid recommendation models for binary user preference prediction problem. http://jmir.csail.mit.edu/proceedings/papers/v18/lai12a/lai12a.pdf. Laiy S. Xiang L. Diao R. Liu Y. Gu H. Xu L. Li H. Wang D. Liu K. Zhao J. et al. 2011. Hybrid recommendation models for binary user preference prediction problem. http://jmir.csail.mit.edu/proceedings/papers/v18/lai12a/lai12a.pdf.
  4. 10.1002/sam.v3:4 · DOI

Cited by

See all 791

Metadata

Authors
Kaufman, S., Rosset, S., Perlich, C., & Stitelman, O.
Affiliations
  • Tel Aviv University (IL)
  • m6d
Venue
ACM Transactions on Knowledge Discovery from Data
Published
2012-12
Volume
6
Issue
4
Pages
1-21
ISSN
  • 1556-4681 (ISSN-L)
  • 1556-472X
OpenAlex
W2736287575
Cited by
791
References
29
Citations by year
2026: 357 · 2025: 90 · 2024: 81 · 2023: 70 · 2022: 66 · 2021: 47 · 2020: 25 · 2019: 24 · 2018: 14 · 2017: 7 · 2016: 6 · 2015: 2 · 2014: 2
FWCI
1.26
Type
journal article
Language
en
Open access
closed
Locations
ACM Transactions on Knowledge Discovery from Data (publishedVersion)
Funders
Israel Science Foundation (1227/09)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
  • Physical Sciences › Computer Science › Information Systems › Data Mining and Machine Learning Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
Keywords
data leakage, data mining, data mining competition, data management, leak detection

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

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.