Mixing
maximum sum of two subset standard deviation
$begingroup$
Given a finite set defined in real number ${x mid 0< x < 1 }$ with size $N > 3$
If I split ${x}$ into two subsets ${A}$ and ${B}$ , $Acup B = X$ and $Acap B = emptyset $, How can i find the special subsets, which have maximum $Std(A)+Std(B)$.
${displaystyle Std={sqrt {frac {sum _{i=1}^{N}(x_{i}-{overline {x}})^{2}}{N-1}}}.}$
variance standard-deviation
asked Jan 17 at 3:47
yupbankyupbank
12
$endgroup$
|
show 1 more comment
$begingroup$
Given a finite set defined in real number ${x mid 0< x < 1 }$ with size $N > 3$
If I split ${x}$ into two subsets ${A}$ and ${B}$ , $Acup B = X$ and $Acap B = emptyset $, How can i find the special subsets, which have maximum $Std(A)+Std(B)$.
${displaystyle Std={sqrt {frac {sum _{i=1}^{N}(x_{i}-{overline {x}})^{2}}{N-1}}}.}$
variance standard-deviation
asked Jan 17 at 3:47
yupbankyupbank
12
$endgroup$
$begingroup$
Do you mean finite rather than countable?
$endgroup$
– Robert Israel
Jan 17 at 4:03
$begingroup$
And what do you do for the case $N=1$?
$endgroup$
– Robert Israel
Jan 17 at 4:04
$begingroup$
ah yes yes, i mean finite, and N>3, and thank you!!!
$endgroup$
– yupbank
Jan 17 at 4:06
$begingroup$
Well, if your set isn't too big you could use brute force.
$endgroup$
– Robert Israel
Jan 17 at 4:20
$begingroup$
yes yes, i'm wondering is there any method better than brute force? even some kind of dynamic programming would be a great help. or with some probabilistic help
$endgroup$
– yupbank
Jan 17 at 4:24
|
show 1 more comment
$begingroup$
Given a finite set defined in real number ${x mid 0< x < 1 }$ with size $N > 3$
If I split ${x}$ into two subsets ${A}$ and ${B}$ , $Acup B = X$ and $Acap B = emptyset $, How can i find the special subsets, which have maximum $Std(A)+Std(B)$.
${displaystyle Std={sqrt {frac {sum _{i=1}^{N}(x_{i}-{overline {x}})^{2}}{N-1}}}.}$
variance standard-deviation
asked Jan 17 at 3:47
yupbankyupbank
12
$endgroup$
Given a finite set defined in real number ${x mid 0< x < 1 }$ with size $N > 3$
If I split ${x}$ into two subsets ${A}$ and ${B}$ , $Acup B = X$ and $Acap B = emptyset $, How can i find the special subsets, which have maximum $Std(A)+Std(B)$.
${displaystyle Std={sqrt {frac {sum _{i=1}^{N}(x_{i}-{overline {x}})^{2}}{N-1}}}.}$
variance standard-deviation
variance standard-deviation
asked Jan 17 at 3:47
yupbankyupbank
12
asked Jan 17 at 3:47
yupbankyupbank
12
edited Jan 17 at 4:06
yupbank
asked Jan 17 at 3:47
yupbankyupbank
12
asked Jan 17 at 3:47
yupbankyupbank
12
asked Jan 17 at 3:47
yupbankyupbank
12
12
$begingroup$
Do you mean finite rather than countable?
$endgroup$
– Robert Israel
Jan 17 at 4:03
$begingroup$
And what do you do for the case $N=1$?
$endgroup$
– Robert Israel
Jan 17 at 4:04
$begingroup$
ah yes yes, i mean finite, and N>3, and thank you!!!
$endgroup$
– yupbank
Jan 17 at 4:06
$begingroup$
Well, if your set isn't too big you could use brute force.
$endgroup$
– Robert Israel
Jan 17 at 4:20
$begingroup$
yes yes, i'm wondering is there any method better than brute force? even some kind of dynamic programming would be a great help. or with some probabilistic help
$endgroup$
– yupbank
Jan 17 at 4:24
|
show 1 more comment
$begingroup$
Do you mean finite rather than countable?
$endgroup$
– Robert Israel
Jan 17 at 4:03
$begingroup$
And what do you do for the case $N=1$?
$endgroup$
– Robert Israel
Jan 17 at 4:04
$begingroup$
ah yes yes, i mean finite, and N>3, and thank you!!!
$endgroup$
– yupbank
Jan 17 at 4:06
$begingroup$
Well, if your set isn't too big you could use brute force.
$endgroup$
– Robert Israel
Jan 17 at 4:20
$begingroup$
yes yes, i'm wondering is there any method better than brute force? even some kind of dynamic programming would be a great help. or with some probabilistic help
$endgroup$
– yupbank
Jan 17 at 4:24
$begingroup$
Do you mean finite rather than countable?
$endgroup$
– Robert Israel
Jan 17 at 4:03
$begingroup$
Do you mean finite rather than countable?
$endgroup$
– Robert Israel
Jan 17 at 4:03
$begingroup$
And what do you do for the case $N=1$?
$endgroup$
– Robert Israel
Jan 17 at 4:04
$begingroup$
And what do you do for the case $N=1$?
$endgroup$
– Robert Israel
Jan 17 at 4:04
$begingroup$
ah yes yes, i mean finite, and N>3, and thank you!!!
$endgroup$
– yupbank
Jan 17 at 4:06
$begingroup$
ah yes yes, i mean finite, and N>3, and thank you!!!
$endgroup$
– yupbank
Jan 17 at 4:06
$begingroup$
Well, if your set isn't too big you could use brute force.
$endgroup$
– Robert Israel
Jan 17 at 4:20
$begingroup$
Well, if your set isn't too big you could use brute force.
$endgroup$
– Robert Israel
Jan 17 at 4:20
$begingroup$
yes yes, i'm wondering is there any method better than brute force? even some kind of dynamic programming would be a great help. or with some probabilistic help
$endgroup$
– yupbank
Jan 17 at 4:24
$begingroup$
yes yes, i'm wondering is there any method better than brute force? even some kind of dynamic programming would be a great help. or with some probabilistic help
$endgroup$
– yupbank
Jan 17 at 4:24
|
show 1 more comment
0
active
oldest
votes
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%2f3076569%2fmaximum-sum-of-two-subset-standard-deviation%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
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%2f3076569%2fmaximum-sum-of-two-subset-standard-deviation%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
$begingroup$
Do you mean finite rather than countable?
$endgroup$
– Robert Israel
Jan 17 at 4:03
$begingroup$
And what do you do for the case $N=1$?
$endgroup$
– Robert Israel
Jan 17 at 4:04
$begingroup$
ah yes yes, i mean finite, and N>3, and thank you!!!
$endgroup$
– yupbank
Jan 17 at 4:06
$begingroup$
Well, if your set isn't too big you could use brute force.
$endgroup$
– Robert Israel
Jan 17 at 4:20
$begingroup$
yes yes, i'm wondering is there any method better than brute force? even some kind of dynamic programming would be a great help. or with some probabilistic help
$endgroup$
– yupbank
Jan 17 at 4:24