꧁❤ Aerocity Call Girls Service Aerocity Delhi ❤꧂ 9999965857 ☎️ Hard And Sexy ...
Insights from knowledge graphs using reasoners, visual analytics and network science
1. Insights from Knowledge Graphs
Anirudh Prabhu,
Keck Deep Time Data Infrastructure Team
and the Deep Carbon Observatory Data Science Team
@Anirudh_14
9. What is
encoded vs
What is
seen
Encoded Seen/Inferred/Calculated
Nodes Patterns in the Network Geometry
Edges Sub-Communities formed in the
Network
Layout (Mostly Force Directed) Important Hubs in the Network
Additional Parameters for Nodes
(Optional)
Additional metrics that explain the
complexity of the environment
(assortativity, betweenness,
centrality etc.)
9
• Comparison of how different networks change through time also
help understand the given environment.
11. D3js
◦ JavaScript Library for Visualizing Data.
◦ Create force-directed network layout.
◦ Example
◦ https://bl.ocks.org/steveharoz/8c3e2524079
a8c440df60c1ab72b5d03
12. iGraph
◦ R package for creating
static graphs.
◦ Covers most of the
required functions for
creating, analyzing and
interpreting networks.
◦ Graph objects can be
easily converted to
different data structures
required for other
exploration.
12
Pb
U
P
Al
As
Cu
Ca
K
Na
C
S
Si
V
Ba
Fe
Mg
Mo
Se
13. visNetwork
◦ R package written using the
Javascript library.
◦ Easier to deal with data
structures in R, than using
JavaScript.
◦ The data objects from the
network can be directly used
for further analysis.
15. Ediacaran Assemblage Networks
Extinction Event
at 560 Ma?
Drew Muscente: “Nama and White Sea fauna are different facies,
whereas a mass extinction occurred after the Avalonian.” – science
hypothesis
18. Data Structure
• Symmetric adjacency matrix
• Rows and column names represent mineral species
• Values represent co-occurrence of 2 minerals
Node List and Properties
Adjacency Matrix
20. What is
encoded vs
What is
seen
Encoded Seen/Inferred/Calculated
Nodes Patterns in the Network Geometry
Edges Sub-Communities formed in the
Network
Layout (Mostly Force Directed) Important Hubs in the Network
Additional Parameters for Nodes
(Optional)
Additional metrics that explain the
complexity of the environment
(assortativity, betweenness,
centrality etc.)
20
• Comparison of how different networks change through time also
help understand the given environment.
23. Assortativity
(Homophily)
◦ Network equivalent of
Pearson correlation
coefficient
◦ Values between 1 & -1
◦ 1 = similarity favors
connections
◦ 0 = non-assortative
◦ -1 = opposites attract
23
•Muscente AD, Prabhu A, Zhong H, Eleish A, Meyer M,
Fox P, Hazen R, and Knoll A (2017) The network
paleoecology of mass extinctions. PNAS.
24. Community
Detection
◦ Finding communities in a network
◦ Insight into the nature of the nodes
◦ Patterns of the evolution of the network
◦ Relationships between the subgroups
26. Example : Mineral Co-occurence
26
Morrison SM, Liu C, Eleish A, Prabhu A, Li
C, Ralph J, Downs RT, Golden JJ, Fox P,
Hummer DR, Meyer MB, and Hazen RM
(2017) Network analysis of mineralogical
systems. American Mineralogist 102
• Groups correspond to Paragenetic Mode.
• Paragenetic Mode : Formation Conditions.
• How and when the Minerals were formed.
27. Example : Evolving Networks
27
Moore, E. K., Hao, J., Prabhu,
A., Zhong, H., Jelen, B. I.,
Meyer, M., ... & Falkowski, P.
G. (2018). Geological and
Chemical Factors that
Impacted the Biological
Utilization of Cobalt in the
Archean Eon. Journal of
Geophysical Research:
Biogeosciences.
30. Metrics: Local
Degree is the number of links connected to a given node.
35
1 2
2
3
0.56
0 0
0.5
0
10
1
1
Betweenness is a measure of the number of geodesic
paths that pass through a given node.
Distance is the geodesic (shortest) between any
two nodes.
31. Metrics: Global
Density, D, is the no. of links divided by
the no. of possible links
D = 0.66 D = 1D = 0.33
Low density High density
D =
2𝐿
𝑁(𝑁−1)
32. Metrics: Global
Diameter: largest geodesic distance in a network (the
shortest path between the two most separated nodes)
Mean Distance: average “degree of separation” in a
network
33. Metrics: Global
Centralization:
A measure of how central a network’s ”most central” node is relative to how
central all the other nodes are.
• Degree centralization: number of links to each node
• Are there many highly interconnected nodes?
• Betweenness centralization: number of shortest paths through
each node
• Are there a few key “broker” nodes?
To generate these candidates, we have developed individual rulesets that use compatibility assertions to describe how well the 2 entities work together.
A candidate describes a combination of service, event, physical feature, 1-2 data fields.
Rules are used to make compatibility assertions about the candidates.
Each compatibility assertion value(which can be one of 5 values)and confidence metric(ranged from 0 to 1) pair, is associated with a single candidate.
When the rules are run, we get all of the compatibility assertions for a candidate.
Another set of rules look at associations between service, variables, events etc and makes a compatibility assertion with the relevance of events related information and visualization services.
We then rank the candidates by plugging all the assertions and candidates into our scoring algorithm.
In this slide, you can see an example of a rule which state that half-hourly time intervals are ideal to analyze Hurricane and Tropical storm data.
Image is hyperlinked to the web version of VOWL.
With the Animal Family Fossil Network, we see more pronounced extinction events. This may help identify previously unknown extinction events. When combined with other analytics methods, we can also quantify these extinction events.
Click the image for the performance hyperlink. And use it to highlight the how subcommunities can be seen in network layouts.
These types of analysis can also be done on larger scales! Here is