Mixing
sampling n unique items from large dataset
$begingroup$
I have a dataset that has N of different unique items and each item appears $A_{i}$ times (every item appears different times).
This is mean that I have the probability of each item.
I need to find a good upper bound sample size in order to sample n unique items from all my dataset
Is there any equation or a way to calculate the size of the sample so I will get a close number to n unique items?
limitation: 1. the number of unique items in the sample must be larger or equal to n 2. the number of unique items in the sample size cannot be too large than n the error must be small.
sampling
asked Jan 27 at 19:12
DkovaDkova
184118
$endgroup$
add a comment |
$begingroup$
I have a dataset that has N of different unique items and each item appears $A_{i}$ times (every item appears different times).
This is mean that I have the probability of each item.
I need to find a good upper bound sample size in order to sample n unique items from all my dataset
Is there any equation or a way to calculate the size of the sample so I will get a close number to n unique items?
limitation: 1. the number of unique items in the sample must be larger or equal to n 2. the number of unique items in the sample size cannot be too large than n the error must be small.
sampling
asked Jan 27 at 19:12
DkovaDkova
184118
$endgroup$
add a comment |
$begingroup$
I have a dataset that has N of different unique items and each item appears $A_{i}$ times (every item appears different times).
This is mean that I have the probability of each item.
I need to find a good upper bound sample size in order to sample n unique items from all my dataset
Is there any equation or a way to calculate the size of the sample so I will get a close number to n unique items?
limitation: 1. the number of unique items in the sample must be larger or equal to n 2. the number of unique items in the sample size cannot be too large than n the error must be small.
sampling
asked Jan 27 at 19:12
DkovaDkova
184118
$endgroup$
I have a dataset that has N of different unique items and each item appears $A_{i}$ times (every item appears different times).
This is mean that I have the probability of each item.
I need to find a good upper bound sample size in order to sample n unique items from all my dataset
Is there any equation or a way to calculate the size of the sample so I will get a close number to n unique items?
limitation: 1. the number of unique items in the sample must be larger or equal to n 2. the number of unique items in the sample size cannot be too large than n the error must be small.
sampling
sampling
asked Jan 27 at 19:12
DkovaDkova
184118
asked Jan 27 at 19:12
DkovaDkova
184118
asked Jan 27 at 19:12
DkovaDkova
184118
asked Jan 27 at 19:12
DkovaDkova
184118
asked Jan 27 at 19:12
DkovaDkova
184118
184118
add a comment |
add a 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%2f3089995%2fsampling-n-unique-items-from-large-dataset%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%2f3089995%2fsampling-n-unique-items-from-large-dataset%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
