Search icon CANCEL
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

You're reading from   Practical Data Analysis Pandas, MongoDB, Apache Spark, and more

Arrow left icon
Product type Paperback
Published in Sep 2016
Publisher
ISBN-13 9781785289712
Length 338 pages
Edition 2nd Edition
Languages
Arrow right icon
Authors (2):
Arrow left icon
Hector Cuesta Hector Cuesta
Author Profile Icon Hector Cuesta
Hector Cuesta
Dr. Sampath Kumar Dr. Sampath Kumar
Author Profile Icon Dr. Sampath Kumar
Dr. Sampath Kumar
Arrow right icon
View More author details
Toc

Table of Contents (16) Chapters Close

Preface 1. Getting Started 2. Preprocessing Data FREE CHAPTER 3. Getting to Grips with Visualization 4. Text Classification 5. Similarity-Based Image Retrieval 6. Simulation of Stock Prices 7. Predicting Gold Prices 8. Working with Support Vector Machines 9. Modeling Infectious Diseases with Cellular Automata 10. Working with Social Graphs 11. Working with Twitter Data 12. Data Processing and Aggregation with MongoDB 13. Working with MapReduce 14. Online Data Analysis with Jupyter and Wakari 15. Understanding Data Processing using Apache Spark

Working with graphs using Gephi

Gephi is open source software for visualizing and analyzing large networks graphs, which runs on Windows, Linux, and Mac OS X. We can freely download Gephi from its website, listed here. For installation instructions, please refer to AppendixSetting Up the Infrastructure:

https://gephi.org/users/download/

To visualize your social network graph, you just need to open Gephi, click on the File menu and select Open, then look up and select our file, friends.gdf, and click on the Open button. We can see our graph in the following screenshot.

In the following screenshot, we can see the visualization of the graph (1,274 nodes and 43,928 links). The nodes represent friends and the links represent how the friends are connected to each other. The graph looks very dense and does not provide us with much insight; the next step is to find groups through a Modularity algorithm and color classification:

Working with graphs using Gephi

Tip

For complete reference documentation on Gephi, please refer...

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