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

Bonnie Ray

dblp:63/3150 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2016
—ORCID · none

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

Artificial intelligence and machine learning · 2Software engineering, systems software and programming languages · 1Databases, 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
Probabilistic and Bayesian machine learning · 100%

Topics — the 2 heaviest of 2, 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.212014
A Myopic Approach to OrderingNodes for Parameter Elicitationin Bayesian Belief Networks · IEEE Trans. Knowl. Data Eng. 2014
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models › bayesian network
conditional probability table elicitation
0.212014
A Myopic Approach to OrderingNodes for Parameter Elicitationin Bayesian Belief Networks · IEEE Trans. Knowl. Data Eng. 2014

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

expected proximity criterion · 0.2dirichlet prior · 0.2
YearPublicationVenuePosition
2016 A semiparametric method for clustering mixed data
Alex Foss, Marianthi Markatou, Bonnie Ray, Aliza R. Heching
Mach. Learn.3
2014 A Myopic Approach to OrderingNodes for Parameter Elicitationin Bayesian Belief Networks
abstract
Building Bayesian belief networks in the absence of data involves the challenging task of eliciting conditional probabilities from experts to parameterize the model. In this paper, we develop an analytical method for determining the optimal order for eliciting these probabilities. Our method uses prior distributions on network parameters and a novel expected proximity criteria, to propose an order that maximizes information gain per unit elicitation time. We present analytical results when priors are uniform Dirichlet; for other priors, we find through experiments that the optimal order is strongly affected by which variables are of primary interest to the analyst. Our results should prove useful to researchers and practitioners involved in belief network model building and elicitation.
Debarun Bhattacharjya, Léa A. Deleris, Bonnie Ray
IEEE Trans. Knowl. Data Eng.3
2008 Supporting Reusable Component Selection with Use Case Gap-based Development Effort Estimation
Bonnie Ray, Chenhua Feng
SEKE2