1. UCLA, CS240B,Fall 2018. Ideas for Presentation and Take Home Final
- The Presentation: should be an overview of a few (2 or 3) related research papers
Presentation can have one or two authors (same credit)
The Final Report: must be by a single author. Could either be
(1) an overview/survey of few papers: either new papers, or those used for the presentation plus few new ones.
(2) a report describing your implementation (some advanced data stream of techniques—e.g. those described in your presentation)

2. Great Performances from past CS240Bs
Joseph Korpela wrote an in-depth survey on Optimizing the Flajolet-Martin sketch based on the following papers:
[1] Flajolet, Philippe, and G. Nigel Martin. "Probabilistic counting algorithms for data base
applications." Journal of computer and system sciences 31.2 (1985):
[2] Durand, Marianne, and Philippe Flajolet. "Loglog counting of large cardinalities."Algorithms-ESA Springer Berlin Heidelberg,
[3] Flajolet, Philippe, et al. "HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm." DMTCS Proceedings 1 (2008).
[4] Heule, Stefan, Marc Nunkesser, and Alexander Hall. "HyperLogLog in Practice: Algorithmic Engineering of a State of The Art Cardinality Estimation Algorithm." (2013).
Ariyam Das’ survey on “Fast Lossless Frequent Itemset Mining in Data Streams using Crucial Patterns” led to his SDM 2016 paper.
Vladimir Braverman’s survey on ``Optimal sampling from Sliding Windows” led to his paper in J. Comput. Syst. Sci. 78(1 (2012).
Sumit Gouthaman: Designed and Implemented a Stream-UDA extension for the Esper and Storm systems

3. Possible Topics
IVarious DSMS---e.g., StreamBase, Spark Streams: System Design and Language Design
Sketches and other Synopses
Different streams and complex events: e.g.,XML, text.
Stream Mining Techniques not covered in class—e.g. Outlier Detection, Regression, special applications
Many other topics of on which you have special interest
An article in referenced books plus some additional references. See: