The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Time and sample efficient discovery of Markov blankets and direct causal relations
Abstract
Data Mining with Bayesian Network learning has two important characteristics: under conditions learned edges between variables correspond to casual influences, and second, for every variable T in the network a special subset (Markov Blanket) identifiable by the network is the minimal variable set required to predict T. However, all known algorithms learning a complete BN do not scale up beyond a few hundred variables. On the other hand, all known sound algorithms learning a local region of the network require an exponential number of training instances to the size of the learned region.The contribution of this paper is two-fold. We introduce a novel local algorithm that returns all variables with direct edges to and from a target variable T as well as a local algorithm that returns the Markov Blanket of T. Both algorithms (i) are sound, (ii) can be run efficiently in datasets with thousands of variables, and (iii) significantly outperform in terms of approximating the true neighborhood previous state-of-the-art algorithms using only a fraction of the training size required by the existing methods. A fundamental difference between our approach and existing ones is that the required sample depends on the generating graph connectivity and not the size of the local region; this yields up to exponential savings in sample relative to previously known algorithms. The results presented here are promising not only for discovery of local causal structure, and variable selection for classification, but also for the induction of complete BNs.
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
(1988) · Cited by 16,582
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
Causation, Prediction, and Search
Spirtes, P., Glymour, C., & Scheines, R. (2001) · doi:10.7551/mitpress/1754.001.0001 · Cited by 4,521
Toward optimal feature selection
Koller, D., & Sahami, M. (1996) · Cited by 1,482
Learning Bayesian networks from data: An information-theory based approach
Cheng, J., Greiner, R., Kelly, J., Bell, D., & Liu, W. (2002) · Artificial Intelligence · doi:10.1016/s0004-3702(02)00191-1 · Cited by 803
Probabilistic Reasoning in Expert Systems, Theory and Algorithms
Jones, P. W. (1992) · Technometrics · doi:10.1080/00401706.1992.10485240 · Cited by 632
Algorithms for Large Scale Markov Blanket Discovery
Tsamardinos, I., Aliferis, C., & Statnikov, A. (2003) · Cited by 438
Self-citationProbabilistic reasoning in expert systems
Neapolitan, R. E. (1990) · Cited by 392
Computation, Causation, and Discovery
(1999) · AAAI Press eBooks · doi:10.7551/mitpress/2006.001.0001 · Cited by 337
Bayesian Network Induction via Local Neighborhoods
Margaritis, D., & Thrun, S. (1999) · Cited by 313
Cited by
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
Self-citationWisdom of crowds for robust gene network inference
The DREAM5 Consortium, Marbach, D., Costello, J. C., Küffner, R., Vega, N. M., Prill, R. J., Camacho, D. M., Allison, K. R., Kellis, M., Collins, J. J., et al. (2012) · Nature Methods · doi:10.1038/nmeth.2016 · Cited by 1,667
Statnikov, A., Aliferis, C. F., Tsamardinos, I., Hardin, D., & Levy, S. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti033 · Cited by 839
Self-citationFeature deduction and ensemble design of intrusion detection systems
Chebrolu, S., Abraham, A., & Thomas, J. P. (2005) · Computers & Security · doi:10.1016/j.cose.2004.09.008 · Cited by 604
Aliferis, C., Statnikov, A., Tsamardinos, I., Mani, S., & Koutsoukos, X. (2010) · doi:10.5555/1756006.1756013 · Cited by 469
Self-citation
Metadata
- Authors
- Tsamardinos, I., Aliferis, C. F., & Statnikov, A.
- Venue
- Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2003-08-24
- Pages
- 673-678
- OpenAlex
- W2031779765
- Cited by
- 343
- References
- 12
- FWCI
- 5.16
- 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: Time and sample efficient discovery of Markov blankets and direct causal relations. https://app.cochat.ai/papers/10.1145/956750.956838
- The paper
- Tsamardinos, I., Aliferis, C. F., & Statnikov, A. (2003). Time and sample efficient discovery of Markov blankets and direct causal relations. Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining. https://doi.org/10.1145/956750.956838
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.