Machine Learning Pocket Reference: Working with Structured Data in Python

Harrison, Matt

ISBN 10: 1492047546 / ISBN 13: 9781492047544

Edité par O'Reilly Media, 2019

A propos de cet article

A crisp, unmarked softcover in very good condition; faint tiny stains to textblock.

N° de réf. du vendeur 060511

Détails bibliographiques

• Titre: Machine Learning Pocket Reference: Working with Structured Data in Python
• Éditeur: O'Reilly Media
• Date de parution: 2019
• Langue: anglais
• ISBN à 10 chiffres: 1492047546
• ISBN à 13 chiffres: 9781492047544
• Reliure: Soft cover
• Édition: 1st Edition
• État de l'article: Very Good

A propos de ce titre

Synopsis

With detailed notes, tables, and examples, this handy reference will help you navigate the basics of structured machine learning. Author Matt Harrison delivers a valuable guide that you can use for additional support during training and as a convenient resource when you dive into your next machine learning project.

Ideal for programmers, data scientists, and AI engineers, this book includes an overview of the machine learning process and walks you through classification with structured data. Youâ ll also learn methods for clustering, predicting a continuous value (regression), and reducing dimensionality, among other topics.

This pocket reference includes sections that cover:

• Classification, using the Titanic dataset
• Cleaning data and dealing with missing data
• Exploratory data analysis
• Common preprocessing steps using sample data
• Selecting features useful to the model
• Model selection
• Metrics and classification evaluation
• Regression examples using k-nearest neighbor, decision trees, boosting, and more
• Metrics for regression evaluation
• Clustering
• Dimensionality reduction
• Scikit-learn pipelines

À propos de l?auteur

Matt runs MetaSnake, a Python and Data Science training and consulting company. He has over 15 years of experience using Python across a breadth of domains: Data Science, BI, Storage, Testing and Automation, Open Source Stack Management, and Search.