SlideShare une entreprise Scribd logo
1  sur  44
The Network Data Structure in Computing Marko A. Rodriguez Los Alamos National Laboratory Vrije Universiteit Brussel [email_address] http://cnls.lanl.gov/~marko
About me. ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]
Research trends. ,[object Object],[object Object],[object Object]
What is a network? ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]
The undirected network. ,[object Object],[object Object],[object Object],[object Object],[object Object],i j
Example undirected network. Herbert Marko Aric Ed Zhiwu Alberto Jen Johan Luda Stephan Whenzong
The directed network. ,[object Object],[object Object],[object Object],i j
Example directed network. Muskrat Bear Fish Fox Meerkat Lion Human Wolf Deer Beetle Hyena
The semantic network. ,[object Object],[object Object],[object Object],i j s
Example semantic network. SantaFe Marko NewMexico Ryan California UnitedStates LANL livesIn worksWith cityOf originallyFrom stateOf stateOf locatedIn hasLab Cells Atoms madeOf madeOf researches Oregon southOf hasResident Arnold governerOf northOf
Google’s PageRank. ,[object Object],[object Object],Note: this image was stolen off the web from somewhere.
The components to calculate a  stationary probability distribution. ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],a 1 0.0123
Random walker example. a c b d 0 0 0 0
Random walker example. a c b d 1 0 0 0
Random walker example. a c b d 1 0 1 0
Random walker example. a c b d 1 0 1 1
Random walker example. a c b d 1 1 1 1
Random walker example. a c b d 1 1 2 1
Random walker example. a c b d 1 2 2 1
Random walker example. a c b d 2 2 2 1
Random walker example. a c b d 2 2 3 1
Random walker example. a c b d 2 2 3 2
Random walker example. a c b d 2 3 3 2
Random walker example. a c b d 2 3 4 2
Random walker example. a c b d 66785 133310 133321 66784
Random walker example. a c b d 0.167 0.332 0.332 0.167
Breather.
Example semantic network. SantaFe Marko NewMexico Ryan California UnitedStates LANL livesIn worksWith cityOf originallyFrom stateOf stateOf locatedIn hasLab Cells Atoms madeOf madeOf researches Oregon southOf hasResident Arnold governerOf northOf
What is the Semantic Web? ,[object Object],[object Object],[object Object],[object Object],[object Object]
What is a resource? ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]
The technologies of the Semantic Web. ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]
RDF and RDFS. lanl:marko lanl:cookie lanl:Human lanl:Food lanl:isEating rdf:type rdf:type lanl:isEating rdfs:domain rdfs:range ontology instance RDF is not a syntax. It’s a data model. Various syntaxes exist to encode RDF including RDF/XML, N-TRIPLE, TRiX, N3, etc.
PageRank in a semantic network? lanl:marko lanl:p1 lanl:wrote lanl:johan lanl:wrote ? lanl:chuck lanl:hasFriend lanl:Article rdf:type rdf:type lanl:Human rdf:type rdf:type ? ?
Components of a grammar-based walker. ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]
Grammar-based PageRank example. lanl:marko lanl:p1 lanl:wrote lanl:johan lanl:wrote lanl:chuck lanl:hasFriend lanl:Article rdf:type rdf:type lanl:Human rdf:type rdf:type 0 0 0 “ Take only  lanl:wrote  out-edge to a resource of  rdf:type   lanl:Article . Then take a  lanl:wrote  in-edge to a resource of  rdf:type lanl:Human . Increment only  lanl:Human s. Make sure that the  lanl:Human  seen before is not the same  lanl:Human  currently. Repeat infinitely.”
Grammar-based PageRank example. lanl:marko lanl:p1 lanl:wrote lanl:johan lanl:wrote lanl:chuck lanl:hasFriend lanl:Article rdf:type rdf:type lanl:Human rdf:type rdf:type “ Take only  lanl:wrote  out-edge to a resource of  rdf:type   lanl:Article . Then take a  lanl:wrote  in-edge to a resource of  rdf:type lanl:Human . Increment only  lanl:Human s. Make sure that the  lanl:Human  seen before is not the same  lanl:Human  currently. Repeat infinitely.” 1 0 0
Grammar-based PageRank example. lanl:marko lanl:p1 lanl:wrote lanl:johan lanl:wrote lanl:chuck lanl:hasFriend lanl:Article rdf:type rdf:type lanl:Human rdf:type rdf:type 1 0 0 “ Take only  lanl:wrote  out-edge to a resource of  rdf:type   lanl:Article . Then take a  lanl:wrote  in-edge to a resource of  rdf:type lanl:Human . Increment only  lanl:Human s. Make sure that the  lanl:Human  seen before is not the same  lanl:Human  currently. Repeat infinitely.”
Grammar-based PageRank example. lanl:marko lanl:p1 lanl:wrote lanl:johan lanl:wrote lanl:chuck lanl:hasFriend lanl:Article rdf:type rdf:type lanl:Human rdf:type rdf:type 1 0 1 “ Take only  lanl:wrote  out-edge to a resource of  rdf:type   lanl:Article . Then take a  lanl:wrote  in-edge to a resource of  rdf:type lanl:Human . Increment only  lanl:Human s. Make sure that the  lanl:Human  seen before is not the same  lanl:Human  currently. Repeat infinitely.”
Grammar-based PageRank example. lanl:marko lanl:p1 lanl:wrote lanl:johan lanl:wrote lanl:chuck lanl:hasFriend lanl:Article rdf:type rdf:type lanl:Human rdf:type rdf:type 1 0 1 “ Take only  lanl:wrote  out-edge to a resource of  rdf:type   lanl:Article . Then take a  lanl:wrote  in-edge to a resource of  rdf:type lanl:Human . Increment only  lanl:Human s. Make sure that the  lanl:Human  seen before is not the same  lanl:Human  currently. Repeat infinitely.”
Grammar-based PageRank example. lanl:marko lanl:p1 lanl:wrote lanl:johan lanl:wrote lanl:chuck lanl:hasFriend lanl:Article rdf:type rdf:type lanl:Human rdf:type rdf:type 2 0 1 “ Take only  lanl:wrote  out-edge to a resource of  rdf:type   lanl:Article . Then take a  lanl:wrote  in-edge to a resource of  rdf:type lanl:Human . Increment only  lanl:Human s. Make sure that the  lanl:Human  seen before is not the same  lanl:Human  currently. Repeat infinitely.”
Grammar-based PageRank example. lanl:marko lanl:p1 lanl:wrote lanl:johan lanl:wrote lanl:chuck lanl:hasFriend lanl:Article rdf:type rdf:type lanl:Human rdf:type rdf:type 2 0 1 “ Take only  lanl:wrote  out-edge to a resource of  rdf:type   lanl:Article . Then take a  lanl:wrote  in-edge to a resource of  rdf:type lanl:Human . Increment only  lanl:Human s. Make sure that the  lanl:Human  seen before is not the same  lanl:Human  currently. Repeat infinitely.”
Grammars create implicit relationships. lanl:marko lanl:p1 lanl:wrote lanl:johan lanl:wrote lanl:chuck lanl:hasFriend lanl:Article rdf:type rdf:type lanl:Human rdf:type rdf:type lanl:hasCoauthor
Conclusions. ,[object Object],[object Object],[object Object]
Related publications. ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Contenu connexe

Tendances

Systèmes de recommandation: applications en bibliothèque, archives et documen...
Systèmes de recommandation: applications en bibliothèque, archives et documen...Systèmes de recommandation: applications en bibliothèque, archives et documen...
Systèmes de recommandation: applications en bibliothèque, archives et documen...
Ecole hôtelière de Lausanne - EHL
 
Les structures en c++ (1)
Les structures en c++ (1)Les structures en c++ (1)
Les structures en c++ (1)
Wael Ismail
 
Polygon clipping with sutherland hodgeman algorithm and scan line fill algorithm
Polygon clipping with sutherland hodgeman algorithm and scan line fill algorithmPolygon clipping with sutherland hodgeman algorithm and scan line fill algorithm
Polygon clipping with sutherland hodgeman algorithm and scan line fill algorithm
Mani Kanth
 
Programmation Dynamique : Mise en œuvre et application à des problèmes en TAL
Programmation Dynamique : Mise en œuvre et application à des problèmes en TALProgrammation Dynamique : Mise en œuvre et application à des problèmes en TAL
Programmation Dynamique : Mise en œuvre et application à des problèmes en TAL
ECAM Brussels Engineering School
 
Ti1220 Lecture 2: Names, Bindings, and Scopes
Ti1220 Lecture 2: Names, Bindings, and ScopesTi1220 Lecture 2: Names, Bindings, and Scopes
Ti1220 Lecture 2: Names, Bindings, and Scopes
Eelco Visser
 
Chap1introductionimagenumerique
Chap1introductionimagenumeriqueChap1introductionimagenumerique
Chap1introductionimagenumerique
intissar0007
 

Tendances (20)

Cours de programmation en c
Cours de programmation en cCours de programmation en c
Cours de programmation en c
 
Les règles de passage
Les règles de passageLes règles de passage
Les règles de passage
 
Systèmes de recommandation: applications en bibliothèque, archives et documen...
Systèmes de recommandation: applications en bibliothèque, archives et documen...Systèmes de recommandation: applications en bibliothèque, archives et documen...
Systèmes de recommandation: applications en bibliothèque, archives et documen...
 
Chapitre 5 arbres binaires
Chapitre 5 arbres binairesChapitre 5 arbres binaires
Chapitre 5 arbres binaires
 
AI Apprentissage Automatique, Machine Learnig
AI Apprentissage Automatique, Machine LearnigAI Apprentissage Automatique, Machine Learnig
AI Apprentissage Automatique, Machine Learnig
 
Cours 2 conception d'une ihm
Cours 2   conception d'une ihm Cours 2   conception d'une ihm
Cours 2 conception d'une ihm
 
Les structures en c++ (1)
Les structures en c++ (1)Les structures en c++ (1)
Les structures en c++ (1)
 
Chapitre 8: Les arbres
Chapitre 8: Les  arbresChapitre 8: Les  arbres
Chapitre 8: Les arbres
 
Introduction au traitement d'images
Introduction au traitement d'imagesIntroduction au traitement d'images
Introduction au traitement d'images
 
Chapitre 2 complexité
Chapitre 2 complexitéChapitre 2 complexité
Chapitre 2 complexité
 
Polygon clipping with sutherland hodgeman algorithm and scan line fill algorithm
Polygon clipping with sutherland hodgeman algorithm and scan line fill algorithmPolygon clipping with sutherland hodgeman algorithm and scan line fill algorithm
Polygon clipping with sutherland hodgeman algorithm and scan line fill algorithm
 
Data mining - Associativité
Data mining - AssociativitéData mining - Associativité
Data mining - Associativité
 
séries 3 Recherche Operationnelle sur www.coursdefsjes.com
 séries 3 Recherche Operationnelle sur www.coursdefsjes.com séries 3 Recherche Operationnelle sur www.coursdefsjes.com
séries 3 Recherche Operationnelle sur www.coursdefsjes.com
 
Symbol table management and error handling in compiler design
Symbol table management and error handling in compiler designSymbol table management and error handling in compiler design
Symbol table management and error handling in compiler design
 
Les systèmes de recommandations
Les systèmes de recommandationsLes systèmes de recommandations
Les systèmes de recommandations
 
Programmation Dynamique : Mise en œuvre et application à des problèmes en TAL
Programmation Dynamique : Mise en œuvre et application à des problèmes en TALProgrammation Dynamique : Mise en œuvre et application à des problèmes en TAL
Programmation Dynamique : Mise en œuvre et application à des problèmes en TAL
 
Ti1220 Lecture 2: Names, Bindings, and Scopes
Ti1220 Lecture 2: Names, Bindings, and ScopesTi1220 Lecture 2: Names, Bindings, and Scopes
Ti1220 Lecture 2: Names, Bindings, and Scopes
 
Reconnaissance de formes
Reconnaissance de formesReconnaissance de formes
Reconnaissance de formes
 
Chap1introductionimagenumerique
Chap1introductionimagenumeriqueChap1introductionimagenumerique
Chap1introductionimagenumerique
 
Chapitre 2 problème de plus court chemin
Chapitre 2 problème de plus court cheminChapitre 2 problème de plus court chemin
Chapitre 2 problème de plus court chemin
 

En vedette

Word and its semantic structure
Word and its semantic structureWord and its semantic structure
Word and its semantic structure
Anatol Pripisnov
 
Random forest
Random forestRandom forest
Random forest
Ujjawal
 
Structural Semantics
Structural SemanticsStructural Semantics
Structural Semantics
Maqsood Ahmad
 
Symbol table design (Compiler Construction)
Symbol table design (Compiler Construction)Symbol table design (Compiler Construction)
Symbol table design (Compiler Construction)
Tech_MX
 

En vedette (10)

Peer To Peer Networking
Peer To Peer NetworkingPeer To Peer Networking
Peer To Peer Networking
 
Decision Forests and discriminant analysis
Decision Forests and discriminant analysisDecision Forests and discriminant analysis
Decision Forests and discriminant analysis
 
Random Forest for Big Data
Random Forest for Big DataRandom Forest for Big Data
Random Forest for Big Data
 
Word and its semantic structure
Word and its semantic structureWord and its semantic structure
Word and its semantic structure
 
ROLE OF COMMUNICATION IN SELF DEVELOPMENT
ROLE OF COMMUNICATION IN SELF DEVELOPMENT ROLE OF COMMUNICATION IN SELF DEVELOPMENT
ROLE OF COMMUNICATION IN SELF DEVELOPMENT
 
Random forest
Random forestRandom forest
Random forest
 
Structural Semantics
Structural SemanticsStructural Semantics
Structural Semantics
 
Gremlin's Graph Traversal Machinery
Gremlin's Graph Traversal MachineryGremlin's Graph Traversal Machinery
Gremlin's Graph Traversal Machinery
 
Jan vitek distributedrandomforest_5-2-2013
Jan vitek distributedrandomforest_5-2-2013Jan vitek distributedrandomforest_5-2-2013
Jan vitek distributedrandomforest_5-2-2013
 
Symbol table design (Compiler Construction)
Symbol table design (Compiler Construction)Symbol table design (Compiler Construction)
Symbol table design (Compiler Construction)
 

Similaire à The Network Data Structure in Computing

An introduction to Semantic Web and Linked Data
An introduction to Semantic Web and Linked DataAn introduction to Semantic Web and Linked Data
An introduction to Semantic Web and Linked Data
Gabriela Agustini
 

Similaire à The Network Data Structure in Computing (20)

Neno/Fhat: Semantic Network Programming Language and Virtual Machine Specific...
Neno/Fhat: Semantic Network Programming Language and Virtual Machine Specific...Neno/Fhat: Semantic Network Programming Language and Virtual Machine Specific...
Neno/Fhat: Semantic Network Programming Language and Virtual Machine Specific...
 
The Lonesome LOD Cloud
The Lonesome LOD CloudThe Lonesome LOD Cloud
The Lonesome LOD Cloud
 
Semantic Web
Semantic WebSemantic Web
Semantic Web
 
Our World is Socio-technical
Our World is Socio-technicalOur World is Socio-technical
Our World is Socio-technical
 
Machine reading for the Semantic Web
Machine reading for the Semantic WebMachine reading for the Semantic Web
Machine reading for the Semantic Web
 
Understanding the Standards Gap
Understanding the Standards GapUnderstanding the Standards Gap
Understanding the Standards Gap
 
A Semantic Multimedia Web (Part 2)
A Semantic Multimedia Web (Part 2)A Semantic Multimedia Web (Part 2)
A Semantic Multimedia Web (Part 2)
 
Semantic Web: an introduction
Semantic Web: an introductionSemantic Web: an introduction
Semantic Web: an introduction
 
Semantic Web: A web that is not the Web
Semantic Web: A web that is not the WebSemantic Web: A web that is not the Web
Semantic Web: A web that is not the Web
 
How the Web can change social science research (including yours)
How the Web can change social science research (including yours)How the Web can change social science research (including yours)
How the Web can change social science research (including yours)
 
Linked data 101: Getting Caught in the Semantic Web
Linked data 101: Getting Caught in the Semantic Web Linked data 101: Getting Caught in the Semantic Web
Linked data 101: Getting Caught in the Semantic Web
 
Web3uploaded
Web3uploadedWeb3uploaded
Web3uploaded
 
Rdf data-model-and-storage
Rdf data-model-and-storageRdf data-model-and-storage
Rdf data-model-and-storage
 
The web – A hypermedia story
The web – A hypermedia storyThe web – A hypermedia story
The web – A hypermedia story
 
Semantic web
Semantic webSemantic web
Semantic web
 
Linked Open Data
Linked Open DataLinked Open Data
Linked Open Data
 
EgoSystem: Presentation to LITA, American Library Association, Nov 8 2014
EgoSystem: Presentation to LITA, American Library Association, Nov 8 2014EgoSystem: Presentation to LITA, American Library Association, Nov 8 2014
EgoSystem: Presentation to LITA, American Library Association, Nov 8 2014
 
When?
When?When?
When?
 
Creating Web APIs with JSON-LD and RDF
Creating Web APIs with JSON-LD and RDFCreating Web APIs with JSON-LD and RDF
Creating Web APIs with JSON-LD and RDF
 
An introduction to Semantic Web and Linked Data
An introduction to Semantic Web and Linked DataAn introduction to Semantic Web and Linked Data
An introduction to Semantic Web and Linked Data
 

Plus de Marko Rodriguez

Memoirs of a Graph Addict: Despair to Redemption
Memoirs of a Graph Addict: Despair to RedemptionMemoirs of a Graph Addict: Despair to Redemption
Memoirs of a Graph Addict: Despair to Redemption
Marko Rodriguez
 

Plus de Marko Rodriguez (20)

mm-ADT: A Virtual Machine/An Economic Machine
mm-ADT: A Virtual Machine/An Economic Machinemm-ADT: A Virtual Machine/An Economic Machine
mm-ADT: A Virtual Machine/An Economic Machine
 
mm-ADT: A Multi-Model Abstract Data Type
mm-ADT: A Multi-Model Abstract Data Typemm-ADT: A Multi-Model Abstract Data Type
mm-ADT: A Multi-Model Abstract Data Type
 
Open Problems in the Universal Graph Theory
Open Problems in the Universal Graph TheoryOpen Problems in the Universal Graph Theory
Open Problems in the Universal Graph Theory
 
Gremlin 101.3 On Your FM Dial
Gremlin 101.3 On Your FM DialGremlin 101.3 On Your FM Dial
Gremlin 101.3 On Your FM Dial
 
Quantum Processes in Graph Computing
Quantum Processes in Graph ComputingQuantum Processes in Graph Computing
Quantum Processes in Graph Computing
 
ACM DBPL Keynote: The Graph Traversal Machine and Language
ACM DBPL Keynote: The Graph Traversal Machine and LanguageACM DBPL Keynote: The Graph Traversal Machine and Language
ACM DBPL Keynote: The Graph Traversal Machine and Language
 
The Gremlin Graph Traversal Language
The Gremlin Graph Traversal LanguageThe Gremlin Graph Traversal Language
The Gremlin Graph Traversal Language
 
The Path Forward
The Path ForwardThe Path Forward
The Path Forward
 
Faunus: Graph Analytics Engine
Faunus: Graph Analytics EngineFaunus: Graph Analytics Engine
Faunus: Graph Analytics Engine
 
Solving Problems with Graphs
Solving Problems with GraphsSolving Problems with Graphs
Solving Problems with Graphs
 
Titan: The Rise of Big Graph Data
Titan: The Rise of Big Graph DataTitan: The Rise of Big Graph Data
Titan: The Rise of Big Graph Data
 
The Pathology of Graph Databases
The Pathology of Graph DatabasesThe Pathology of Graph Databases
The Pathology of Graph Databases
 
Traversing Graph Databases with Gremlin
Traversing Graph Databases with GremlinTraversing Graph Databases with Gremlin
Traversing Graph Databases with Gremlin
 
The Path-o-Logical Gremlin
The Path-o-Logical GremlinThe Path-o-Logical Gremlin
The Path-o-Logical Gremlin
 
The Gremlin in the Graph
The Gremlin in the GraphThe Gremlin in the Graph
The Gremlin in the Graph
 
Memoirs of a Graph Addict: Despair to Redemption
Memoirs of a Graph Addict: Despair to RedemptionMemoirs of a Graph Addict: Despair to Redemption
Memoirs of a Graph Addict: Despair to Redemption
 
Graph Databases: Trends in the Web of Data
Graph Databases: Trends in the Web of DataGraph Databases: Trends in the Web of Data
Graph Databases: Trends in the Web of Data
 
Problem-Solving using Graph Traversals: Searching, Scoring, Ranking, and Reco...
Problem-Solving using Graph Traversals: Searching, Scoring, Ranking, and Reco...Problem-Solving using Graph Traversals: Searching, Scoring, Ranking, and Reco...
Problem-Solving using Graph Traversals: Searching, Scoring, Ranking, and Reco...
 
A Perspective on Graph Theory and Network Science
A Perspective on Graph Theory and Network ScienceA Perspective on Graph Theory and Network Science
A Perspective on Graph Theory and Network Science
 
The Graph Traversal Programming Pattern
The Graph Traversal Programming PatternThe Graph Traversal Programming Pattern
The Graph Traversal Programming Pattern
 

Dernier

Histor y of HAM Radio presentation slide
Histor y of HAM Radio presentation slideHistor y of HAM Radio presentation slide
Histor y of HAM Radio presentation slide
vu2urc
 

Dernier (20)

08448380779 Call Girls In Civil Lines Women Seeking Men
08448380779 Call Girls In Civil Lines Women Seeking Men08448380779 Call Girls In Civil Lines Women Seeking Men
08448380779 Call Girls In Civil Lines Women Seeking Men
 
Histor y of HAM Radio presentation slide
Histor y of HAM Radio presentation slideHistor y of HAM Radio presentation slide
Histor y of HAM Radio presentation slide
 
A Domino Admins Adventures (Engage 2024)
A Domino Admins Adventures (Engage 2024)A Domino Admins Adventures (Engage 2024)
A Domino Admins Adventures (Engage 2024)
 
How to Troubleshoot Apps for the Modern Connected Worker
How to Troubleshoot Apps for the Modern Connected WorkerHow to Troubleshoot Apps for the Modern Connected Worker
How to Troubleshoot Apps for the Modern Connected Worker
 
Understanding Discord NSFW Servers A Guide for Responsible Users.pdf
Understanding Discord NSFW Servers A Guide for Responsible Users.pdfUnderstanding Discord NSFW Servers A Guide for Responsible Users.pdf
Understanding Discord NSFW Servers A Guide for Responsible Users.pdf
 
08448380779 Call Girls In Friends Colony Women Seeking Men
08448380779 Call Girls In Friends Colony Women Seeking Men08448380779 Call Girls In Friends Colony Women Seeking Men
08448380779 Call Girls In Friends Colony Women Seeking Men
 
Real Time Object Detection Using Open CV
Real Time Object Detection Using Open CVReal Time Object Detection Using Open CV
Real Time Object Detection Using Open CV
 
Data Cloud, More than a CDP by Matt Robison
Data Cloud, More than a CDP by Matt RobisonData Cloud, More than a CDP by Matt Robison
Data Cloud, More than a CDP by Matt Robison
 
A Call to Action for Generative AI in 2024
A Call to Action for Generative AI in 2024A Call to Action for Generative AI in 2024
A Call to Action for Generative AI in 2024
 
How to convert PDF to text with Nanonets
How to convert PDF to text with NanonetsHow to convert PDF to text with Nanonets
How to convert PDF to text with Nanonets
 
08448380779 Call Girls In Greater Kailash - I Women Seeking Men
08448380779 Call Girls In Greater Kailash - I Women Seeking Men08448380779 Call Girls In Greater Kailash - I Women Seeking Men
08448380779 Call Girls In Greater Kailash - I Women Seeking Men
 
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
 
Slack Application Development 101 Slides
Slack Application Development 101 SlidesSlack Application Development 101 Slides
Slack Application Development 101 Slides
 
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdf
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdfThe Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdf
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdf
 
Boost Fertility New Invention Ups Success Rates.pdf
Boost Fertility New Invention Ups Success Rates.pdfBoost Fertility New Invention Ups Success Rates.pdf
Boost Fertility New Invention Ups Success Rates.pdf
 
Presentation on how to chat with PDF using ChatGPT code interpreter
Presentation on how to chat with PDF using ChatGPT code interpreterPresentation on how to chat with PDF using ChatGPT code interpreter
Presentation on how to chat with PDF using ChatGPT code interpreter
 
Automating Google Workspace (GWS) & more with Apps Script
Automating Google Workspace (GWS) & more with Apps ScriptAutomating Google Workspace (GWS) & more with Apps Script
Automating Google Workspace (GWS) & more with Apps Script
 
🐬 The future of MySQL is Postgres 🐘
🐬  The future of MySQL is Postgres   🐘🐬  The future of MySQL is Postgres   🐘
🐬 The future of MySQL is Postgres 🐘
 
Handwritten Text Recognition for manuscripts and early printed texts
Handwritten Text Recognition for manuscripts and early printed textsHandwritten Text Recognition for manuscripts and early printed texts
Handwritten Text Recognition for manuscripts and early printed texts
 
Breaking the Kubernetes Kill Chain: Host Path Mount
Breaking the Kubernetes Kill Chain: Host Path MountBreaking the Kubernetes Kill Chain: Host Path Mount
Breaking the Kubernetes Kill Chain: Host Path Mount
 

The Network Data Structure in Computing

  • 1. The Network Data Structure in Computing Marko A. Rodriguez Los Alamos National Laboratory Vrije Universiteit Brussel [email_address] http://cnls.lanl.gov/~marko
  • 2.
  • 3.
  • 4.
  • 5.
  • 6. Example undirected network. Herbert Marko Aric Ed Zhiwu Alberto Jen Johan Luda Stephan Whenzong
  • 7.
  • 8. Example directed network. Muskrat Bear Fish Fox Meerkat Lion Human Wolf Deer Beetle Hyena
  • 9.
  • 10. Example semantic network. SantaFe Marko NewMexico Ryan California UnitedStates LANL livesIn worksWith cityOf originallyFrom stateOf stateOf locatedIn hasLab Cells Atoms madeOf madeOf researches Oregon southOf hasResident Arnold governerOf northOf
  • 11.
  • 12.
  • 13. Random walker example. a c b d 0 0 0 0
  • 14. Random walker example. a c b d 1 0 0 0
  • 15. Random walker example. a c b d 1 0 1 0
  • 16. Random walker example. a c b d 1 0 1 1
  • 17. Random walker example. a c b d 1 1 1 1
  • 18. Random walker example. a c b d 1 1 2 1
  • 19. Random walker example. a c b d 1 2 2 1
  • 20. Random walker example. a c b d 2 2 2 1
  • 21. Random walker example. a c b d 2 2 3 1
  • 22. Random walker example. a c b d 2 2 3 2
  • 23. Random walker example. a c b d 2 3 3 2
  • 24. Random walker example. a c b d 2 3 4 2
  • 25. Random walker example. a c b d 66785 133310 133321 66784
  • 26. Random walker example. a c b d 0.167 0.332 0.332 0.167
  • 28. Example semantic network. SantaFe Marko NewMexico Ryan California UnitedStates LANL livesIn worksWith cityOf originallyFrom stateOf stateOf locatedIn hasLab Cells Atoms madeOf madeOf researches Oregon southOf hasResident Arnold governerOf northOf
  • 29.
  • 30.
  • 31.
  • 32. RDF and RDFS. lanl:marko lanl:cookie lanl:Human lanl:Food lanl:isEating rdf:type rdf:type lanl:isEating rdfs:domain rdfs:range ontology instance RDF is not a syntax. It’s a data model. Various syntaxes exist to encode RDF including RDF/XML, N-TRIPLE, TRiX, N3, etc.
  • 33. PageRank in a semantic network? lanl:marko lanl:p1 lanl:wrote lanl:johan lanl:wrote ? lanl:chuck lanl:hasFriend lanl:Article rdf:type rdf:type lanl:Human rdf:type rdf:type ? ?
  • 34.
  • 35. Grammar-based PageRank example. lanl:marko lanl:p1 lanl:wrote lanl:johan lanl:wrote lanl:chuck lanl:hasFriend lanl:Article rdf:type rdf:type lanl:Human rdf:type rdf:type 0 0 0 “ Take only lanl:wrote out-edge to a resource of rdf:type lanl:Article . Then take a lanl:wrote in-edge to a resource of rdf:type lanl:Human . Increment only lanl:Human s. Make sure that the lanl:Human seen before is not the same lanl:Human currently. Repeat infinitely.”
  • 36. Grammar-based PageRank example. lanl:marko lanl:p1 lanl:wrote lanl:johan lanl:wrote lanl:chuck lanl:hasFriend lanl:Article rdf:type rdf:type lanl:Human rdf:type rdf:type “ Take only lanl:wrote out-edge to a resource of rdf:type lanl:Article . Then take a lanl:wrote in-edge to a resource of rdf:type lanl:Human . Increment only lanl:Human s. Make sure that the lanl:Human seen before is not the same lanl:Human currently. Repeat infinitely.” 1 0 0
  • 37. Grammar-based PageRank example. lanl:marko lanl:p1 lanl:wrote lanl:johan lanl:wrote lanl:chuck lanl:hasFriend lanl:Article rdf:type rdf:type lanl:Human rdf:type rdf:type 1 0 0 “ Take only lanl:wrote out-edge to a resource of rdf:type lanl:Article . Then take a lanl:wrote in-edge to a resource of rdf:type lanl:Human . Increment only lanl:Human s. Make sure that the lanl:Human seen before is not the same lanl:Human currently. Repeat infinitely.”
  • 38. Grammar-based PageRank example. lanl:marko lanl:p1 lanl:wrote lanl:johan lanl:wrote lanl:chuck lanl:hasFriend lanl:Article rdf:type rdf:type lanl:Human rdf:type rdf:type 1 0 1 “ Take only lanl:wrote out-edge to a resource of rdf:type lanl:Article . Then take a lanl:wrote in-edge to a resource of rdf:type lanl:Human . Increment only lanl:Human s. Make sure that the lanl:Human seen before is not the same lanl:Human currently. Repeat infinitely.”
  • 39. Grammar-based PageRank example. lanl:marko lanl:p1 lanl:wrote lanl:johan lanl:wrote lanl:chuck lanl:hasFriend lanl:Article rdf:type rdf:type lanl:Human rdf:type rdf:type 1 0 1 “ Take only lanl:wrote out-edge to a resource of rdf:type lanl:Article . Then take a lanl:wrote in-edge to a resource of rdf:type lanl:Human . Increment only lanl:Human s. Make sure that the lanl:Human seen before is not the same lanl:Human currently. Repeat infinitely.”
  • 40. Grammar-based PageRank example. lanl:marko lanl:p1 lanl:wrote lanl:johan lanl:wrote lanl:chuck lanl:hasFriend lanl:Article rdf:type rdf:type lanl:Human rdf:type rdf:type 2 0 1 “ Take only lanl:wrote out-edge to a resource of rdf:type lanl:Article . Then take a lanl:wrote in-edge to a resource of rdf:type lanl:Human . Increment only lanl:Human s. Make sure that the lanl:Human seen before is not the same lanl:Human currently. Repeat infinitely.”
  • 41. Grammar-based PageRank example. lanl:marko lanl:p1 lanl:wrote lanl:johan lanl:wrote lanl:chuck lanl:hasFriend lanl:Article rdf:type rdf:type lanl:Human rdf:type rdf:type 2 0 1 “ Take only lanl:wrote out-edge to a resource of rdf:type lanl:Article . Then take a lanl:wrote in-edge to a resource of rdf:type lanl:Human . Increment only lanl:Human s. Make sure that the lanl:Human seen before is not the same lanl:Human currently. Repeat infinitely.”
  • 42. Grammars create implicit relationships. lanl:marko lanl:p1 lanl:wrote lanl:johan lanl:wrote lanl:chuck lanl:hasFriend lanl:Article rdf:type rdf:type lanl:Human rdf:type rdf:type lanl:hasCoauthor
  • 43.
  • 44.