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

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

Building probabilistic networks: "Where do the numbers come from?" guest editors' introduction

Druzdzel, M.J., van der Gaag, L.C.·2000·IEEE Transactions on Knowledge and Data Engineering

Abstract

Probabilistic networks are now fairly well established as practical representations of knowledge for reasoning under uncertainty, as demonstrated by an increasing number of successful applications in such domains as (medical) diagnosis and prognosis, planning, vision, information retrieval, and natural language processing. A probabilistic network (also referred to as a belief network, Bayesian network, or, somewhat imprecisely, causal network) consists of a graphical structure, encoding a domain’s variables and the qualitative relationships between them, and a quantitative part, encoding probabilities over the variables [29]. Building a probabilistic network for a domain of application involves three tasks. The first of these is to identify the variables that are of importance, along with their possible values. Once the important domain variables have been identified, the second task is to identify the relationships between the variables discerned and to express these in a graphical structure. The tasks of eliciting the variables and values of importance as well as the relationships between them from domain experts is comparable, to at least some extent, to knowledge engineering for other artificial-intelligence representations and, although it may require significant effort, is generally considered doable. The last task in building a probabilistic network is to obtain the probabilities that are required for its quantitative part. This task often appears more daunting: “Where do the numbers come from?” is a commonly asked question. The three tasks in building a probabilistic network are, in principle, performed one after the other. Building a network, however, often requires a careful trade-off between the desire for a large and rich model to obtain accurate results on the one hand, and the costs of construction and maintenance and the complexity of probabilistic inference on the other hand. In practice, therefore, building a probabilistic network is a process that iterates over these tasks until a network results that is deemed requisite. In collaboration with Finn V. Jensen and Max Henrion, we organised in 1995 a workshop devoted to the theme of obtaining the numbers, the most daunting task in building probabilistic networks [14]. The workshop was held in conjunction with the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI’95) and had a programme of presentations of selected contributions and ample slots for flash communications and discussion. Scientists from such disciplines as decision analysis, statistics, and computer science attended the workshop. The interest in the workshop, both during IJCAI’95 and afterwards, prompted us to follow up on the theme. The current issue of IEEE Transactions on Data and Knowledge Engineering is the result.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tkde.2000.868901

Cites

27 of 27 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 27 references

Cited by

Metadata

Authors
Druzdzel, M. J., & van der Gaag, L. C.
Venue
IEEE Transactions on Knowledge and Data Engineering
Published
2000-07
Volume
12
Issue
4
Pages
481-486
ISSN
1041-4347 (ISSN-L)
OpenAlex
W2096242147
Cited by
268
References
27
FWCI
7.91
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.