35. Neo4j, Inc. All rights reserved 2021
User
:VISITED
Website
User
IPLocation
Website
IPLocation
Website
Website
Website
:VISITED
:VISITED
:VISITED
:USED
:USED
:
U
S
E
D
:
V
I
S
I
T
E
D
:
V
I
S
I
T
E
D
:VISITED
:SAME_AS
Graphs allow you to make implicit
relationships….
….explicit
And they grow too…?!
36. Neo4j, Inc. All rights reserved 2021
:SAME_AS
User
:VISITED
Website
User
IPLocation
Website
IPLocation
Website
Website
Website
:VISITED
:VISITED
:VISITED
:USED
:USED
:
U
S
E
D
:
V
I
S
I
T
E
D
:
V
I
S
I
T
E
D
:VISITED
User
:SAM
E_AS
:USED
:VISITED
PersonId: 1
PersonId: 1 PersonId: 1
User
PersonId: 2
:VISITED
…and can then group similar nodes…and
create a new graph from the explicit
relationships…
A graph grows organically - gaining
insights and enriching your data
Graphs Grow….!
37. Neo4j, Inc. All rights reserved 2021
37
Knowledge graphs in Credit risk analysis
39. Neo4j, Inc. All rights reserved 2021
39
From implicit to explicit…
Query your Knowledge
Graph
Graph Algorithms
Graph Native
Machine Learning
Find the patterns you’re
looking for in connected data
Use unsupervised machine
learning techniques to
identify associations,
anomalies, and trends.
Use embeddings to learn the
features in your graph that
you don’t even know are
important yet.
Train in-graph supervised ML
models to predict links,
labels, and missing data.
40. Neo4j, Inc. All rights reserved 2021
40
65+ Graph Algorithms - Out of the Box
Pathfinding & Search Centrality Community Detection
❏ Delta-Stepping Single-Source
❏ Dijkstra’s Single-Source
❏ Dijkstra Source-Target
❏ All Pairs Shortest Path
❏ A* Shortest Path
❏ Yen’s K Shortest Path
❏ Minimum Weight Spanning Tree
❏ Random Walk
❏ Breadth & Depth First Search
❏ Degree Centrality
❏ Closeness Centrality
❏ Harmonic Centrality
❏ Betweenness Centrality & Approx.
❏ PageRank
❏ Personalized PageRank
❏ ArticleRank
❏ Eigenvector Centrality
❏ Hyperlink Induced Topic Search (HITS)
❏ Influence Maximization (Greedy, CELF)
❏ Weakly Connected Components
❏ Strongly Connected Components
❏ Label Propagation
❏ Leiden
❏ Louvain
❏ K-Means Clustering
❏ K-1 Coloring
❏ Modularity Optimization
❏ Speaker Listener Label Propagation
❏ Approximate Max K-Cut
❏ Triangle Count
❏ Local Clustering Coefficient
❏ Conductance Metric
Heuristic LP Similarity Graph Embeddings
❏ Adamic Adar
❏ Common Neighbors
❏ Preferential Attachment
❏ Resource Allocations
❏ Same Community
❏ Total Neighbors
❏ K-Nearest Neighbors (KNN)
❏ Filtered K-Nearest Neighbors (KNN)
❏ Node Similarity
❏ Filtered Node Similarity
❏ Similarity Functions
❏ Fast Random Projection (FastRP)
❏ Node2Vec
❏ GraphSAGE
❏ HashGNN
41. Neo4j, Inc. All rights reserved 2021
41
Before we go any further…let’s
quiz!
42. Neo4j, Inc. All rights reserved 2021
42
Which of the colored nodes would be considered the most
‘important'?
43. Neo4j, Inc. All rights reserved 2021
43
Which of the colored nodes would be considered the most
‘important'?
44. Neo4j, Inc. All rights reserved 2021
Graph Embeddings:
The bridge to traditional ML
44
45. Neo4j, Inc. All rights reserved 2021
Node Embedding
What are node embeddings?
How?
The representation of nodes as low-dimensional vectors that
summarize their graph position, the structure of their local graph
neighborhood as well as any possible node features
Encoder - Decoder Framework
51. Leveraging LLM’s to augment Knowledge and insights
Accelerate better explainable outcomes with your data and Generative AI through Data
Augmented Generation powered by Neo4j Knowledge Graphs
Apps
Structured
Data
Unstructured
Data
Intranet
Internet
Social Media
Other online
contents
Knowledge
Extraction
Knowledge
Compression
Open Domain
Knowledge
Graph
Closed Domain
Knowledge
Graph
Knowledge
Lake
Knowledge
Enrichment
Augmented
Generation
Knowledge
Discovery
Experimentation
& Discovery
Education &
Enablement
Regulatory
Compliance
Sustainability Business Insights
Cyber
Observability
And More!
Automation
Layer
Knowledge
Layer
Data Augmented
Generation Layer
Outcomes
59. Neo4j, Inc. All rights reserved 2021
59
https://www.orbitmi.com/blog/how-neo4j-enables-orbit-ai-routing
60. Neo4j, Inc. All rights reserved 2021
60
Customer Case Study:
Logistics and Supply Chain
Plan maritime routes based on distances,
costs, and internal logic.
Results:
● Subsecond maritime routes planning
● Reduce global carbon emissions
60,000 tons
● 12-16M ROI for OrbitMI customers
“We wanted to create a solution that exploits
artificial intelligence, integrates current and
historical AIS positions as well as multiple
data feeds and APIs. Such an effort would
require a world-class infrastructure. That’s
why we selected Neo4j.”
David Levy
Chief Marketing Officer
OrbitMI
61. Neo4j, Inc. All rights reserved 2021
61
AstraZeneca
Patient Journey
“We used graph algorithms to find
patients that had specific journey
types and patterns and then find
others that are close and similar.”
Joseph Roemer
Global Commercial IT Insight & Analytics Sr. Director
AstraZeneca
● Challenge: How to best intervene sooner for
complex diseases that develop over years
● Solution: Neo4j knowledge graph of 3 yrs of
visits, tests, & diagnosis with 10’s Bn of
records. Using graph algorithms and
machine learning together.
● Results:
○ Identified journey archetypes and
patterns using graph feature
engineering as input to ML
○ Revealed journey similarities over
time with community detection
○ Found influential touch-points in the
journey using graph algorithms
62. Neo4j, Inc. All rights reserved 2021
62
Neo4j working with Banking Circle to detect Fraud
65. Neo4j, Inc. All rights reserved 2021
Let’s wrap up….
● Graphs present the world how we know and learn it
● Graph Databases can handle vast amounts of data
● Detect implicit relationships and learn from your network structure
with Graph Data Science
● Next steps: try it out - use Neo4j Sandbox for your own
projects…and do not suffer in silence, let us help you!