The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Scalable Techniques for Mining Causal Structures
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.
Integrity signals
Registry
Cites
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.
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
Mining association rules between sets of items in large databases
Agrawal, R., Imieliński, T., & Swami, A. (1993) · Proceedings of the 1993 ACM SIGMOD international conference on Management of data · doi:10.1145/170035.170072 · Cited by 14,907 · cited 2×
“An early approach, due to Agrawal et al. (1993), was to find a set of items that occur together often (that is, have high support ), and also have the property that one item often occurs in baskets containing the other items (that is, have high confidence ).”
BackgroundHapeman, D. E. (1991) · Technometrics · doi:10.1080/00401706.1991.10484817 · Cited by 9,373
Causation, Prediction, and Search
Spirtes, P., Glymour, C., & Scheines, R. (1993) · Lecture Notes in Statistics · doi:10.1007/978-1-4612-2748-9 · Cited by 4,617
A Bayesian method for the induction of probabilistic networks from data
Cooper, G. F., & Herskovits, E. (1992) · Machine Learning · doi:10.1007/bf00994110 · Cited by 4,204
Causal diagrams for empirical research
PEARL, J. (1995) · Biometrika · doi:10.1093/biomet/82.4.669 · Cited by 2,355 · cited 1×
“Two classes of technique have arisen: Bayesian causal discovery, which focuses on learning complete causal models for small data sets [8, 12, 14, 15, 16, 17, 21, 22, 23, 25, 26, 27], and an o shoot of the Bayesian learning method called constraint-based causal discovery, which use the data to limit | sometimes severel…”
MethodLearning Bayesian networks: The combination of knowledge and statistical data
Heckerman, D., Geiger, D., & Chickering, D. M. (1995) · Machine Learning · doi:10.1007/bf00994016 · Cited by 2,017
Mathematical Statistics With Applications
Meek, G. E. (1987) · Technometrics · doi:10.1080/00401706.1987.10488256 · Cited by 1,425
Beyond market baskets: generalizing association rules to correlations
Brin, S., Motwani, R., & Silverstein, C. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253327 · Cited by 1,281
Self-citationBayesian Networks for Data Mining
Heckerman, D. (1997) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009730122752 · Cited by 630
(1991) · Cited by 563
Cited by
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
Mining frequent patterns without candidate generation
Han, J., Pei, J., & Yin, Y. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335372 · Cited by 6,402
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
Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach
Han, J., Pei, J., Yin, Y., & Mao, R. (2004) · Data Mining and Knowledge Discovery · doi:10.1023/b:dami.0000005258.31418.83 · Cited by 2,629
The max-min hill-climbing Bayesian network structure learning algorithm
Tsamardinos, I., Brown, L. E., & Aliferis, C. F. (2006) · Machine Learning · doi:10.1007/s10994-006-6889-7 · Cited by 1,822
Frequent pattern mining: current status and future directions
Han, J., Cheng, H., Xin, D., & Yan, X. (2007) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-006-0059-1 · Cited by 1,380
Algorithms for association rule mining — a general survey and comparison
Hipp, J., Güntzer, U., & Nakhaeizadeh, G. (2000) · ACM SIGKDD Explorations Newsletter · doi:10.1145/360402.360421 · Cited by 962
Aliferis, C., Statnikov, A., Tsamardinos, I., Mani, S., & Koutsoukos, X. (2010) · doi:10.5555/1756006.1756013 · Cited by 469
Pruning and summarizing the discovered associations
Liu, B., Hsu, W., & Ma, Y. (1999) · Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/312129.312216 · Cited by 418
Finding interesting associations without support pruning
Cohen, E., Datar, M., Fujiwara, S., Gionis, A., Indyk, P., Motwani, R., Ullman, J. D., & Yang, C. (2001) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.908981 · Cited by 341
Self-citationMining frequent patterns by pattern-growth: methodology and implications
Han, J., & Pei, J. (2000) · ACM SIGKDD Explorations Newsletter · doi:10.1145/380995.381002 · Cited by 280
Constrained frequent pattern mining: a pattern-growth view
Pei, J., & Han, J. (2002) · ACM SIGKDD Explorations Newsletter · doi:10.1145/568574.568580 · Cited by 133
Causality and explanations in databases
Meliou, A., Roy, S., & Suciu, D. (2014) · Proceedings of the VLDB Endowment · doi:10.14778/2733004.2733070 · Cited by 73
Metadata
- Authors
- Silverstein, C., Brin, S., Motwani, R., & Ullman, J.
- Venue
- Data Mining and Knowledge Discovery
- Published
- 2000-07
- Volume
- 4
- Issue
- 2-3
- Pages
- 163-192
- ISSN
- 1384-5810 (ISSN-L)
- 1573-756X
- OpenAlex
- W1961009203
- Cited by
- 319
- References
- 19
- FWCI
- 19.16
- 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
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.