Results 1  10
of
2,575,473
The Nature of Statistical Learning Theory
, 1999
"... Statistical learning theory was introduced in the late 1960’s. Until the 1990’s it was a purely theoretical analysis of the problem of function estimation from a given collection of data. In the middle of the 1990’s new types of learning algorithms (called support vector machines) based on the deve ..."
Abstract

Cited by 12976 (32 self)
 Add to MetaCart
Statistical learning theory was introduced in the late 1960’s. Until the 1990’s it was a purely theoretical analysis of the problem of function estimation from a given collection of data. In the middle of the 1990’s new types of learning algorithms (called support vector machines) based
Maximum likelihood from incomplete data via the EM algorithm
 JOURNAL OF THE ROYAL STATISTICAL SOCIETY, SERIES B
, 1977
"... A broadly applicable algorithm for computing maximum likelihood estimates from incomplete data is presented at various levels of generality. Theory showing the monotone behaviour of the likelihood and convergence of the algorithm is derived. Many examples are sketched, including missing value situat ..."
Abstract

Cited by 11807 (17 self)
 Add to MetaCart
A broadly applicable algorithm for computing maximum likelihood estimates from incomplete data is presented at various levels of generality. Theory showing the monotone behaviour of the likelihood and convergence of the algorithm is derived. Many examples are sketched, including missing value
Algorithms for dempstershafer theory
 Algorithms for Uncertainty and Defeasible Reasoning
, 2000
"... The method of reasoning with uncertain information known as DempsterShafer theory arose from the reinterpretation and development of work of Arthur Dempster [Dempster, 67; 68] by Glenn Shafer in his book a mathematical theory of evidence [Shafer, 76], and further publications e.g., [Shafer, 81; 90] ..."
Abstract

Cited by 20 (3 self)
 Add to MetaCart
The method of reasoning with uncertain information known as DempsterShafer theory arose from the reinterpretation and development of work of Arthur Dempster [Dempster, 67; 68] by Glenn Shafer in his book a mathematical theory of evidence [Shafer, 76], and further publications e.g., [Shafer, 81; 90
The DempsterShafer calculus for statisticians
 International Journal of Approximate Reasoning
, 2007
"... The DempsterShafer (DS) theory of probabilistic reasoning is presented in terms of a semantics whereby every meaningful formal assertion is associated with a triple (p, q, r) where p is the probability “for ” the assertion, q is the probability “against” the assertion, and r is the probability of “ ..."
Abstract

Cited by 46 (1 self)
 Add to MetaCart
The DempsterShafer (DS) theory of probabilistic reasoning is presented in terms of a semantics whereby every meaningful formal assertion is associated with a triple (p, q, r) where p is the probability “for ” the assertion, q is the probability “against” the assertion, and r is the probability
DempsterShafer theory of evidence
, 1994
"... comprehensive comparison between generalized incidence calculus and the ..."
Combination of evidence in DempsterShafer theory
, 2002
"... DempsterShafer theory offers an alternative to traditional probabilistic theory for the mathematical representation of uncertainty. The significant innovation of this framework is that it allows for the allocation of a probability mass to sets or intervals. DempsterShafer theory does not require a ..."
Abstract

Cited by 79 (2 self)
 Add to MetaCart
DempsterShafer theory offers an alternative to traditional probabilistic theory for the mathematical representation of uncertainty. The significant innovation of this framework is that it allows for the allocation of a probability mass to sets or intervals. DempsterShafer theory does not require
DempsterShafer Argument Schemes
"... Abstract. DempsterShafer theory, which can be regarded as a generalisation of probability theory, is a widely used formalism for reasoning with uncertain information. The application of the theory hinges on the use of a rule for combining evidence from different sources. A number of different comb ..."
Abstract
 Add to MetaCart
Abstract. DempsterShafer theory, which can be regarded as a generalisation of probability theory, is a widely used formalism for reasoning with uncertain information. The application of the theory hinges on the use of a rule for combining evidence from different sources. A number of different
A defect in DempsterShafer theory
 InProceedings of the Tenth Conference on Uncertainty in Arti cial Intelligence
, 1994
"... By analyzing the relationships among chance, weight of evidence and degree ofbelief, it is shown that the assertion \chances are special cases of belief functions " and the assertion \Dempster's rule can be used to combine belief functions based on distinct bodies of evidence " togeth ..."
Abstract

Cited by 28 (20 self)
 Add to MetaCart
; together lead to an inconsistency in DempsterShafer theory. To solve this problem, some fundamental postulates of the theory must be rejected. A new approach for uncertainty management is introduced, which shares many intuitive ideas with DS theory, while avoiding this problem. 1
DEMPSTERSHAFER INFERENCE WITH WEAK BELIEFS
"... Beliefs specified for predicting an unobserved realization of pivotal variables in the context of the fiducial and DempsterShafer (DS) inference can be weakened for credible inference. We consider predictive random sets for predicting an unobserved random sample from a known distribution, e.g., t ..."
Abstract

Cited by 15 (11 self)
 Add to MetaCart
Beliefs specified for predicting an unobserved realization of pivotal variables in the context of the fiducial and DempsterShafer (DS) inference can be weakened for credible inference. We consider predictive random sets for predicting an unobserved random sample from a known distribution, e
Results 1  10
of
2,575,473