The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A Simple Constraint-Based Algorithm for Efficiently Mining Observational Databases for Causal Relationships
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
Causal diagrams for empirical research
PEARL, J. (1995) · Biometrika · doi:10.1093/biomet/82.4.669 · Cited by 2,355 · cited 1×
“The following is a definition of d-separation (Pearl, 1994): Let A, B, and C be disjoint subsets of the nodes in S.”
Background
Cited by
Mining the network value of customers
Domingos, P., & Richardson, M. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502525 · Cited by 2,830
Causal Inference by using Invariant Prediction: Identification and Confidence Intervals
Peters, J., Bühlmann, P., & Meinshausen, N. (2016) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/rssb.12167 · Cited by 643
Aliferis, C., Statnikov, A., Tsamardinos, I., Mani, S., & Koutsoukos, X. (2010) · doi:10.5555/1756006.1756013 · Cited by 469
The Role of Occam's Razor in Knowledge Discovery
Domingos, P. (1999) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009868929893 · Cited by 459
Scalable Techniques for Mining Causal Structures
Silverstein, C., Brin, S., Motwani, R., & Ullman, J. (2000) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009891813863 · Cited by 319
Metadata
- Authors
- Cooper, G. F.
- Venue
- Data Mining and Knowledge Discovery
- Published
- 1997-06
- Volume
- 1
- Issue
- 2
- Pages
- 203-224
- ISSN
- 1384-5810 (ISSN-L)
- 1573-756X
- OpenAlex
- W1596022446
- Cited by
- 166
- References
- 1
- FWCI
- 1.43
- Type
- journal article
- 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: A Simple Constraint-Based Algorithm for Efficiently Mining Observational Databases for Causal Relationships. https://app.cochat.ai/papers/10.1023/a:1009787925236
- The paper
- Cooper, G. F. (1997). A Simple Constraint-Based Algorithm for Efficiently Mining Observational Databases for Causal Relationships. Data Mining and Knowledge Discovery. https://doi.org/10.1023/a%3A1009787925236
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.