Timeline for Reconstructing the number of distinct elements from a random projection
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 2, 2017 at 16:22 | comment | added | assaferan | Do you have any information about the apriori distribution of D? If so, you could just use Bayes. Else, there is little you can say about the probability, only about the likelihood. | |
| Feb 1, 2017 at 15:13 | comment | added | R B | Thinking about it a bit more, this doesn't really solves my problem. I'm trying to figure the number of distinct elements in the input sequence by looking at $Z$. If I assume that $n=D$ then I already have my answer. It's interesting for me to understand what can be done without assuming we know $D$ (i.e., using only $n,k$ and $Z$). | |
| Jan 30, 2017 at 16:37 | vote | accept | R B | ||
| Feb 1, 2017 at 15:11 | |||||
| Jan 30, 2017 at 16:18 | comment | added | R B | @AnthonyQuas - I think that the answer is correct. Note that he sums the $Z_i$'s over $\{1,...,k\}$ and not $\{1,.,,.,n\}$. | |
| Jan 30, 2017 at 6:54 | comment | added | Anthony Quas | I think this isn't quite right. The correct question has $Z_i=1$ if $i$ does not lie in $h(x_1),\ldots,h(x_{i-1})$ (have we seen this symbol before or not?) If there is a repeat, you are removing all of the repetitions. | |
| Jan 29, 2017 at 20:42 | history | answered | assaferan | CC BY-SA 3.0 |