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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Sketching methods

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Eagle Labs, 28 Chesterton Road, Cambridge, CB4 3AZ, United Kingdom Anglia Ruskin University, East Road,Mumford theatre Room 6.12a, Malet Place Engineering Building, UCL

Other talks

The Importance of Teaching about Science and Religion in a Time of Global Uncertainty The spread of environmental cost-benefit analysis in UK government, c.1966-1995: representing the public in the Anthropocene When Programmes Disagree About Programmes: Code Poetry and the Problem of Programme–Programme Communication Title TBC Max Perutz Lecture - Title TBC Afternoon Break
 

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