Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
10,759
CONFIDENCE INTERVALS FOR AVERAGE SUCCESS PROBABILITIES∗ BY
"... Abstract. We provide Buehler-optimal one-sided and valid two-sided confidence intervals for the average success probability of a possibly inho-mogeneous fixed length Bernoulli chain, based on the number of observed successes. Contrary to some claims in the literature, the one-sided Clopper– Pearson ..."
Abstract
- Add to MetaCart
Abstract. We provide Buehler-optimal one-sided and valid two-sided confidence intervals for the average success probability of a possibly inho-mogeneous fixed length Bernoulli chain, based on the number of observed successes. Contrary to some claims in the literature, the one-sided Clopper– Pearson
Estimation of probabilities from sparse data for the language model component of a speech recognizer
- IEEE Transactions on Acoustics, Speech and Signal Processing
, 1987
"... Abstract-The description of a novel type of rn-gram language model is given. The model offers, via a nonlinear recursive procedure, a com-putation and space efficient solution to the problem of estimating prob-abilities from sparse data. This solution compares favorably to other proposed methods. Wh ..."
Abstract
-
Cited by 799 (2 self)
- Add to MetaCart
. While the method has been developed for and suc-cessfully implemented in the IBM Real Time Speech Recognizers, its generality makes it applicable in other areas where the problem of es-timating probabilities from sparse data arises. Sparseness of data is an inherent property of any real text
The illusion of Control
- Journal of Personality and Social Psychology
, 1975
"... A series of studies was conducted to elucidate a phenomenon here referred to as the "illusion of control. " An illusion of control was denned as an ex-pectancy of a personal success probability inappropriately higher than the ob-jective probability would warrant. It was predicted that fact ..."
Abstract
-
Cited by 607 (1 self)
- Add to MetaCart
A series of studies was conducted to elucidate a phenomenon here referred to as the "illusion of control. " An illusion of control was denned as an ex-pectancy of a personal success probability inappropriately higher than the ob-jective probability would warrant. It was predicted
Success Probability Assessment Based on Information Entropy
, 2009
"... The Bayesian method is superior to the classical statistical method on condition of small sample test. However, its evaluation results are not so good if subjective prior information is intervened. The success probability assessment about the success or failure tests of weapon products focussed in t ..."
Abstract
- Add to MetaCart
The Bayesian method is superior to the classical statistical method on condition of small sample test. However, its evaluation results are not so good if subjective prior information is intervened. The success probability assessment about the success or failure tests of weapon products focussed
On Field Size and Success Probability in Network Coding
"... Abstract. Using tools from algebraic geometry and Gröbner basis theory we solve two problems in network coding. First we present a method to determine the smallest field size for which linear network coding is feasible. Second we derive improved estimates on the success probability of random linear ..."
Abstract
- Add to MetaCart
Abstract. Using tools from algebraic geometry and Gröbner basis theory we solve two problems in network coding. First we present a method to determine the smallest field size for which linear network coding is feasible. Second we derive improved estimates on the success probability of random linear
Generalized Hypothesis Testing and Maximizing the Success Probability
- in Financial Markets, Proceedings of the International Conference on Business Intelligence and Financial Engineering (ICBIFE
, 2011
"... Abstract. We study the generalized composite pure and randomized hypothesis testing problems. In addition to characterizing the optimal tests, we examine the conditions under which these two hypothesis testing problems are equivalent, and provide counterexamples when they are not. This analysis is ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
is useful for portfolio optimization to maximize some success probability given a fixed initial capital. The corresponding dual is related to a pure hypothesis testing problem which may or may not coincide with the randomized hypothesis testing problem. Our framework is applicable to both complete
On The Expected Runtime And The Success Probability Of Evolutionary Algorithms
, 2000
"... Evolutionary algorithms are randomized search heuristics whose general variants have been successfully applied in black box optimization. In this scenario the function f to be optimized is not known in advance and knowledge on f can be obtained only by sampling search points a revealing the val ..."
Abstract
-
Cited by 6 (1 self)
- Add to MetaCart
the value of f(a). In order to analyze the behavior of different variants of evolutionary algorithms on certain functions f , the expected runtime until some optimal search point is sampled and the success probability, i.e., the probability that an optimal search point is among the first sampled points
Maximum entropy markov models for information extraction and segmentation
, 2000
"... Hidden Markov models (HMMs) are a powerful probabilistic tool for modeling sequential data, and have been applied with success to many text-related tasks, such as part-of-speech tagging, text segmentation and information extraction. In these cases, the observations are usually modeled as multinomial ..."
Abstract
-
Cited by 561 (18 self)
- Add to MetaCart
Hidden Markov models (HMMs) are a powerful probabilistic tool for modeling sequential data, and have been applied with success to many text-related tasks, such as part-of-speech tagging, text segmentation and information extraction. In these cases, the observations are usually modeled
The Vocabulary Problem in Human-System Communication
- COMMUNICATIONS OF THE ACM
, 1987
"... In almost all computer applications, users must enter correct words for the desired objects or actions. For success without extensive training, or in first-tries for new targets, the system must recognize terms that will be chosen spontaneously. We studied spontaneous word choice for objects in five ..."
Abstract
-
Cited by 562 (8 self)
- Add to MetaCart
in five application-related domains, and found the variability to be surprisingly large. In every case two people favored the same term with probability <0.20. Simulations show how this fundamental property of language limits the success of various design methodologies for vocabulary-driven interaction
Results 1 - 10
of
10,759
