-
kyle.burton 4.71
Description:
In this talk I’ll discuss techniques I have learned for working with large data sets, which are too large to fit in RAM, but not so large you need distributed computing to work with them. I’ll discuss things like: taking random samples; finding duplicated values as well as other types of basic analysis.
Though not specific to Clojure, many of the techniques lead to elegant, easy to understand implementations in Clojure by leveraging it’s sequence abstraction as well as other aspects of the language.
Links: Website
Comments on this Talk
Thank you Nick, putting more into the slides wouldn't be difficult, knowing that it would improve it helps. Thank you!
Really enjoyed the talk as well. You did a good job connecting theory with practical use. Also did a good job of responding to questions and feedback during the talk. It might be helpful to do a quick overview of all approaches up front to set the stage for the structure of the talk.
I really enjoyed the talk Kyle. I think the only thing I would recommend would be to have a few more slides showing the intermediate steps of some of the calculations. Go through the first few steps of the algorithms, instead of just "talking it out".