An introduction to machine learning (using scikit-learn)

*Update 10/31: to sign up for this workshop, please register via Eventbrite (https://www.eventbrite.com/e/an-introduction-to-machine-learning-using-scikit-learn-tickets-28953293079?aff=sfdsmeetup)

Agenda:

• 9 a.m. - 12 p.m.: Workshop

• 12 p.m. - 1 p.m.: Q&A, Pizza, Networking

About the workshop:

Machine learning is rapidly becoming prevalent in products we use every day. Scikit-learn is a fantastic toolkit to get started to make real world models in Python. It’s powerful and easy to deploy, and the best part for those who aren’t very strong in math is that there’s no math necessary.

Lukas Biewald and Nick Gaylord will jointly conduct this workshop. They will cover the basic types of machine learning techniques, provide examples of real world applications and towards the end of the session, you will build some models together!

Meet the teachers:

https://a248.e.akamai.net/secure.meetupstatic.com/photos/event/4/8/a/1/600_455418593.jpeg

Lukas is Chief Data Scientist and Founder of CrowdFlower. He has worked as a Senior Scientist and Manager within the Ranking and Management Team at Powerset, Inc., a natural language search technology company later acquired by Microsoft, and also led the Search Relevance Team for Yahoo! Japan. He graduated from Stanford University with a B.S. in Math and an M.S. in Computer Science. For more information about Lukas, please visit his LinkedIn profile, or follow him on Twitter.

https://a248.e.akamai.net/secure.meetupstatic.com/photos/event/4/8/c/6/600_455418630.jpeg

Nick is CrowdFlower's Senior Data Scientist, where he primarily works on our machine learning offering, CrowdFlower AI. Prior to CrowdFlower, Nick was a data scientist at SF text analytics startup Idibon. He has a PhD from the University of Texas at Austin, where his research focused on human language comprehension and the construction of datasets for NLP applications. For more information about Nick, please visit his LinkedIn profile, or follow him on Twitter.