Answers are grounded in this paper and cite their sources.
It is shown that, for a nonparametric recursive kernel classification rule, <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∑ⁿᵢ₌₁hᵈ(i)I_{ \{h(i) > ε \} } / ∑ⁿⱼ₌₁ hᵈ (j) → 0 { as} n → ∞,</tex> all <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ε > 0</tex> and <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∑∞ᵢ₌₁hᵈ(i)= ∞</tex> constitute a set of conditions which are not only sufficient but also necessary for weak and strong Bayes risk consistency of the rule. In this way, weak and strong consistencies are shown to be equivalent.
No takes yet. Share an insight, caveat, or question.
Greblicki et al. (1987) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: