language:
Find link is a tool written by Edward Betts.Longer titles found: Indicator function (complex analysis) (view)
searching for Indicator function 52 found (256 total)
alternate case: indicator function
Duality gap
(844 words)
[view diff]
exact match in snippet
view article
find links to article
{\displaystyle f=f+I_{\text{constraints}}} where I {\displaystyle I} is the indicator function. Then let F : X × Y → R ∪ { + ∞ } {\displaystyle F:X\times Y\to \mathbbProbability distribution (6,688 words) [view diff] exact match in snippet view article find links to article
a set of probability zero, where 1 A {\displaystyle 1_{A}} is the indicator function of A {\displaystyle A} . This may serve as an alternative definitionHolland's schema theorem (852 words) [view diff] exact match in snippet view article find links to article
shown to be a special case of the Price equation with the schema indicator function as the macroscopic measurement. A schema is a template that identifiesQuantum capacity (1,981 words) [view diff] exact match in snippet view article find links to article
equality follows by definition— I {\displaystyle {\mathcal {I}}} is an indicator function equal to one if E a n {\displaystyle E_{a^{n}}} is uncorrectable underRobust parameter design (3,572 words) [view diff] exact match in snippet view article find links to article
Rogantin had created an indicator function for two-level fractional factorial designs, and in 2003 Ye expanded the indicator function for regular and nonregularMarkov kernel (2,052 words) [view diff] exact match in snippet view article find links to article
for all B ∈ B {\displaystyle B\in {\mathcal {B}}} . Note that the indicator function 1 f − 1 ( B ) {\displaystyle \mathbf {1} _{f^{-1}(B)}} is A {\displaystyleReflection principle (Wiener process) (1,288 words) [view diff] exact match in snippet view article
\right\}}+(2W(\tau )-W(t))\chi _{\left\{t>\tau \right\}}} and the indicator function χ { t ≤ τ } = { 1 , if t ≤ τ 0 , otherwise {\displaystyle \chi _{\{t\leqRandom compact set (675 words) [view diff] exact match in snippet view article find links to article
{\displaystyle p_{X}} can also be interpreted as the mean of the indicator function 1 X {\displaystyle \mathbf {1} _{X}} : p X ( x ) = E 1 X ( x ) . {\displaystylePerturbation function (973 words) [view diff] exact match in snippet view article find links to article
x ) {\displaystyle f(x)} (including the constraints by way of the indicator function) can be written as f ( x ) = J ( x , T x ) {\displaystyle f(x)=J(xSigmoid function (2,088 words) [view diff] exact match in snippet view article find links to article
Function returning minus 1, zero or plus 1 Heaviside step function – Indicator function of positive numbers Logistic regression – Statistical model for aAverage absolute deviation (1,674 words) [view diff] exact match in snippet view article find links to article
D_{\text{med}}=E|X-{\text{median}}|=2\operatorname {Cov} (X,I_{O})} where the indicator function is I O := { 1 if x > median , 0 otherwise . {\displaystyle \mathbfRuin theory (1,480 words) [view diff] exact match in snippet view article find links to article
probability measure P x {\displaystyle \mathbb {P} ^{x}} . Here the indicator function I ( τ < ∞ ) {\displaystyle \mathbb {I} (\tau <\infty )} emphasizesBaum–Welch algorithm (3,896 words) [view diff] exact match in snippet view article find links to article
}}y_{t}=v_{k},\\0&{\text{otherwise}}\end{cases}}} is an indicator function, and b i ∗ ( v k ) {\displaystyle b_{i}^{*}(v_{k})} is the expectedBipolar theorem (824 words) [view diff] exact match in snippet view article find links to article
(x|C)={\begin{cases}0&x\in C\\\infty &{\text{otherwise}}\end{cases}}} be the indicator function for a cone C . {\displaystyle C.} Then the convex conjugate, f ∗ (Proximal gradient method (589 words) [view diff] exact match in snippet view article find links to article
several convex constraints. Let f i {\displaystyle f_{i}} be the indicator function of non-empty closed convex set C i {\displaystyle C_{i}} modelingConvex analysis (2,607 words) [view diff] exact match in snippet view article find links to article
f=f+I_{\mathrm {constraints} }} where I {\displaystyle I} is the indicator function. Then let F : X × Y → [ − ∞ , ∞ ] {\displaystyle F:X\times Y\to [-\inftyAsian option (2,346 words) [view diff] exact match in snippet view article find links to article
{\displaystyle b>0} is the threshold and I A {\displaystyle I_{A}} is an indicator function which equals 1 {\displaystyle 1} if A {\displaystyle A} is true andAdditive process (2,685 words) [view diff] exact match in snippet view article find links to article
\mathbb {R} ^{d}} and I C {\displaystyle \mathbf {I_{C}} } is the indicator function of the set C {\displaystyle C} . A Lèvy process characteristic functionMöbius inversion formula (2,609 words) [view diff] exact match in snippet view article find links to article
proved as follows. We use Iverson's convention that [condition] is the indicator function of the condition, being 1 if the condition is true and 0 if falseNaimark's dilation theorem (1,489 words) [view diff] exact match in snippet view article find links to article
So, taking f a sequence of continuous functions increasing to the indicator function of B, we get ⟨ E ( B ) h 1 , h 2 ⟩ = ⟨ h 1 , E ( B ) h 2 ⟩ {\displaystyleQuantum logic (4,045 words) [view diff] exact match in snippet view article find links to article
{R} }f(\lambda )\,d\operatorname {E} (\lambda ).} In case f is the indicator function of an interval [a, b], the operator f(A) is a self-adjoint projectionMeasuring poverty (4,909 words) [view diff] exact match in snippet view article find links to article
{\displaystyle Po={\frac {1}{N}}\sum _{i=1}^{N}I(yi<z)} , Here, I(·) is an indicator function that takes on a value of 1 if the bracketed expression is true, andSupport function (1,388 words) [view diff] exact match in snippet view article find links to article
positive homogeneous, convex, real valued function is the (convex) indicator function of a compact convex set. Many authors restrict the support functionTruncated distribution (1,716 words) [view diff] exact match in snippet view article find links to article
g(x)=f(x)\cdot I(\{a<x\leq b\})} where I {\displaystyle I} is the indicator function. Note that the denominator in the truncated distribution is constantPrime omega function (4,100 words) [view diff] exact match in snippet view article find links to article
{\displaystyle f(n)=\pi (n)-\pi (n-1)=\chi _{\mathbb {P} }(n)} is the indicator function of the primes. This identity is proved in the article by Schmidt citedWeighted arithmetic mean (9,001 words) [view diff] exact match in snippet view article find links to article
43, 51, 52 As above, we can add a tick mark if multiplying by the indicator function. I.e.: y ˇ i ′ = I i y ˇ i = I i y i π i {\displaystyle {\checkRandom cluster model (1,984 words) [view diff] exact match in snippet view article find links to article
{\displaystyle Z} is an appropriate normalizing constant. Importantly, the indicator function 1 A {\displaystyle 1_{A}} of the set A = { ( σ , ω ) : σ i = σ j forEvaluation measures (information retrieval) (3,220 words) [view diff] exact match in snippet view article
} where rel ( k ) {\displaystyle \operatorname {rel} (k)} is an indicator function equaling 1 if the item at rank k {\displaystyle k} is a relevant documentK-means clustering (7,754 words) [view diff] exact match in snippet view article find links to article
computes the distance from the datum to each centroid, or simply an indicator function for the nearest centroid, or some smooth transformation of the distanceSliced inverse regression (1,511 words) [view diff] exact match in snippet view article find links to article
observations within each slice and I H s {\displaystyle \,I_{H_{s}}} is the indicator function for the slice: n s = ∑ i = 1 n I H s ( y i ) {\displaystyle n_{s}=\sumEmpirical likelihood (1,481 words) [view diff] exact match in snippet view article find links to article
{\displaystyle {\hat {F}}(y):=\sum _{i=1}^{n}\pi _{i}I(Y_{i}<y)} , with the indicator function I {\displaystyle I} and the (normalized) weights π i {\displaystyleCantor set (6,396 words) [view diff] exact match in snippet view article find links to article
{\displaystyle {\mathcal {C}}} to be interesting in science." The indicator function of the Cantor set Smith–Volterra–Cantor set Cantor function CantorGuided local search (1,546 words) [view diff] case mismatch in snippet view article find links to article
implementation level, we define for each feature i {\displaystyle i} an Indicator Function I i {\displaystyle I_{i}} indicating whether the feature is presentCascades in financial networks (1,116 words) [view diff] exact match in snippet view article find links to article
i {\displaystyle k_{i}} . Further, let I {\displaystyle I} be an indicator function that is equal to 1 if the value of i is below the threshold and 0Rank SIFT (823 words) [view diff] exact match in snippet view article find links to article
H_{m}(p)-q\rVert }_{2}<\epsilon ),} where I ( . ) {\displaystyle I(.)} is the indicator function, H m {\displaystyle H_{m}} is the homography transformation from IReceiver operating characteristic (7,885 words) [view diff] exact match in snippet view article find links to article
t 1 ) ] {\textstyle {\textbf {1}}[f(t_{0})<f(t_{1})]} denotes an indicator function which returns 1 if f ( t 0 ) < f ( t 1 ) {\displaystyle f(t_{0})<f(t_{1})}Markov chain Monte Carlo (8,537 words) [view diff] exact match in snippet view article find links to article
\;\;\;n=1,2,\dots } where I ( ⋅ ) {\displaystyle I(\cdot )} is the indicator function. The sequence { W n } {\displaystyle \{W_{n}\}} is treated as a realizationSocial cost of carbon (4,258 words) [view diff] exact match in snippet view article find links to article
loops without jumping straight to tipping points ×1(T > T*) is an indicator function that activates when temperature exceeds tipping threshold T* (e.gTobit model (2,727 words) [view diff] exact match in snippet view article find links to article
y_{L}} . In writing out the likelihood function, we first define an indicator function I {\displaystyle I} : I ( y ) = { 0 if y ≤ y L , 1 if y > y L .Ford Taunus P4 (1,712 words) [view diff] exact match in snippet view article find links to article
lamp unit for the turn indicators the Ford Taunus P4 had also the indicator function included in the single bulb. The high-power filament was lit intermittentlyMulti-task learning (6,156 words) [view diff] exact match in snippet view article find links to article
cardinality of group r, and I {\displaystyle \mathbb {I} } is the indicator function). For example, people in different political parties (groups) mightMonotone convergence theorem (5,489 words) [view diff] exact match in snippet view article find links to article
}_{X_{2}},} where 1 X i {\displaystyle {\mathbf {1} }_{X_{i}}} is the indicator function of X i {\displaystyle X_{i}} , are easily seen to be measurable andAlmost sure hypothesis testing (1,338 words) [view diff] exact match in snippet view article find links to article
\right]\right]=\Pr(\mu \leq t)} where the equality holds w.p. 1. So the indicator function of a one-sided a.s. confidence interval is a good approximation toMatrix regularization (2,510 words) [view diff] exact match in snippet view article find links to article
{\displaystyle \mathbf {1} _{\|w_{g}\|_{g}\geq \lambda }} is the indicator function for group norms ≥ λ {\displaystyle \geq \lambda } . Thus, using ℓWhite noise analysis (1,915 words) [view diff] exact match in snippet view article find links to article
t)}\rangle ,} where 1 1 [ 0 , t ) {\displaystyle 1\!\!1_{[0,t)}} is the indicator function of the interval [ 0 , t ) {\displaystyle [0,t)} . Informally B ( tOvercompleteness (2,792 words) [view diff] exact match in snippet view article find links to article
{\displaystyle g(x)=I_{[0,c)}(x)} , where I ( x ) {\displaystyle I(x)} is the indicator function. The situation for { E m b T n a g } m , n ∈ Z {\displaystyle \{E_{mb}T_{na}g\}_{mSystem of imprimitivity (3,055 words) [view diff] exact match in snippet view article find links to article
g ∈ G and Borel subsets A of G. Let π(A) be multiplication by the indicator function of A and Ug be the operator [ U g ψ ] ( x ) = ψ ( g − 1 x ) . {\displaystyleParticle filter (16,893 words) [view diff] exact match in snippet view article find links to article
dependent on the application domain. For instance, if we choose the indicator function G n ( x n ) = 1 A ( x n ) {\displaystyle G_{n}(x_{n})=1_{A}(x_{n})}Roth's theorem on arithmetic progressions (4,555 words) [view diff] exact match in snippet view article find links to article
the functions f = 1 A {\displaystyle f=\mathbf {1} _{A}} (i.e the indicator function of A {\displaystyle A} ), and g = α ⋅ 1 [ N ] {\displaystyle g=\alphaHattendorff's theorem (1,655 words) [view diff] case mismatch in snippet view article find links to article
229–245. ISBN 9780938959465. Gerber, H.U., Leung, B.P.K., Shiu, E.S.W. "Indicator Function and Hattendorff's Theorem". North American Actuarial Journal. VolAnalysis of Boolean functions (5,379 words) [view diff] exact match in snippet view article find links to article
The counterpart of total influence or average sensitivity for the indicator function of a set is Gaussian surface area, which is the Minkowski contentChambolle-Pock algorithm (2,970 words) [view diff] exact match in snippet view article find links to article
{\lambda }{2}}\lVert u-g\rVert _{2}^{2}-\delta _{P}(p)} where the indicator function is defined as δ P ( p ) = { 0 , if p ∈ P + ∞ , if p ∉ P {\displaystyle