Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Save more on your purchases now! discount-offer-chevron-icon
Savings automatically calculated. No voucher code required.
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Conferences
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Practical Data Analysis Cookbook

You're reading from   Practical Data Analysis Cookbook Over 60 practical recipes on data exploration and analysis

Arrow left icon
Product type Paperback
Published in Apr 2016
Publisher
ISBN-13 9781783551668
Length 384 pages
Edition 1st Edition
Languages
Tools
Arrow right icon
Author (1):
Arrow left icon
Tomasz Drabas Tomasz Drabas
Author Profile Icon Tomasz Drabas
Tomasz Drabas
Arrow right icon
View More author details
Toc

Table of Contents (13) Chapters Close

Preface 1. Preparing the Data 2. Exploring the Data FREE CHAPTER 3. Classification Techniques 4. Clustering Techniques 5. Reducing Dimensions 6. Regression Methods 7. Time Series Techniques 8. Graphs 9. Natural Language Processing 10. Discrete Choice Models 11. Simulations Index

Introduction


Graphs are everywhere; when you get in your car and drive around using a GPS, you perhaps do not even realize that it is solving a graph problem to get you from point A to point B over the shortest path or in the shortest time.

The origins of graph theory reach the 18th century when Leonard Euler proposed the solution to the Königsberg bridge problem. (To read more on the topic, you can refer to http://www2.gsu.edu/~matgtc/origin%20of%20graph%20theory.pdf.) From that point onward, some of the problems that were deemed unsolvable could be solved; the Internet (or even your local network) can be viewed and analyzed as a graph, scheduling problems that airlines solve can be modeled as a graph, or (as we will see) a social network is much easier to handle if we realize that it is a graph.

Graphs are structures consisting of nodes (sometimes called vertices) and edges (sometimes called arcs or lines) that connect two nodes:

The preceding example shows the simplest network possible,...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $19.99/month. Cancel anytime