Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jose Galan Caballero

dblp:20/2489 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2007
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Knowledge representation and reasoning · 56% Probabilistic and Bayesian machine learning · 44%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models
bayesian network
0.112007
Using Ranked Nodes to Model Qualitative Judgments in Bayesian Networks · IEEE Trans. Knowl. Data Eng. 2007
Knowledge, reasoning and agents › Knowledge representation and reasoning › probabilistic reasoning
ranked nodes
0.112007
Using Ranked Nodes to Model Qualitative Judgments in Bayesian Networks · IEEE Trans. Knowl. Data Eng. 2007
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge acquisition
expert knowledge elicitation
0.012007
Using Ranked Nodes to Model Qualitative Judgments in Bayesian Networks · IEEE Trans. Knowl. Data Eng. 2007

Methods — techniques the papers use, named apart from their topics

expert elicitation · 0.1doubly truncated normal distribution · 0.1
YearPublicationVenuePosition
2007 Using Ranked Nodes to Model Qualitative Judgments in Bayesian Networks
abstract
Although Bayesian Nets (BNs) are increasingly being used to solve real world risk problems, their use is still constrained by the difficulty of constructing the node probability tables (NPTs). A key challenge is to construct relevant NPTs using the minimal amount of expert elicitation, recognising that it is rarely cost-effective to elicit complete sets of probability values. We describe a simple approach to defining NPTs for a large class of commonly occurring nodes (called ranked nodes). The approach is based on the doubly truncated Normal distribution with a central tendency that is invariably a type of weighted function of the parent nodes. In extensive real-world case studies we have found that this approach is sufficient for generating the NPTs of a very large class of nodes. We describe one such case study for validation purposes. The approach has been fully automated in a commercial tool, called AgenaRisk, and is thus accessible to all types of domain experts. We believe this work represents a useful contribution to BN research and technology since its application makes the difference between being able to build realistic BN models and not.
Norman E. Fenton, Martin Neil, Jose Galan Caballero
IEEE Trans. Knowl. Data Eng.3