Cardinality part 2: proof & kth minimum value

preview_player
Показать описание
We derive the equation that explains why the "hat-problem" gives an estimate for cardinality. Seeing that we might get a better estimate if we use more than one minimal value, we discuss the "kth minimum value" (KMV) variant and how it uses averaging to obtain a better estimate. Finally, we briefly discuss different ways to use one or more hash functions to get k samples.

These materials are also openly available on figshare. Please cite this work; this ensures that funding agencies see the impact and importance of these open learning materials.

Channel: @BenLangmead
Рекомендации по теме
Комментарии
Автор

great content. Thanks for teaching us!

abhassinha
welcome to shbcf.ru