Search arXivSearch

arXiv · 1709.08314

Confidence Interval of Probability Estimator of Laplace Smoothing

Abstract

Sometimes, we do not use a maximum likelihood estimator of a probability but it's a smoothed estimator in order to cope with the zero frequency problem. This is often the case when we use the Naive Bayes classifier. Laplace smoothing is a popular choice with the value of Laplace smoothing estimator being the expected value of posterior distribution of the probability where we assume that the prior is uniform distribution. In this paper, we investigate the confidence intervals of the estimator of Laplace smoothing. We show that the likelihood function for this confidence interval is the same as the likelihood of a maximum likelihood estimated value of a probability of Bernoulli trials. Although the confidence interval of the maximum likelihood estimator of the Bernoulli trial probability has been studied well, and although the approximate formulas for the confidence interval are well known, we cannot use the interval of maximum likelihood estimator since the interval contains the value 0, which is not suitable for the Naive Bayes classifier. We are also interested in the accuracy of existing approximation methods since these approximation methods are frequently used but their accuracy is not well discussed. Thus, we obtain the confidence interval by numerically integrating the likelihood function. In this paper, we report the difference between the confidence interval that we computed and the confidence interval by approximate formulas. Finally, we include a URL, where all of the intervals that we computed are available.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Masato Kikuchi, Mitsuo Yoshida, Masayuki Okabe, Kyoji Umemura. 2017-09-25. Confidence Interval of Probability Estimator of Laplace Smoothing. https://doi.org/10.1109/icaicta.2015.7335387

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT