Learning with CASTLE
Lecture notes in computer sciencePublished 1 January 1991
Silvia Acid, Luis M. de Campos, Antonio González, Rafael Molina, Nicolás Pérez de la Blanca
Citations16
SJR quartileQ2
SJR score0.35
SNIP0.55
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The learning algorithms implemented in CASTLE, (Causal Structures From Inductive Learning), are described, to learn about causal structures from examples.
Abstract
We will describe here the learning algorithms we have implemented in CASTLE, (Causal Structures From Inductive Learning), to learn about causal structures from examples. A brief introduction to the software ifself and a description of what we intend to develop and implement in CASTLE are also given. Finally, the use of CASTLE is illustrated on a simple example.
Keywords
Computer Science
Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference
16,927 Citations1988Judea Pearl
The author provides a coherent explication of probability as a language for reasoning with partial belief and offers a unifying perspective on other AI approaches to uncertainty, such as the Dempster-Shafer formalism, truth maintenance systems, and nonmonotonic logic.
Series on software engineering and knowledge engineeringData Structures and Algorithms
2,131 Citations2003
The basis of this book is the material contained in the first six chapters of the earlier work, The Design and Analysis of Computer Algorithms, and has added material on algorithms for external storage and memory management.
Elsevier eBooksUncertainty in Artificial Intelligence
1,434 Citations1992
Qualitative Probabilistic Reasoning and Cognitive models, Dempster-Shafer Theory in Knowledge Representation, and Possibility Theory: Semantics and Applications.
Elsevier eBooksBAYESIAN INFERENCE
1,327 Citations1988Judea Pearl
The prevailing convention in the Bayesian formalism is to assume that probabilistic summaries of virtual evidence are produced independently of previous information; they are interpreted as local binary relations between the evidence and the hypothesis upon which it bears, independent of other information in the system.
ACM eBooksEquivalence and Synthesis of Causal Models
997 Citations2022TS Verma, Judea Pearl
The canonical representation presented here yields an efficient algorithm for determining when two embedded causal models reflect the same dependency information, which leads to a model theoretic definition of causation in terms of statistical dependencies.
Cambridge University Press eBooksStatistical Inference for Spatial Processes
741 Citations1988B. D. Ripley
NetworksSequential updating of conditional probabilities on directed graphical structures
533 Citations1990David J. Spiegelhalter, Steffen L. Lauritzen
It is shown how one can introduce imprecision into such probabilities as a data base of cases accumulates and how to take advantage of a range of well-established statistical techniques.
Machine intelligence and pattern recognitionProbabilistic Reasoning in Predictive Expert Systems
126 Citations1986David J. Spiegelhalter
Techniques in developing a coherent Probabilistic reasoning system are illustrated with reference to a simplified example and possible limitations of a formal probabilistic approach are discussed.
Journal of Applied StatisticsUsing spatial models as priors in astronomical image analysis
70 Citations1989Rafael Molina, B. D. Ripley
Journal of Applied StatisticsUsing spatial models as priors in astronomical image analysis
67 Citations1993Rafael Molina, B. D. Ripley