University of Cambridge > > Machine Learning Reading Group @ CUED > Sketching methods

Sketching methods

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Yingzhen Li.

Sketching methods (or sometimes called streaming algorithms) are useful when you want an approximate property of a dataset when the computation of its true value would take too long or use too much memory. In this talk we give a brief overview of some of the most popular sketching methods, including: the Flajolet-Martin algorithm, for estimating the cardinality of a dataset; the Bloom Filter for testing set membership and the Count-Min Sketch for estimating occurrences of each item. We will try to provide examples of when these methods are useful and where they are used in big data applications.

There is no need to read any material prior to the meeting.

This talk is part of the Machine Learning Reading Group @ CUED series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity