Book Image

Practical Data Science with Python

By : Nathan George
Book Image

Practical Data Science with Python

By: Nathan George

Overview of this book

Practical Data Science with Python teaches you core data science concepts, with real-world and realistic examples, and strengthens your grip on the basic as well as advanced principles of data preparation and storage, statistics, probability theory, machine learning, and Python programming, helping you build a solid foundation to gain proficiency in data science. The book starts with an overview of basic Python skills and then introduces foundational data science techniques, followed by a thorough explanation of the Python code needed to execute the techniques. You'll understand the code by working through the examples. The code has been broken down into small chunks (a few lines or a function at a time) to enable thorough discussion. As you progress, you will learn how to perform data analysis while exploring the functionalities of key data science Python packages, including pandas, SciPy, and scikit-learn. Finally, the book covers ethics and privacy concerns in data science and suggests resources for improving data science skills, as well as ways to stay up to date on new data science developments. By the end of the book, you should be able to comfortably use Python for basic data science projects and should have the skills to execute the data science process on any data source.
Table of Contents (30 chapters)
1
Part I - An Introduction and the Basics
4
Part II - Dealing with Data
10
Part III - Statistics for Data Science
13
Part IV - Machine Learning
21
Part V - Text Analysis and Reporting
24
Part VI - Wrapping Up
28
Other Books You May Enjoy
29
Index

Summary

As we've seen, unsupervised learning can be a useful technique for uncovering patterns in data without the need for labels or targets. We saw how k-means and hierarchical clustering can deliver similar results, and how different metrics such as the within-cluster sum-of-squares (WCSS) and the silhouette score can be used to optimize the number of neighbors for k-means and hierarchical clustering. With the WCSS metric, we can use an elbow plot and find the point of maximum curvature on the plot, called the elbow, in order to find the optimal value of n_clusters.

The silhouette plot was demonstrated as another way to evaluate the quality of the clustering fit. We also saw how to create visualizations of clusters and look at summary statistics for clusters to understand what the clustering results mean. Lastly, we looked at how DBSCAN works and one method for deciding on the best eps and min_samples hyperparameters that determine how the clusters are formed.

Now...