Search icon CANCEL
Subscription
0
Cart icon
Cart
Close icon
You have no products in your basket yet
Save more on your purchases!
Savings automatically calculated. No voucher code required
Arrow left icon
All Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Newsletters
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Hands-On Graph Analytics with Neo4j

You're reading from  Hands-On Graph Analytics with Neo4j

Product type Book
Published in Aug 2020
Publisher Packt
ISBN-13 9781839212611
Pages 510 pages
Edition 1st Edition
Languages
Author (1):
Estelle Scifo Estelle Scifo
Profile icon Estelle Scifo
Toc

Table of Contents (18) Chapters close

Preface 1. Section 1: Graph Modeling with Neo4j
2. Graph Databases 3. The Cypher Query Language 4. Empowering Your Business with Pure Cypher 5. Section 2: Graph Algorithms
6. The Graph Data Science Library and Path Finding 7. Spatial Data 8. Node Importance 9. Community Detection and Similarity Measures 10. Section 3: Machine Learning on Graphs
11. Using Graph-based Features in Machine Learning 12. Predicting Relationships 13. Graph Embedding - from Graphs to Matrices 14. Section 4: Neo4j for Production
15. Using Neo4j in Your Web Application 16. Neo4j at Scale 17. Other Books You May Enjoy
Graph Embedding - from Graphs to Matrices

In this chapter, we will continue to explore the topic of graph analytics and address the last piece of the puzzle: feature learning through graphs via embedding. Embedding became popular thanks to the word embedding used in Natural Language Processing (NLP). In this chapter, we will first address why embedding is important and learn about the different types of analyses covered by the term graph embedding. Following that, we will start learning about embedding algorithms from a number of algorithms based on the graph adjacency matrix trying to reduce its size.

Later on, we will continue our journey by discovering how neural networks can help with embedding. Starting with the example of word embedding, we will learn about the skip-gram model and draw parallels with graphs with the DeepWalk algorithm. Finally, in the last section, we will...

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 $15.99/month. Cancel anytime}