Sketching methods

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

• John Bradshaw
• Thursday 10 November 2016, 13:30-15:00
• Engineering Department, CBL Room 438.

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:

• All Talks (aka the CURE list)
• Cambridge Centre for Data-Driven Discovery (C2D3)
• Cambridge Forum of Science and Humanities
• Cambridge Language Sciences
• Cambridge University Engineering Department Talks
• Cambridge talks
• Centre for Smart Infrastructure & Construction
• Chris Davis' list
• Computational Continuum Mechanics Group Seminars
• Engineering Department, CBL Room 438
• Featured lists
• Guy Emerson's list
• Hanchen DaDaDash
• Inference Group Journal Clubs
• Inference Group Summary
• Information Engineering Division seminar list
• Interested Talks
• ML
• Machine Learning Reading Group
• Machine Learning Reading Group @ CUED
• Machine Learning Summary
• Quantum Matter Journal Club
• Required lists for MLG
• School of Technology
• Simon Baker's List
• TQS Journal Clubs
• Trust & Technology Initiative - interesting events
• bld31
• custom
• ndk22's list
• ob366-ai4er
• rp587
• yk373's list

Note that ex-directory lists are not shown.