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

Henry E. Kyburg Jr.

dblp:36/1747 · DBLP profile ↗
← Back
30ranked-venue papers
28as first author
0since 2021 · last 2012
—ORCID · none

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

Artificial intelligence and machine learning · 29 · 27 first-authorDatabases, data management, data science and information retrieval · 3 · 3 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-authorHuman-computer interaction and ubiquitous computing · 1 · 1 first-author

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.

Databases, data mining, and information retrieval
1 paper
Machine learning and data management · 67% Data mining · 33%
Artificial intelligence
5 papers
Knowledge representation and reasoning · 56% Probabilistic and Bayesian machine learning · 44%
Theoretical computer science
1 paper
Logic in computer science · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning and data management
statistical learning
0.012001
Statistical Considerations in Learning from Data · ICDM 2001
Machine learning and data management
uncertainty quantification
0.012001
Statistical Considerations in Learning from Data · ICDM 2001
Knowledge, reasoning and agents › Knowledge representation and reasoning
probabilistic reasoning
0.021991
Evidential Probability · IJCAI 1991
Objective Probabilities · IJCAI 1987
Knowledge, reasoning and agents › Knowledge representation and reasoning › uncertainty reasoning
belief functions
0.011991
Conditions for the Existence of Belief Functions Corresponding to Intervals of Belief · AAAI 1991
Logic in computer science
belief revision
0.011991
Conditions for the Existence of Belief Functions Corresponding to Intervals of Belief · AAAI 1991
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference › bayesian computation
bayesian updating
0.011987
Bayesian and Non-Bayesian Evidential Updating · Artif. Intell. 1987
Knowledge, reasoning and agents › Knowledge representation and reasoning › uncertainty reasoning
evidential reasoning
0.011987
Bayesian and Non-Bayesian Evidential Updating · Artif. Intell. 1987
Knowledge, reasoning and agents › Knowledge representation and reasoning › probabilistic reasoning
imprecise probability
0.011991
Conditions for the Existence of Belief Functions Corresponding to Intervals of Belief · AAAI 1991

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

classical statistics · 0.0bayesian statistics · 0.0interval of belief · 0.0belief function theory · 0.0dempster-shafer theory · 0.0convex sets of probabilities · 0.0
YearPublicationVenuePosition
2012 The logic of risky knowledge, reprised
Henry E. Kyburg Jr., Choh Man Teng 0001
Int. J. Approx. Reason.1
2006 Nonmonotonic Logic and Statistical Inference
abstract
Classical statistical inference is nonmonotonic: obtaining more evidence or obtaining more knowledge about the evidence one has can lead to the replacement of one statistical conclusion by another, or the complete withdrawal of the original conclusion. While it has long been argued that not all nonmonotonic inference can be accounted for in terms of relative frequencies or objective probabilities, there is no doubt that much nonmonotonic inference can be accounted for in this way. Here we seek to explore the close connection between classical statistical inference and default logic, treating statistical inference within the framework of default logic, and showing that nonmonotonic logic in general, and default logic in particular, needs to take account of certain features of statistical inference. Default logic must take account of statistics, but at the same time statistics can throw light on problematic cases of default inference.
Henry E. Kyburg Jr., Choh Man Teng 0001
Comput. Intell.1
2005 Judea Pearl, Causality, Cambridge University Press (2000)
Henry E. Kyburg Jr.
Artif. Intell.1
2002 Randomization and Uncertain Inference
Henry E. Kyburg Jr., Choh Man Teng 0001
PRICAI1
2001 Statistical Considerations in Learning from Data
abstract
In this paper, we focus on statistics. Classical statistics and Bayesian statistics are both employed in data mining. Both have advantages but both also have severe limitations in this context. We point out some of these limitations as well as some of the advantages. The fact that we may need to take account of evidence both internal and external to the data set presents a difficulty for classical statistics. The need to incorporate an objective measure of reliability creates a difficulty for Bayesian statistics. We outline an approach to uncertainty that promises to capture the best of both worlds by incorporating both background knowledge and objectivity.
Henry E. Kyburg Jr.
ICDM1
1999 Choosing Among Interpretations of Probability
Henry E. Kyburg Jr., Choh Man Teng 0001
UAI1
1999 Statistical Inference as Default Reasoning
abstract
Classical statistical inference is nonmonotonic in nature. We show how it can be formalized in the default logic framework. The structure of statistical inference is the same as that represented by default rules. In particular, the prerequisite corresponds to the sample statistics, the justifications require that we do not have any reason to believe that the sample is misleading, and the consequence corresponds to the conclusion sanctioned by the statistical test.
Henry E. Kyburg Jr., Choh Man Teng 0001
Int. J. Pattern Recognit. Artif. Intell.1
1997 Probabilistic Acceptance
Henry E. Kyburg Jr.
UAI1
1997 Combinatorial Semantics: Semantics for Frequent Validity
abstract
In ordinary first–order logic, a valid inference in a language L is one in which the conclusion is true in every model of the language in which the premises are true. To accommodate inductive/uncertain/probabilistic/nonmonotonic inference, we weaken that demand to the demand that the conclusion be true in a large proportion of the models in which the relevant premises are true. More generally, we say that an inference is [p,q] valid if its conclusion is true in a proportion lying between p and q of those models in which the relevant premises are true. If we include a statistical variable binding operator “%” in our language, there are many quite general (and useful) things we can say about uncertain validity. A surprising result is that some of these things may conflict with Bayesian conditionalization.
Henry E. Kyburg Jr.
Comput. Intell.1
1996 Uncertain Inferences and Uncertain Conclusions
Henry E. Kyburg Jr.
UAI1
1996 Set-based Bayesianism
abstract
Problems for strict and convex Bayesianism are discussed. A set-based Bayesianism generalizing convex Bayesianism and intervalism is proposed. This approach abandons not only the strict Bayesian requirement of a unique real-valued probability function in any decision-making context but also the requirement of convexity for a set-based representation of uncertainty. Levi's E-admissibility decision criterion is retained and is shown to be applicable in the nonconvex case.
Henry E. Kyburg Jr., Michael Pittarelli
IEEE Trans. Syst. Man Cybern. Part A1
1994 Believing on the Basis of the Evidence
abstract
Introduction Do you believe that the temperature is between 64F and 66F when your well calibrated thermometer reads 65.1F? Do you believe that it will rain tomorrow when the newspaper forecasts rain? Many of us would reply affirmatively to the first question and negatively to the second, claiming that on reflection what we believe about the weather is that the chance of rain is 'high'. The human lust for uniformity and generality, however, has led others to seek a single answer. The cautious philosophical probabilist might point to the theory of error according to which errors are distributed approximately normally to conclude that relative to the evidence, the probability is merely extremely high that the temperature is between 64F and 66 F. The pragmatist might argue that just as taking the temperature to be between 64F and 66F provides a perfectly adequate basis for deciding what clothes to wear, so having the paper forecast rain provides a perfectly adequate basis for postp
Henry E. Kyburg Jr.
Comput. Intell.1
1994 Logic, Science, and Engineering
Henry E. Kyburg Jr.
Comput. Intell.1
1992 Semantics for Probabilistic Inference
Henry E. Kyburg Jr.
UAI1
1992 Some Problems for Convex Bayesians
Henry E. Kyburg Jr., Michael Pittarelli
UAI1
1991 Conditions for the Existence of Belief Functions Corresponding to Intervals of Belief
John F. Lemmer, Henry E. Kyburg Jr.
AAAI2
1991 Evidential Probability
Henry E. Kyburg Jr.
IJCAI1
1991 A Modification to Evidential Probability
Bülent Murtezaoglu, Henry E. Kyburg Jr.
UAI2
1990 Beyond Specificity
Henry E. Kyburg Jr.
IPMU1
1988 Epistemological relevance and statistical knowledge
Henry E. Kyburg Jr.
UAI1
1988 Probabilistic inference and non-monotonic inference
Henry E. Kyburg Jr.
UAI1
1988 Liberty, license, and reason
Henry E. Kyburg Jr.
Comput. Intell.1
1988 Higher order probabilities and intervals
abstract
Many researchers have felt uncomfortable with the precision of degrees of belief that seems to be demanded by the subjective Bayesian treatment of uncertainty. Various responses have been suggested. The most common one has been to incorporate higher order probabilities in systems that reason in beliefs. These probabilities concern statements of first-order probability. Thus a first-order probability (e.g., the probability of heads on the next toss of this coin is 12) is the subject of a second-order probability; for example, the probability is .9 that the probability of heads on the next toss of this coin is 12. This approach is explored and is found to be epistemologically wanting, although there are important intuitions about beliefs that are captured by it. Furthermore, this approach may, in some circumstances, be computationally attractive. We also briefly explore a number of other approaches, including taking probabilities to be intervals and construing probability values as fuzzy sets.
Henry E. Kyburg Jr.
Int. J. Approx. Reason.1
1988 Higher order probabilities
Henry E. Kyburg Jr.
Int. J. Approx. Reason.1
1988 Objective probability
Henry E. Kyburg Jr.
Int. J. Approx. Reason.1
1987 Objective Probabilities
Henry E. Kyburg Jr.
IJCAI1
1987 Higher Order Probabilities
Henry E. Kyburg Jr.
UAI1
1987 Bayesian and Non-Bayesian Evidential Updating
abstract
Four main results are arrived at in this paper. (1) Closed convex sets of classical probability functions provide a representation of belief that includes the representations provided by Shafer probability mass functions as a special case. (2) The impact of “uncertain evidence” can be (formally) represented by Dempster conditioning, in Shafer's framework. (3) The impact of “uncertain evidence” can be (formally) represented in the framework of convex sets of classical probabilities by classical conditionalization. (4) The probability intervals that result from Dempster-Shafer updating on uncertain evidence are included in (and may be properly included in) the intervals that result from Bayesian updating on uncertain evidence.
Henry E. Kyburg Jr.
Artif. Intell.1
1986 Representing knowledge and evidence for decision
Henry E. Kyburg Jr.
IPMU1
1986 Knowledge
Henry E. Kyburg Jr.
UAI1