What is the maximum likelihood of a binomial distribution?
$begingroup$
i've looked everywhere I could for an answer to this question but no luck !
If I have $X_1 .... X_n$ random variables that are independent and identically distributed such as ∀ $1 <$ $i$ $<n$, $X_i$ ~ B(n,$theta$) (binomial distribution)
I know that the likelihood is :
$P_n$($theta$,x)=$prodlimits_{i}$ $binom{n}{x_i}p^{x_i}(1-p)^{n-x_i}$
but then it seems kind of hard to calculate as product, I tried to calculate log($p_n$) but then the $x_i$! causes me problems
Can you enlighten me ? what is the max-likelihood of a binomial distribution ?
parameter-estimation maximum-likelihood
$endgroup$
add a comment |
$begingroup$
i've looked everywhere I could for an answer to this question but no luck !
If I have $X_1 .... X_n$ random variables that are independent and identically distributed such as ∀ $1 <$ $i$ $<n$, $X_i$ ~ B(n,$theta$) (binomial distribution)
I know that the likelihood is :
$P_n$($theta$,x)=$prodlimits_{i}$ $binom{n}{x_i}p^{x_i}(1-p)^{n-x_i}$
but then it seems kind of hard to calculate as product, I tried to calculate log($p_n$) but then the $x_i$! causes me problems
Can you enlighten me ? what is the max-likelihood of a binomial distribution ?
parameter-estimation maximum-likelihood
$endgroup$
add a comment |
$begingroup$
i've looked everywhere I could for an answer to this question but no luck !
If I have $X_1 .... X_n$ random variables that are independent and identically distributed such as ∀ $1 <$ $i$ $<n$, $X_i$ ~ B(n,$theta$) (binomial distribution)
I know that the likelihood is :
$P_n$($theta$,x)=$prodlimits_{i}$ $binom{n}{x_i}p^{x_i}(1-p)^{n-x_i}$
but then it seems kind of hard to calculate as product, I tried to calculate log($p_n$) but then the $x_i$! causes me problems
Can you enlighten me ? what is the max-likelihood of a binomial distribution ?
parameter-estimation maximum-likelihood
$endgroup$
i've looked everywhere I could for an answer to this question but no luck !
If I have $X_1 .... X_n$ random variables that are independent and identically distributed such as ∀ $1 <$ $i$ $<n$, $X_i$ ~ B(n,$theta$) (binomial distribution)
I know that the likelihood is :
$P_n$($theta$,x)=$prodlimits_{i}$ $binom{n}{x_i}p^{x_i}(1-p)^{n-x_i}$
but then it seems kind of hard to calculate as product, I tried to calculate log($p_n$) but then the $x_i$! causes me problems
Can you enlighten me ? what is the max-likelihood of a binomial distribution ?
parameter-estimation maximum-likelihood
parameter-estimation maximum-likelihood
asked Feb 1 at 15:51


Blueberry Blueberry
83
83
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Take the log-likelihood function, i.e.
$$L(p) = log prod_i binom{n}{x_i} p^{x_i}(1-p)^{n-x_i}$$
which becomes
$$L(p) = sum_i logbinom{n}{x_i} p^{x_i}(1-p)^{n-x_i}$$
even more
$$L(p) = sum_i logbinom{n}{x_i} + sum_i x_ilog p + sum_i(n-x_i)log(1-p)$$
Since you're interested in the ML estimate of $p$. let's derive with respect to $p$ and set it to zero.
$$frac{d}{dp}L(p) = frac{1}{p}sum_i x_i - frac{1}{1-p}sum_i(n-x_i) = 0$$
which gives you
$$frac{1}{1-p}sum_i(n-x_i) = frac{1}{p}sum_i x_i$$
or
$$frac{sum_i(n-x_i)}{sum_i x_i} = frac{1-p}{p} = frac{1}{p} - 1$$
Now find $p$.
$$frac{1}{p} = frac{sum_i(n-x_i) + sum_i x_i}{sum_i x_i} = frac{sum_i n}{sum_i x_i} $$
$endgroup$
$begingroup$
thank you, it was just a matter of concentration and calculating step by step
$endgroup$
– Blueberry
Feb 1 at 16:03
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3096395%2fwhat-is-the-maximum-likelihood-of-a-binomial-distribution%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Take the log-likelihood function, i.e.
$$L(p) = log prod_i binom{n}{x_i} p^{x_i}(1-p)^{n-x_i}$$
which becomes
$$L(p) = sum_i logbinom{n}{x_i} p^{x_i}(1-p)^{n-x_i}$$
even more
$$L(p) = sum_i logbinom{n}{x_i} + sum_i x_ilog p + sum_i(n-x_i)log(1-p)$$
Since you're interested in the ML estimate of $p$. let's derive with respect to $p$ and set it to zero.
$$frac{d}{dp}L(p) = frac{1}{p}sum_i x_i - frac{1}{1-p}sum_i(n-x_i) = 0$$
which gives you
$$frac{1}{1-p}sum_i(n-x_i) = frac{1}{p}sum_i x_i$$
or
$$frac{sum_i(n-x_i)}{sum_i x_i} = frac{1-p}{p} = frac{1}{p} - 1$$
Now find $p$.
$$frac{1}{p} = frac{sum_i(n-x_i) + sum_i x_i}{sum_i x_i} = frac{sum_i n}{sum_i x_i} $$
$endgroup$
$begingroup$
thank you, it was just a matter of concentration and calculating step by step
$endgroup$
– Blueberry
Feb 1 at 16:03
add a comment |
$begingroup$
Take the log-likelihood function, i.e.
$$L(p) = log prod_i binom{n}{x_i} p^{x_i}(1-p)^{n-x_i}$$
which becomes
$$L(p) = sum_i logbinom{n}{x_i} p^{x_i}(1-p)^{n-x_i}$$
even more
$$L(p) = sum_i logbinom{n}{x_i} + sum_i x_ilog p + sum_i(n-x_i)log(1-p)$$
Since you're interested in the ML estimate of $p$. let's derive with respect to $p$ and set it to zero.
$$frac{d}{dp}L(p) = frac{1}{p}sum_i x_i - frac{1}{1-p}sum_i(n-x_i) = 0$$
which gives you
$$frac{1}{1-p}sum_i(n-x_i) = frac{1}{p}sum_i x_i$$
or
$$frac{sum_i(n-x_i)}{sum_i x_i} = frac{1-p}{p} = frac{1}{p} - 1$$
Now find $p$.
$$frac{1}{p} = frac{sum_i(n-x_i) + sum_i x_i}{sum_i x_i} = frac{sum_i n}{sum_i x_i} $$
$endgroup$
$begingroup$
thank you, it was just a matter of concentration and calculating step by step
$endgroup$
– Blueberry
Feb 1 at 16:03
add a comment |
$begingroup$
Take the log-likelihood function, i.e.
$$L(p) = log prod_i binom{n}{x_i} p^{x_i}(1-p)^{n-x_i}$$
which becomes
$$L(p) = sum_i logbinom{n}{x_i} p^{x_i}(1-p)^{n-x_i}$$
even more
$$L(p) = sum_i logbinom{n}{x_i} + sum_i x_ilog p + sum_i(n-x_i)log(1-p)$$
Since you're interested in the ML estimate of $p$. let's derive with respect to $p$ and set it to zero.
$$frac{d}{dp}L(p) = frac{1}{p}sum_i x_i - frac{1}{1-p}sum_i(n-x_i) = 0$$
which gives you
$$frac{1}{1-p}sum_i(n-x_i) = frac{1}{p}sum_i x_i$$
or
$$frac{sum_i(n-x_i)}{sum_i x_i} = frac{1-p}{p} = frac{1}{p} - 1$$
Now find $p$.
$$frac{1}{p} = frac{sum_i(n-x_i) + sum_i x_i}{sum_i x_i} = frac{sum_i n}{sum_i x_i} $$
$endgroup$
Take the log-likelihood function, i.e.
$$L(p) = log prod_i binom{n}{x_i} p^{x_i}(1-p)^{n-x_i}$$
which becomes
$$L(p) = sum_i logbinom{n}{x_i} p^{x_i}(1-p)^{n-x_i}$$
even more
$$L(p) = sum_i logbinom{n}{x_i} + sum_i x_ilog p + sum_i(n-x_i)log(1-p)$$
Since you're interested in the ML estimate of $p$. let's derive with respect to $p$ and set it to zero.
$$frac{d}{dp}L(p) = frac{1}{p}sum_i x_i - frac{1}{1-p}sum_i(n-x_i) = 0$$
which gives you
$$frac{1}{1-p}sum_i(n-x_i) = frac{1}{p}sum_i x_i$$
or
$$frac{sum_i(n-x_i)}{sum_i x_i} = frac{1-p}{p} = frac{1}{p} - 1$$
Now find $p$.
$$frac{1}{p} = frac{sum_i(n-x_i) + sum_i x_i}{sum_i x_i} = frac{sum_i n}{sum_i x_i} $$
answered Feb 1 at 16:00


Ahmad BazziAhmad Bazzi
8,5212824
8,5212824
$begingroup$
thank you, it was just a matter of concentration and calculating step by step
$endgroup$
– Blueberry
Feb 1 at 16:03
add a comment |
$begingroup$
thank you, it was just a matter of concentration and calculating step by step
$endgroup$
– Blueberry
Feb 1 at 16:03
$begingroup$
thank you, it was just a matter of concentration and calculating step by step
$endgroup$
– Blueberry
Feb 1 at 16:03
$begingroup$
thank you, it was just a matter of concentration and calculating step by step
$endgroup$
– Blueberry
Feb 1 at 16:03
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3096395%2fwhat-is-the-maximum-likelihood-of-a-binomial-distribution%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown