Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Small-bias sample space (view)

searching for Sample space 84 found (185 total)

List of probability distributions (2,609 words) [view diff] no match in snippet view article find links to article

Many probability distributions that are important in theory or applications have been given specific names. The Bernoulli distribution, which takes value

Variable kernel density estimation (779 words) [view diff] exact match in snippet view article find links to article

of the test point. It is a particularly effective technique when the sample space is multi-dimensional. Given a set of samples, { x → i } {\displaystyle

Decision tree pruning (986 words) [view diff] exact match in snippet view article find links to article

small tree might not capture important structural information about the sample space. However, it is hard to tell when a tree algorithm should stop because

Jump diffusion (605 words) [view diff] exact match in snippet view article find links to article

dimensional representation, with the collection of micrographs filling out the sample space corresponding to the unions of multiple finite-dimensional spaces. Using

Stochastic tunneling (535 words) [view diff] exact match in snippet view article find links to article

containing function minima. Easier tunneling allows for faster exploration of sample space and faster convergence to a good solution. Monte Carlo method-based optimization

Latin hypercube sampling (634 words) [view diff] exact match in snippet view article find links to article

chess board without threatening each other. In orthogonal sampling, the sample space is divided into equally probable subspaces. All sample points are then

Maximum-entropy random graph model (1,420 words) [view diff] exact match in snippet view article find links to article

denoted Pn,m(G){\displaystyle \mathbb {P} _{n,m}(G)}). This restricts the sample space from Gn{\displaystyle {\mathcal {G}}_{n}} (all graphs on n{\displaystyle

Molecular tagging velocimetry (1,416 words) [view diff] exact match in snippet view article find links to article

simplest form, a single "write" laser beam is shot once through the sample space. Along its path an optically induced chemical process is initiated, resulting

Conditional event algebra (2,492 words) [view diff] exact match in snippet view article find links to article

tri-events conditional on Ω, the vacuous event represented by the entire sample space of outcomes; thus, A becomes Ω → A. Since there are many three-valued

McCullagh's parametrization of the Cauchy distributions (564 words) [view diff] exact match in snippet view article find links to article

space has the same fractional linear form as the transformation on the sample space only if the parameter space is taken to be the complex plane. In other

Probabilistic method (1,848 words) [view diff] exact match in snippet view article find links to article

can also be used to guarantee the existence of a desired element in a sample space with a value that is greater than or equal to the calculated expected

Kochen–Specker theorem (3,026 words) [view diff] exact match in snippet view article find links to article

and Butterfield, (under the assumption of a universal probabilistic sample space as in non-contextual hidden variable theories) the Kochen–Specker theorem

Misuse of p-values (1,539 words) [view diff] exact match in snippet view article find links to article

convenient 90° rotation of attention replaces the intended sample space with an illicit sample space.: 18–19 These p-value misuses are thus analogous to probability's

Neyman construction (1,190 words) [view diff] exact match in snippet view article find links to article

Θ{\displaystyle \Theta } be the sample space defined by the n random variables and subsequently define a sample point in the sample space as X=(X1,X2,...Xn){\displaystyle

Continuous uniform distribution (4,135 words) [view diff] exact match in snippet view article find links to article

that X > 12 ? {\displaystyle X>12?} Conditional probability changes the sample space, so a new interval length b − a ′ {\displaystyle b-a'} has to be calculated

Boy or girl paradox (4,657 words) [view diff] exact match in snippet view article find links to article

aforementioned assumptions, in this problem, a random family is selected. In this sample space, there are four equally probable events: Only two of these possible events

Vibrating-sample magnetometer (836 words) [view diff] exact match in snippet view article find links to article

measurements will be taken) Magnetic field must be uniform across the sample space (otherwise the addition of field gradients will induce force that alter

Occipital nerve block (428 words) [view diff] exact match in snippet view article find links to article

community expressed that the test needs to be carried out on greater sample space before remarking anything conclusive. Rothrock, MD, JF (2010). "Occipital

Van Houtum distribution (723 words) [view diff] exact match in snippet view article find links to article

to land on a 6 twice as often as on a 1. The possible values of the sample space are 1, 2, 3, 4, 5 and 6. Each time the die is thrown, the probability

Integral geometry (582 words) [view diff] exact match in snippet view article find links to article

interpreted as subject to correct symmetry considerations. There is a sample space of lines, one on which the affine group of the plane acts. A probability

Probability mass function (1,535 words) [view diff] exact match in snippet view article find links to article

distribution is tossing a coin. Suppose that S {\displaystyle S} is the sample space of all outcomes of a single toss of a fair coin, and X {\displaystyle

Field of sets (3,670 words) [view diff] exact match in snippet view article find links to article

probability space and call its underlying measurable space a sample space. The points of a sample space are called sample points and represent potential outcomes

Stationary process (2,738 words) [view diff] exact match in snippet view article find links to article

process. An example of a discrete-time stationary process where the sample space is also discrete (so that the random variable may take one of N possible

Divergence-from-randomness model (2,245 words) [view diff] exact match in snippet view article find links to article

introduce our sample space to associate a point with possible configurations of the outcomes. The one-to-one correspondence for sample space can be defined

Frequentist probability (2,521 words) [view diff] exact match in snippet view article find links to article

random experiment is called the sample space of the experiment. An event is defined as a particular subset of the sample space to be considered. For any given

Probabilistic argumentation (338 words) [view diff] exact match in snippet view article find links to article

of "probabilistic labellings" refers to probability spaces where the sample space is a set of labellings of argumentation graphs (Riveret et al. 2018)

Georges Matheron (1,327 words) [view diff] exact match in snippet view article find links to article

determined in samples selected at positions with different coordinates in a sample space. What Agterberg did not do was derive the variance of this function.

Variogram (3,107 words) [view diff] exact match in snippet view article find links to article

2D sample space where x {\displaystyle x} and y {\displaystyle y} are geographical coordinates. In the case of the iron in soil, the sample space could

Isolation forest (1,855 words) [view diff] exact match in snippet view article find links to article

features selection test, like Kurtosis, to reduce the dimensionality of the sample space. Normal Instances Only: iForest performs well even if the training set

Frequentist inference (2,459 words) [view diff] exact match in snippet view article find links to article

straightforward because Bayesian statistics is conditional on the entire sample space, whereas frequentist testing is concerned with the whole experimental

Markov chain Monte Carlo (3,060 words) [view diff] exact match in snippet view article find links to article

The result of hybrid Monte Carlo is that proposals move across the sample space in larger steps; they are therefore less correlated and converge to the

Rank correlation (2,523 words) [view diff] exact match in snippet view article find links to article

objects. Thus we can look at observed rankings as data obtained when the sample space is (identified with) a symmetric group. We can then introduce a metric

Probabilistic logic (1,771 words) [view diff] exact match in snippet view article find links to article

"probabilistic labellings", for example, refers to probability spaces where a sample space is a set of labellings of argumentation graphs. In the framework of "probabilistic

Structured support vector machine (1,201 words) [view diff] exact match in snippet view article find links to article

{\mathcal {Y}}} , i = 1 , … , n {\displaystyle i=1,\dots ,n} from a sample space X {\displaystyle {\mathcal {X}}} and label space Y {\displaystyle {\mathcal

Cumulative distribution function (4,067 words) [view diff] exact match in snippet view article find links to article

{\displaystyle F} -distributed random variables defined on the same sample space, then there exist random variables Y α {\displaystyle Y_{\alpha }} such

Sampler (musical instrument) (4,598 words) [view diff] case mismatch in snippet view article

How many voices (or notes) can play simultaneously, to create chords Sample Space: How much memory is available to load samples Channels: How many different

Neopera (658 words) [view diff] exact match in snippet view article find links to article

the album and its release was explained by the search for a suitable sample space and new members. Schumann and Espineira were only intended for the studio

Mean squared error (3,827 words) [view diff] exact match in snippet view article find links to article

out-of-sample test space, generated by a model estimated over a particular sample space. This also is a known, computed quantity, and it varies by sample and

Asymptotic equipartition property (3,946 words) [view diff] exact match in snippet view article find links to article

X_{2},\ldots ,X_{n})-H(X)\right|\right]=0} Consider a finite-valued sample space Ω {\displaystyle \Omega } , i.e. | Ω | < ∞ {\displaystyle |\Omega |<\infty

Randomized algorithm (4,173 words) [view diff] exact match in snippet view article find links to article

hash function. This technique is usually used to exhaustively search a sample space and making the algorithm deterministic (e.g. randomized graph algorithms)

Sports betting systems (1,091 words) [view diff] exact match in snippet view article find links to article

angles and trends to produce systems. Systems can be deceiving. Any sample space can be constrained enough with meaningless criteria to create the illusion

Covariance (4,706 words) [view diff] exact match in snippet view article find links to article

covariance is exactly the L2 inner product of real-valued functions on the sample space. As a result, for random variables with finite variance, the inequality

Generalized normal distribution (2,739 words) [view diff] exact match in snippet view article find links to article

numerical calculations must be used to compute the estimates. Since the sample space (the set of real numbers where the density is non-zero) depends on the

Vapnik–Chervonenkis theory (3,495 words) [view diff] exact match in snippet view article find links to article

Consider a collection C{\displaystyle {\mathcal {C}}} of subsets of the sample space X{\displaystyle {\mathcal {X}}}. C{\displaystyle {\mathcal {C}}} is said

Construction of an irreducible Markov chain in the Ising model (1,068 words) [view diff] exact match in snippet view article find links to article

by using the Metropolis-Hastings algorithm in the smallest expanded sample space S⋆(a,b){\displaystyle S^{\star }(a,b)} The proof of irreducibility in

Global optimization (2,096 words) [view diff] exact match in snippet view article find links to article

containing function minima. Easier tunneling allows for faster exploration of sample space and faster convergence to a good solution. Parallel tempering, also known

Regular conditional probability (1,378 words) [view diff] exact match in snippet view article find links to article

One should think of T{\displaystyle T} as a way to "disintegrate" the sample space Ω{\displaystyle \Omega } into {T−1(x)}x∈E{\displaystyle \{T^{-1}(x)\}_{x\in

Linear discriminant analysis (5,931 words) [view diff] exact match in snippet view article find links to article

{\displaystyle j} , with R j {\displaystyle \mathbb {R} _{j}} sets of sample space, there is a discriminant rule such that if x ∈ R j {\displaystyle x\in

Pinsker's inequality (1,273 words) [view diff] exact match in snippet view article find links to article

\mathrm {d} P} is the Kullback–Leibler divergence in nats. When the sample space X{\displaystyle X} is a finite set, the Kullback–Leibler divergence is

Color-coding (1,958 words) [view diff] exact match in snippet view article find links to article

2nlog k random bits that are almost 2log k-wise independent, and the sample space needed for generating those random bits can be as small as kO(1)log⁡|V|{\displaystyle

Chapman–Robbins bound (888 words) [view diff] exact match in snippet view article find links to article

case. Usually, Ω=Xn{\displaystyle \Omega ={\mathcal {X}}^{n}} is the sample space of n{\displaystyle n} independent draws of a X{\displaystyle {\mathcal

People v. Collins (610 words) [view diff] case mismatch in snippet view article find links to article

Richard A. (October 4, 2023). "The Prosecutor's Fallacy Framed as a Sample Space Substitution". OSF Preprints. doi:10.31219/osf.io/cs248. "People v. Collins"

Stochastic differential equation (5,605 words) [view diff] exact match in snippet view article find links to article

{\displaystyle \omega \in \Omega } , where Ω {\displaystyle \Omega } is the sample space in the given probability space ( Ω , F , P {\displaystyle \Omega ,\,{\mathcal

Metropolis–Hastings algorithm (4,533 words) [view diff] exact match in snippet view article find links to article

instead. This algorithm proceeds by randomly attempting to move about the sample space, sometimes accepting the moves and sometimes remaining in place. Note

Bessel's correction (3,077 words) [view diff] exact match in snippet view article find links to article

at an outcome ω∈Ω{\displaystyle \omega \in \Omega } of the underlying sample space, we would like to get a good estimate for the variance σ2{\displaystyle

Dirichlet distribution (6,539 words) [view diff] exact match in snippet view article find links to article

all parameters are set is called the concentration parameter. If the sample space of the Dirichlet distribution is interpreted as a discrete probability

Base rate fallacy (5,740 words) [view diff] case mismatch in snippet view article find links to article

Richard A. (October 4, 2023). "The Prosecutor's Fallacy Framed as a Sample Space Substitution". OSF Preprints. doi:10.31219/osf.io/cs248. Rheinfurth,

Factor analysis (10,026 words) [view diff] exact match in snippet view article find links to article

viewed as vectors in an N {\displaystyle N} -dimensional Euclidean space (sample space), represented as z a {\displaystyle \mathbf {z} _{a}} , F p {\displaystyle

Twisting properties (1,304 words) [view diff] exact match in snippet view article find links to article

distribution directly from the former if we are able to relate domains of the sample space to subsets of Θ support. In more abstract terms, we speak about twisting

Per Martin-Löf (2,865 words) [view diff] exact match in snippet view article find links to article

randomness in probability; in that theory, no particular element of a sample space can be said to be random. Martin-Löf randomness has since been shown

Sally Clark (3,343 words) [view diff] case mismatch in snippet view article find links to article

Richard A. (4 October 2023). "The Prosecutor's Fallacy Framed as a Sample Space Substitution". OSF Preprints. doi:10.31219/osf.io/cs248. Pages 17, 21

Gibbs sampling (6,138 words) [view diff] exact match in snippet view article find links to article

of the sampling process (i.e. the tendency to move slowly around the sample space, with a high amount of autocorrelation between samples, rather than moving

Dirichlet process (4,861 words) [view diff] exact match in snippet view article find links to article

{\displaystyle H} with every table, the resulting distribution over the sample space S {\displaystyle S} is a random sample of a Dirichlet process. The Chinese

Group testing (9,753 words) [view diff] exact match in snippet view article find links to article

bound on the number of tests needed can be described using the notion of sample space, denoted S{\displaystyle {\mathcal {S}}}, which is simply the set of

Problem of the Nile (433 words) [view diff] exact match in snippet view article find links to article

doi:10.2307/2311357. JSTOR 2311357. Note on regions similar to the sample space, Statistical Research Memoirs, Cambridge, 1938, 116–125. J. Neyman and

Learnable function class (1,338 words) [view diff] exact match in snippet view article find links to article

{\displaystyle \Omega ={\mathcal {X}}\times {\mathcal {Y}}=\{(x,y)\}} be the sample space, where y {\displaystyle y} are the labels and x {\displaystyle x} are

Dead-end elimination (1,902 words) [view diff] exact match in snippet view article find links to article

or pairs can be eliminated. Since this is normally a reduction in the sample space by many orders of magnitude, simple enumeration will suffice to determine

Randomised decision rule (2,239 words) [view diff] exact match in snippet view article find links to article

actions space A {\displaystyle {\mathcal {A}}} for each member of the sample space. More formally, d ∗ ( x , A ) {\displaystyle d^{*}(x,A)} denotes the

Autologistic actor attribute models (898 words) [view diff] exact match in snippet view article find links to article

are required to estimate the model's parameters across an intractable sample space for moderately-size networks. After model estimation, good-of-fit testing

Stochastic simulation (3,715 words) [view diff] exact match in snippet view article find links to article

getting exactly two heads. This problem can be solved by looking at the sample space. There are three ways to get two heads. HHH, HHT, HTH, THH, TTH, THT

Memory and decision-making (2,580 words) [view diff] exact match in snippet view article find links to article

given B object, people can form A object as B object provides relevant sample space that leads people to make judgement. For example, a person who is asked

Principle of transformation groups (2,251 words) [view diff] exact match in snippet view article find links to article

location parameter case, the Jacobian of this transformation in the sample space and the parameter space is a, not 1. So, the sampling probability changes

Adrian Kent (1,261 words) [view diff] exact match in snippet view article find links to article

physical quantities (or beables) like the stress–energy tensor, whose sample space is mathematically well defined and respects Lorentzian symmetry. He has

Fisher's noncentral hypergeometric distribution (2,219 words) [view diff] exact match in snippet view article find links to article

essentially just the numerator, summed over all events of the joint sample space (X,Y){\displaystyle (X,Y)} for which it holds that X+Y=n{\displaystyle

Optical transfer function (5,592 words) [view diff] exact match in snippet view article find links to article

sometimes the optical transfer function is given in units of the object or sample space, observation angle, film width, or normalized to the theoretical maximum

Generalized filtering (2,858 words) [view diff] exact match in snippet view article find links to article

rests on the tuple (Ω,U,X,S,p,q){\displaystyle (\Omega ,U,X,S,p,q)}: A sample space Ω{\displaystyle \Omega } from which random fluctuations ω∈Ω{\displaystyle

Confidence distribution (4,052 words) [view diff] exact match in snippet view article find links to article

parameter space of the unknown parameter of interest θ, and χ is the sample space corresponding to data Xn={X1, ..., Xn}: A function Hn(•) = Hn(Xn, •)

Topological data analysis (11,259 words) [view diff] exact match in snippet view article find links to article

consisting in the triple ( Ω , Π , P {\displaystyle \Omega ,\Pi ,P} ), sample space, random variables and probability laws. Random variables are considered

Linear belief function (3,808 words) [view diff] exact match in snippet view article find links to article

functional in the variable space, and as their duals over a hyperplane in the sample space. Monney proposes still another structure called Gaussian hints. Although

Conditioning (probability) (6,865 words) [view diff] exact match in snippet view article

{\displaystyle \Omega =\{X=x_{1}\}\uplus \{X=x_{2}\}\uplus \dots } of the sample space Ω into disjoint sets {X = xn}. (Here x 1 , x 2 , … {\displaystyle x_{1}

Trajectory inference (1,861 words) [view diff] exact match in snippet view article find links to article

feature space, but dimensionality reduction can also be applied to the sample space by clustering together groups of similar cells. Many methods represent

Generalized minimum-distance decoding (2,587 words) [view diff] exact match in snippet view article find links to article

density function : A probability distribution Pr {\displaystyle \Pr } on a sample space S {\displaystyle S} is a mapping from events of S {\displaystyle S} to

Burger Land (222 words) [view diff] no match in snippet view article find links to article

waffle fries. Also, he takes a side trip to the Johnson Space Center to sample "space burgers". 7 5 "New Mexico's Green Chile Cheeseburgers" May 13, 2013 (2013-05-13)

Kernel methods for vector output (4,218 words) [view diff] exact match in snippet view article find links to article

inputs. Here, for simplicity in the notation, we assume the number and sample space of the data for each output are the same. From the regularization perspective