Book Overview & Buying
Table Of Contents
Feedback & Rating

Geospatial Data Science Quick Start Guide

By : Abdishakur Hassan, Jayakrishnan Vijayaraghavan

4 (6)

Buy this Book

Geospatial Data Science Quick Start Guide

4 (6)

By: Abdishakur Hassan, Jayakrishnan Vijayaraghavan

Buy this Book

Overview of this book

Data scientists, who have access to vast data streams, are a bit myopic when it comes to intrinsic and extrinsic location-based data and are missing out on the intelligence it can provide to their models. This book demonstrates effective techniques for using the power of data science and geospatial intelligence to build effective, intelligent data models that make use of location-based data to give useful predictions and analyses. This book begins with a quick overview of the fundamentals of location-based data and how techniques such as Exploratory Data Analysis can be applied to it. We then delve into spatial operations such as computing distances, areas, extents, centroids, buffer polygons, intersecting geometries, geocoding, and more, which adds additional context to location data. Moving ahead, you will learn how to quickly build and deploy a geo-fencing system using Python. Lastly, you will learn how to leverage geospatial analysis techniques in popular recommendation systems such as collaborative filtering and location-based recommendations, and more. By the end of the book, you will be a rockstar when it comes to performing geospatial analysis with ease.

Preface

Who this book is for

What this book covers

To get the most out of this book

Get in touch

Free Chapter

Introducing Location Intelligence

Location data

Location data intelligence

Location data science versus data science

A primer on Google Colaboratory and Jupyter Notebooks

Summary

Consuming Location Data Like a Data Scientist

Exploratory data analysis

Spatial data processing

Error metric

Building the model

Summary

Performing Spatial Operations Like a Pro

GeoDataFrames and geometries

Spatial operations

Location data visualization

Summary

Making Sense of Humongous Location Datasets

K-means clustering

Density-Based Spatial Clustering Applications with Noise

Spatial autocorrelation

Summary

Nudging Check-Ins with Geofences

Geofencing

Geometry and topology (lines and polygons)

Geofencing with Plotly

Summary

Let's Build a Routing Engine

Fundamentals of graph data structure

Shortest path analysis on a simple graph

Building a graph based on a road network

Shortest path analyses on the road network graph

Summary

Getting Location Recommender Systems

Exploratory data analysis

Recommender systems

Summary

Other Books You May Enjoy

Leave a review - let other readers know what you think

Customer Reviews

4 (6)

5 star

66.7%

4 star

3 star

2 star

33.3%

1 star

Shortest path analysis on a simple graph

Suppose you want to connect to Barack Obama through LinkedIn; how many degrees of connection do you have to go through to reach Obama? A first-degree connection is someone who is connected to you on LinkedIn. A second-degree connection is someone who is connected to your first-degree connection and so on. Assuming that each of your connections and their connections respectively are interested and ready to help you network with the Obama, research says that it only takes an average of 5 degrees of connection for you to connect with Obama, or anyone in the world, for that matter. In other words, the shortest path between any of us and Obama is less than or equal to five. That sounds strange, right? This is known as the small-world phenomenon. And, fortunately, the shortest path between This author and Obama is only three.

This means that...