The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Learning belief networks from data: an information theory based approach
Open accessAbstract
This paper presents an efficient algorithm for learning Bayesian belief networks from databases.The algorithm takes a database as input and constructs the belief network structure as output.The construction process is based on the computation of mutual information of attribute pairs.Given a data set that is large enough, this algorithm can generate a belief network very close to the underlying model, and at the same time, enjoys the time complexity of 0(N4) on conditional independence (CI) tests.When the data set has a normal DAG-Faithfil (see Section 3.2) probability distribution, the algorithm guarantees that the structure of a perfect map pearl, 19881 of the underlying dependency mode1 is generated.To evaluate this algorithm, we present the experimental results on three versions of the wellknown ALARM nehvork database, which has 37 attributes and 10,000 records.The results show that this algorithm is accurate and efficient.The proof of correctness and the analysis of computational complexity are also presented. 1 -*. 1 .
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
Friedman, N., Geiger, D., & Goldszmidt, M. (1997) · Machine Learning · doi:10.1023/a:1007465528199 · Cited by 4,742
Model Selection and Accounting for Model Uncertainty in Graphical Models Using Occam's Window
Madigan, D., & Raftery, A. E. (1994) · Journal of the American Statistical Association · doi:10.1080/01621459.1994.10476894 · Cited by 1,205 · cited 1×
“Therefore, instead of searching for a single best solution, their algorithms [Buntine, 1994; Madigan and Raftery, 1994; Madigan et al., 1994] return several networks and use the ‘average’ of these networks to perform belief propagation.”
Background
Cited by
(2006) · The MIT Press eBooks · doi:10.7551/mitpress/9780262033589.001.0001 · Cited by 4,280
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
Self-citationA survey of Bayesian Network structure learning
Kitson, N. K., Constantinou, A. C., Guo, Z., Liu, Y., & Chobtham, K. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-022-10351-w · Cited by 379
Bayesian networks in biomedicine and health-care
Lucas, P. J. F., van der Gaag, L. C., & Abu-Hanna, A. (2004) · Artificial Intelligence in Medicine · doi:10.1016/j.artmed.2003.11.001 · Cited by 334
CORDS: automatic discovery of correlations and soft functional dependencies
Ilyas, I. F., Markl, V., Haas, P., Brown, P., & Aboulnaga, A. (2004) · Proceedings of the 2004 ACM SIGMOD international conference on Management of data · doi:10.1145/1007568.1007641 · Cited by 315
Metadata
- Authors
- Cheng, J., Bell, D. A., & Liu, W.
- Venue
- Proceedings of the sixth international conference on Information and knowledge management
- Publisher
- ACM
- Published
- 1997-01
- Pages
- 325-331
- OpenAlex
- W2170653744
- Cited by
- 239
- References
- 2
- FWCI
- 1.59
- Type
- conference paper
- Language
- en
- Open access
- bronze
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: Learning belief networks from data: an information theory based approach. https://app.cochat.ai/papers/10.1145/266714.266920
- The paper
- Cheng, J., Bell, D. A., & Liu, W. (1997). Learning belief networks from data: an information theory based approach. Proceedings of the sixth international conference on Information and knowledge management. https://doi.org/10.1145/266714.266920
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.