Have you been looking for a course that teaches you effective machine learning in scikit-learn and TensorFlow 2.0? Or have you always wanted an efficient and skilled working knowledge of how to solve problems that can't be explicitly programmed through the latest machine learning techniques?
If you're familiar with pandas and NumPy, this course will give you up-to-date and detailed knowledge of all practical machine learning methods, which you can use to tackle most tasks that cannot easily be explicitly programmed; you'll also be able to use algorithms that learn and make predictions or decisions based on data.
The theory will be underpinned with plenty of practical examples, and code example walk-throughs in Jupyter notebooks. The course aims to make you highly efficient at constructing algorithms and models that perform with the highest possible accuracy based on the success output or hypothesis you've defined for a given task.
By the end of this course, you will be able to comfortably solve an array of industry-based machine learning problems by training, optimizing, and deploying models into production. Being able to do this effectively will allow you to create successful prediction and decisions for the task in hand (for example, creating an algorithm to read a labeled dataset of handwritten digits).
About the Author
Samuel Holt has several years' experience implementing, creating, and putting into production machine learning models for large blue-chip companies and small startups (as well as within his own companies) as a machine learning consultant.
He has machine learning lab experience and holds an MEng in Machine Learning and Software Engineering from Oxford University, where he won four awards for academic excellence.
Specifically, he has built systems that run in production using a combination of scikit-learn and TensorFlow involving automated customer support, implementing document OCR, detecting vehicles in the case of self-driving cars, comment analysis, and time series forecasting for financial data.