Book Image

Python Data Science Essentials - Third Edition

By : Alberto Boschetti, Luca Massaron
Book Image

Python Data Science Essentials - Third Edition

By: Alberto Boschetti, Luca Massaron

Overview of this book

Fully expanded and upgraded, the latest edition of Python Data Science Essentials will help you succeed in data science operations using the most common Python libraries. This book offers up-to-date insight into the core of Python, including the latest versions of the Jupyter Notebook, NumPy, pandas, and scikit-learn. The book covers detailed examples and large hybrid datasets to help you grasp essential statistical techniques for data collection, data munging and analysis, visualization, and reporting activities. You will also gain an understanding of advanced data science topics such as machine learning algorithms, distributed computing, tuning predictive models, and natural language processing. Furthermore, You’ll also be introduced to deep learning and gradient boosting solutions such as XGBoost, LightGBM, and CatBoost. By the end of the book, you will have gained a complete overview of the principal machine learning algorithms, graph analysis techniques, and all the visualization and deployment instruments that make it easier to present your results to an audience of both data science experts and business users

Related Content you might be interested in

Current Title:

Small book image
Python Data Science Essentials - Third Edition
Alberto Boschetti | Luca Massaron
Sep, 2018 | 472 pages
Small book image
scikit-learn Cookbook
Julian Avila | Trent Hauck
Nov, 2017 | 374 pages
Small book image
Machine Learning Algorithms
Giuseppe Bonaccorso
Aug, 2018 | 522 pages
Small book image
Hands-On Automated Machine Learning
Sibanjan Das | Umit Mert Cakmak
Apr, 2018 | 282 pages
Table of Contents (11 chapters)
Preface
Preface
Who this book is for
What this book covers
To get the most out of this book
Get in touch
Free Chapter
1
First Steps
First Steps
Introducing data science and Python
Installing Python
Introducing Jupyter
Datasets and code used in this book
Summary
2
Data Munging
Data Munging
The data science process
Data loading and preprocessing with pandas
Working with categorical and textual data
Data processing with NumPy
Creating NumPy arrays
NumPy fast operation and computations
Summary
3
The Data Pipeline
The Data Pipeline
Introducing EDA
Building new features
Dimensionality reduction
The detection and treatment of outliers
Validation metrics
Testing and validating
Cross-validation
Hyperparameter optimization
Feature selection
Wrapping everything in a pipeline
Summary
4
Machine Learning
Machine Learning
Preparing tools and datasets
Linear and logistic regression
Naive Bayes
K-Nearest Neighbors
Nonlinear algorithms
Ensemble strategies
Dealing with big data
A peek into natural language processing (NLP)
An overview of unsupervised learning
Summary
5
Visualization, Insights, and Results
Visualization, Insights, and Results
Introducing the basics of matplotlib
Wrapping up matplotlib's commands
Advanced data learning representation
Summary
6
Social Network Analysis
Social Network Analysis
Introduction to graph theory
Graph algorithms
Graph loading, dumping, and sampling
Summary
7
Deep Learning Beyond the Basics
Deep Learning Beyond the Basics
Approaching deep learning
Classifying images with CNN
Using pre-trained models
Working with temporal sequences
Summary
8
Spark for Big Data
Spark for Big Data
From a standalone machine to a bunch of nodes
Starting with PySpark
Sharing variables across cluster nodes
Data preprocessing in Spark
Machine learning with Spark
Summary
9
Strengthen Your Python Foundations
Strengthen Your Python Foundations
Your learning list
Learn by watching, reading, and doing
10
Other Books You May Enjoy
Other Books You May Enjoy
Leave a review - let other readers know what you think

Graph algorithms

To get insights from graphs, many algorithms have been developed. In this chapter, we'll use a well-known graph in NetworkX, that is, the Krackhardt Kite graph. It is a dummy graph containing 10 nodes, and it is typically used to proof graph algorithms. David Krackhardt is the creator of the structure, which has the shape of a kite. It's composed of two different zones. In the first zone (composed of nodes 0 to 6), the nodes are interlinked; in the other zone (nodes 7 to 9), they are connected as a chain:

In: G = nx.krackhardt_kite_graph()
    nx.draw_networkx(G)
    plt.show()

In the following plot, you can examine the Krackhardt Kite's graph structure:

Let's start with connectivity. Two nodes of a graph are connected if there is at least a path (that is, a sequence of nodes) between them.

If at least one path exists, the shortest path between...

Previous Section
End of Section 3
Next Section