Valeria Fionda, profile picture
Uploaded byValeria Fionda
308 views

Formal Maps and their Algebra

The document discusses formal maps and their algebra, focusing on how cartographical principles can be adapted for web-based applications, particularly in the context of linked data. It outlines contributions made towards providing a general framework for maps as abstractions of graphs, developing algorithms for different map types, and establishing an algebra for maps. The document also addresses challenges and methods for applying these frameworks to web navigation and representation.

Internet◦
Related topics:
Semantic Web•

Embed presentation

Download to read offline
Formal Maps and their Algebra Valeria Fionda, Claudio Gutierrez Giuseppe Pirr´o V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 1 / 43
Outline 1 Introduction V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 2 / 43
Outline 1 Introduction 2 Contribution V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 2 / 43
Outline 1 Introduction 2 Contribution 3 The notion of map V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 2 / 43
Outline 1 Introduction 2 Contribution 3 The notion of map 4 Related research V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 2 / 43
Outline 1 Introduction 2 Contribution 3 The notion of map 4 Related research 5 Preliminaries V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 2 / 43
Outline 1 Introduction 2 Contribution 3 The notion of map 4 Related research 5 Preliminaries 6 Definition of Map V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 2 / 43
Outline 1 Introduction 2 Contribution 3 The notion of map 4 Related research 5 Preliminaries 6 Definition of Map 7 Maps as mathematical objects V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 2 / 43
Outline 1 Introduction 2 Contribution 3 The notion of map 4 Related research 5 Preliminaries 6 Definition of Map 7 Maps as mathematical objects 8 Regions and maps on the Web V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 2 / 43
Introduction Outline 1 Introduction 2 Contribution 3 The notion of map 4 Related research 5 Preliminaries 6 Definition of Map 7 Maps as mathematical objects 8 Regions and maps on the Web V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 3 / 43
Introduction What is a map? Maps are artifacts that orient users in information spaces V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 4 / 43
Introduction What is a map? Maps are artifacts that orient users in information spaces V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 4 / 43
Introduction What is a map? Maps are artifacts that orient users in information spaces V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 4 / 43
Introduction Goals Our broad goal is to investigate how cartographical principles can be applied over the Web space V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 5 / 43
Introduction Goals Our broad goal is to investigate how cartographical principles can be applied over the Web space The web is a graph In particular we are interested in the Web of linked data, that is a huge, distributed, directed, labeled multigraph V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 5 / 43
Introduction Goals Our broad goal is to investigate how cartographical principles can be applied over the Web space The web is a graph In particular we are interested in the Web of linked data, that is a huge, distributed, directed, labeled multigraph Specific goals: 1) We want to build maps of a graph 2) Algebra of maps V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 5 / 43
Contribution Outline 1 Introduction 2 Contribution 3 The notion of map 4 Related research 5 Preliminaries 6 Definition of Map 7 Maps as mathematical objects 8 Regions and maps on the Web V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 6 / 43
Contribution Contribution Our contributions are: 1 We provide a formal general framework to cope with the notion of map as a means to abstract graphs. V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 7 / 43
Contribution Contribution Our contributions are: 1 We provide a formal general framework to cope with the notion of map as a means to abstract graphs. 2 We studied the properties of different types of maps and developed efficient algorithms to compute them. V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 7 / 43
Contribution Contribution Our contributions are: 1 We provide a formal general framework to cope with the notion of map as a means to abstract graphs. 2 We studied the properties of different types of maps and developed efficient algorithms to compute them. 3 We introduced an algebra for maps. V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 7 / 43
Contribution Contribution Our contributions are: 1 We provide a formal general framework to cope with the notion of map as a means to abstract graphs. 2 We studied the properties of different types of maps and developed efficient algorithms to compute them. 3 We introduced an algebra for maps. 4 We tackle the problem of how to apply our framework to the Web: 1 By investigating how to specify regions of the Web - new semantics of Web navigational languages returning graphs 2 Obtaining maps from those regions V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 7 / 43
Contribution Contribution Our contributions are: 1 We provide a formal general framework to cope with the notion of map as a means to abstract graphs. 2 We studied the properties of different types of maps and developed efficient algorithms to compute them. 3 We introduced an algebra for maps. 4 We tackle the problem of how to apply our framework to the Web: 1 By investigating how to specify regions of the Web - new semantics of Web navigational languages returning graphs 2 Obtaining maps from those regions V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 7 / 43
Contribution Contribution Our contributions are: 1 We provide a formal general framework to cope with the notion of map as a means to abstract graphs. 2 We studied the properties of different types of maps and developed efficient algorithms to compute them. 3 We introduced an algebra for maps. 4 We tackle the problem of how to apply our framework to the Web: 1 By investigating how to specify regions of the Web - new semantics of Web navigational languages returning graphs 2 Obtaining maps from those regions V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 7 / 43
Contribution Contribution Our contributions are: 1 We provide a formal general framework to cope with the notion of map as a means to abstract graphs. 2 We studied the properties of different types of maps and developed efficient algorithms to compute them. 3 We introduced an algebra for maps. 4 We tackle the problem of how to apply our framework to the Web: 1 By investigating how to specify regions of the Web - new semantics of Web navigational languages returning graphs 2 Obtaining maps from those regions V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 7 / 43
The notion of map Outline 1 Introduction 2 Contribution 3 The notion of map 4 Related research 5 Preliminaries 6 Definition of Map 7 Maps as mathematical objects 8 Regions and maps on the Web V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 8 / 43
The notion of map A region Martin Scorsese John Ford Orson Welles Quentin Tarantino Stanley Kubrick Tim Burton Woody Allen Lars von Trier David Lynch Influeces between directors Peter Jackson Terry Gilliam David Fincher Greg Harrison Paul T. Anderson Nicolas Renf V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 9 / 43
The notion of map Distinguished nodes Martin Scorsese John Ford Orson Welles Quentin Tarantino Stanley Kubrick Tim Burton Woody Allen Lars von Trier David Lynch Influeces between directors Peter Jackson Terry Gilliam David Fincher Greg Harrison Paul T. Anderson Nicolas Renf V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 10 / 43
The notion of map Examples of maps Martin Scorsese John Ford Orson Welles Quentin Tarantino Stanley Kubrick Tim Burton Woody Allen Lars von Trier David Lynch Influeces between directors Peter Jackson Terry Gilliam David Fincher Greg Harrison Paul T. Anderson Nicolas Renf Martin Scorsese John Ford Quentin Tarantino Stanley Kubrick Woody Allen John Ford Quentin Tarantino Stanley Kubrick Woody Allen Map 2Map 1 e1 e2 V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 11 / 43
The notion of map Abstraction level A map should: Represent the region Be concise Keep the connectivity V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 12 / 43
The notion of map Abstraction level A map should: Represent the region Be concise Keep the connectivity How much of the original region has to be included in the map? V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 12 / 43
Related research Outline 1 Introduction 2 Contribution 3 The notion of map 4 Related research 5 Preliminaries 6 Definition of Map 7 Maps as mathematical objects 8 Regions and maps on the Web V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 13 / 43
Related research Graph summarization Graph summarization [1,2,3]: Goal: produce a compressed representation of an input graph G Determine a function F in order to find a simplified structure Gs satisfying some requirements Removes some of the details from the graphs in order to reduce space consumption by usually clustering nodes in partitions. [1] C. Faloutsos, K.S. McCurley, and A. Tomkins. Fast Discovery of Connection Subgraphs. In KDD, pages 118-127. ACM, 2004. [2] J. Adibi, H. Chalupsky, E. Melz, A. Valente, et al. The KOJAK Group Finder: Connecting the Dots via Integrated Knowledge-based and Statistical Reasoning. In AAAI, pages 800-807, 2004. [3] F. Zhou, S. Malher, and H. Toivonen. Network Simplification with Minimal Loss of Connectivity. In ICDM, pages 659-668. IEEE, 2010. V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 14 / 43
Related research Graph indexing Graph indexing [4]: Goal: produce a list of graph substructures with references to the place where they can be found Make querying the graph faster [4] X. Yan and J. Han. Graph Indexing. Managing and Mining Graph Data 2010, pages 161-180 V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 15 / 43
Related research Differences 1 These techniques work on the whole graphs, they do not provide means to specify regions. Benefit: the web cannot be mapped altogheter! Isolated portions should be considered (according to user interests) V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 16 / 43
Related research Differences 1 These techniques work on the whole graphs, they do not provide means to specify regions. Benefit: the web cannot be mapped altogheter! Isolated portions should be considered (according to user interests) 2 We focus also on giving machine readable representations structures and are represented in a standard format to be extended, reused and combined. V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 16 / 43
Related research Differences 1 These techniques work on the whole graphs, they do not provide means to specify regions. Benefit: the web cannot be mapped altogheter! Isolated portions should be considered (according to user interests) 2 We focus also on giving machine readable representations structures and are represented in a standard format to be extended, reused and combined. 3 Our map frameworks allow to obtain maps that can be treated as mathematical objects by defining an algebra over maps. V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 16 / 43
Preliminaries Outline 1 Introduction 2 Contribution 3 The notion of map 4 Related research 5 Preliminaries 6 Definition of Map 7 Maps as mathematical objects 8 Regions and maps on the Web V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 17 / 43
Preliminaries Notation Let G = (VG , EG ) be a directed graph, VG the set of nodes, EG the set of edges and u, v nodes in G and N ⊆ VG be a set of nodes: Martin Scorsese John Ford Orson Welles Quentin Tarantino Stanley Kubrick Tim Burton Woody Allen Lars von Trier David Lynch Influeces between directors Peter Jackson Terry Gilliam David Fincher Greg Harrison Paul T. Anderson Nicolas Renf N={Martin Scorsese, Woody Allen} V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 18 / 43
Preliminaries Notation Let G = (VG , EG ) be a directed graph, VG the set of nodes, EG the set of edges and u, v nodes in G and N ⊆ VG be a set of nodes: u → v denotes an edge (u, v) ∈ EG Martin Scorsese John Ford Orson Welles Quentin Tarantino Stanley Kubrick Tim Burton Woody Allen Lars von Trier David Lynch Influeces between directors Peter Jackson Terry Gilliam David Fincher Greg Harrison Paul T. Anderson Nicolas Renf John Ford → Martin Scorsese N={Martin Scorsese, Woody Allen} V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 18 / 43
Preliminaries Notation Let G = (VG , EG ) be a directed graph, VG the set of nodes, EG the set of edges and u, v nodes in G and N ⊆ VG be a set of nodes: u → v denotes an edge (u, v) ∈ EG u v denotes a path from u to v in G Martin Scorsese John Ford Orson Welles Quentin Tarantino Stanley Kubrick Tim Burton Woody Allen Lars von Trier David Lynch Influeces between directors Peter Jackson Terry Gilliam David Fincher Greg Harrison Paul T. Anderson Nicolas Renf John Ford → Martin Scorsese John Ford Stanley Kubrick N={Martin Scorsese, Woody Allen} V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 18 / 43
Preliminaries Notation Let G = (VG , EG ) be a directed graph, VG the set of nodes, EG the set of edges and u, v nodes in G and N ⊆ VG be a set of nodes: u → v denotes an edge (u, v) ∈ EG u v denotes a path from u to v in G u Nv denotes a path from u to v in G not passing through intermediate nodes in N Martin Scorsese John Ford Orson Welles Quentin Tarantino Stanley Kubrick Tim Burton Woody Allen Lars von Trier David Lynch Influeces between directors Peter Jackson Terry Gilliam David Fincher Greg Harrison Paul T. Anderson Nicolas Renf John Ford → Martin Scorsese John Ford Stanley Kubrick N={Martin Scorsese, Woody Allen} John Ford N Stanley Kubrick NOTJohn Ford N Paul T. Anderson V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 18 / 43
Definition of Map Outline 1 Introduction 2 Contribution 3 The notion of map 4 Related research 5 Preliminaries 6 Definition of Map 7 Maps as mathematical objects 8 Regions and maps on the Web V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 19 / 43
Definition of Map Map of a graph Definition A map M = (VM, EM) of G is a graph such that VM ⊆ VG and each edge (x, y) ∈ EM implies x y in G V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 20 / 43
Definition of Map Map of a graph Definition A map M = (VM, EM) of G is a graph such that VM ⊆ VG and each edge (x, y) ∈ EM implies x y in G Martin Scorsese John Ford Orson Welles Quentin Tarantino Stanley Kubrick Tim Burton Woody Allen Lars von Trier David Lynch Peter Jackson Terry Gilliam David Fincher Greg Harrison Paul T. Anderson Nicolas Renf Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 20 / 43
Definition of Map Complete map of a graph Definition A map M = (VM, EM) of G is complete iff x y in G implies x y in M. V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 21 / 43
Definition of Map Complete map of a graph Definition A map M = (VM, EM) of G is complete iff x y in G implies x y in M. Martin Scorsese John Ford Orson Welles Quentin Tarantino Stanley Kubrick Tim Burton Woody Allen Lars von Trier David Lynch Peter Jackson Terry Gilliam David Fincher Greg Harrison Paul T. Anderson Nicolas Renf Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 21 / 43
Definition of Map Complete map of a graph Definition A map M = (VM, EM) of G is complete iff x y in G implies x y in M. Martin Scorsese John Ford Orson Welles Quentin Tarantino Stanley Kubrick Tim Burton Woody Allen Lars von Trier David Lynch Peter Jackson Terry Gilliam David Fincher Greg Harrison Paul T. Anderson Nicolas Renf Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 22 / 43
Definition of Map Complete map of a graph Completeness is not always enough to summarize information via maps Martin Scorsese John Ford Orson Welles Quentin Tarantino Stanley Kubrick Tim Burton Woody Allen Lars von Trier David Lynch Peter Jackson Terry Gilliam David Fincher Greg Harrison Paul T. Anderson Nicolas Renf Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 23 / 43
Definition of Map Complete map of a graph Completeness is not always enough to summarize information via maps Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 24 / 43
Definition of Map Complete map of a graph Completeness is not always enough to summarize information via maps Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 25 / 43
Definition of Map Complete map of a graph Completeness is not always enough to summarize information via maps Martin Scorsese John Ford Orson Welles Quentin Tarantino Stanley Kubrick Tim Burton Woody Allen Lars von Trier David Lynch Peter Jackson Terry Gilliam David Fincher Greg Harrison Paul T. Anderson Nicolas Renf Redundant: paths from John Ford to Quentin Tarantino in G only pass for some distinguished nodes Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 26 / 43
Definition of Map Route-Complete map of a graph Definition A map M = (VM, EM) of G is route-complete iff x VM y in G implies x → y in M V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 27 / 43
Definition of Map Route-Complete map of a graph Definition A map M = (VM, EM) of G is route-complete iff x VM y in G implies x → y in M Martin Scorsese John Ford Orson Welles Quentin Tarantino Stanley Kubrick Tim Burton Woody Allen Lars von Trier David Lynch Peter Jackson Terry Gilliam David Fincher Greg Harrison Paul T. Anderson Nicolas Renf Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 27 / 43
Definition of Map Non-Redundant map of a graph Definition A map M = (VM, EM) of G is non-redundant iff x → y in M implies x VM y in G. V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 28 / 43
Definition of Map Non-Redundant map of a graph Definition A map M = (VM, EM) of G is non-redundant iff x → y in M implies x VM y in G. Martin Scorsese John Ford Orson Welles Quentin Tarantino Stanley Kubrick Tim Burton Woody Allen Lars von Trier David Lynch Peter Jackson Terry Gilliam David Fincher Greg Harrison Paul T. Anderson Nicolas Renf Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 28 / 43
Definition of Map Good map of a graph Definition A map M = (VM, EM) of G is good iff it is: complete (x y in G implies x y in M) route-complete (x VM y in G implies x → y in M) non-redundant (x → y in M implies x VM y in G) V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 29 / 43
Definition of Map Good map of a graph Lemma A map M = (VM, EM) of G is good iff x → y in M ⇔ x VM y in G, ∀x, y ∈ VM V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 30 / 43
Definition of Map Good map of a graph Lemma A map M = (VM, EM) of G is good iff x → y in M ⇔ x VM y in G, ∀x, y ∈ VM Martin Scorsese John Ford Orson Welles Quentin Tarantino Stanley Kubrick Tim Burton Woody Allen Lars von Trier David Lynch Peter Jackson Terry Gilliam David Fincher Greg Harrison Paul T. Anderson Nicolas Renf V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 30 / 43
Definition of Map Good map of a graph Lemma A map M = (VM, EM) of G is good iff x → y in M ⇔ x VM y in G, ∀x, y ∈ VM V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 31 / 43
Definition of Map Good map of a graph Lemma A map M = (VM, EM) of G is good iff x → y in M ⇔ x VM y in G, ∀x, y ∈ VM V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 32 / 43
Definition of Map Good map of a graph Theorem Let G = (VG , EG ) be a graph. Given N ⊆ V , there is a unique good map M over G. V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 33 / 43
Definition of Map Good map of a graph Theorem Let G = (VG , EG ) be a graph. Given N ⊆ V , there is a unique good map M over G. (Sketch). Existence and uniqueness follow from the previous lemma. The edge x → y in M is defined by the existence of a particular path in G. V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 33 / 43
Definition of Map Computing good maps of a graph Martin Scorsese John Ford Orson Welles Quentin Tarantino Stanley Kubrick Tim Burton Woody Allen Lars von Trier David Lynch Peter Jackson Terry Gilliam David Fincher Greg Harrison Paul T. Anderson Nicolas Renf V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 34 / 43
Definition of Map Computing good maps of a graph V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 35 / 43
Definition of Map Computing good maps of a graph V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 36 / 43
Maps as mathematical objects Outline 1 Introduction 2 Contribution 3 The notion of map 4 Related research 5 Preliminaries 6 Definition of Map 7 Maps as mathematical objects 8 Regions and maps on the Web V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 37 / 43
Maps as mathematical objects Algebra of maps Theorem Let G = (VG , EG ) be a graph and M(G) the set of all good maps over G. Mi = (VMi , EMi ) ∈ M(G) is a map. Then: 1 The binary relation over M(G), defined by M1 M2 iff VM1 ⊆ VM2 , is a partial order on M(G). 2 The order induces a Boolean algebra (M(G), , , G, ∅), where: M1 M2 is the unique good map of G over VM1 ∪ VM2 ; M1 M2 is the unique good map of G over VM1 ∩ VM2 . 3 There is an isomorphism of Boolean algebras from the algebra of sets (P(V ), ∪, ∩, V , ∅) to (M(G), , , G, ∅), given by N MN (the unique good map of N over G). V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 38 / 43
Regions and maps on the Web Outline 1 Introduction 2 Contribution 3 The notion of map 4 Related research 5 Preliminaries 6 Definition of Map 7 Maps as mathematical objects 8 Regions and maps on the Web V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 39 / 43
Regions and maps on the Web Navigational language to specify regions Navigational languages [5,6,7] declaratively specify nodes in a graph or sub-graph (possibly the Web). No information about node connection is provided and then they are not suitable for building maps. We defined a general navigational language to deal with subgraphs besides sets of nodes. [5] W. W. W. Consortium. XML Path Language (Xpath) Recommendation., Nov. 1999. [6] V. Fionda, C. Gutierrez, and G. Pirr´o. Semantic Navigation on the Web of Data: Specification of Routes, Web Fragments and Actions. In WWW, pages 281290. ACM, 2012. [7] F. Alkhateeb, J.-F. Baget, and J. Euzenat. Extending SPARQL with Regular Expression Patterns (for querying RDF). JWS, 7(2):5773, 2009. V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 40 / 43
Regions and maps on the Web Our framework The high level specification for building maps of the Web is: 1 Specify the resources of interest (distinguished nodes): We leverage a navigational language. V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 41 / 43
Regions and maps on the Web Our framework The high level specification for building maps of the Web is: 1 Specify the resources of interest (distinguished nodes): We leverage a navigational language. 2 Build the region R corresponding to this specification: We enhanced the semantics of our navigational language to return subgraphs besides sets of pairs of nodes. V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 41 / 43
Regions and maps on the Web Our framework The high level specification for building maps of the Web is: 1 Specify the resources of interest (distinguished nodes): We leverage a navigational language. 2 Build the region R corresponding to this specification: We enhanced the semantics of our navigational language to return subgraphs besides sets of pairs of nodes. 3 Build a formal map corresponding to the region R: We build maps from regions by using the map framework discussed in the talk. V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 41 / 43
Regions and maps on the Web The implemented system The map framework has been implemented in a tool, which can be downloaded at the address http://mapsforweb.wordpress.com. V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 42 / 43
THANK YOU V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 43 / 43

More Related Content

PDF
NIPS2010: optimization algorithms in machine learning
byzukun
 
PPTX
Alexis Ohanian talks about the early days of reddit at Mass Challenge
byAlexis Ohanian
 
PDF
Ancestral Causal Inference - NIPS 2016 poster
bySara Magliacane
 
PPT
Research project ppt
byJohn McKeown
 
PDF
Trust Models for RDF Data: Semantics and Complexity - AAAI2015
byValeria Fionda
 
PDF
Talk: Joint causal inference on observational and experimental data - NIPS 20...
bySara Magliacane
 
PDF
ISWC 2012 "Efficient execution of top-k SPARQL queries"
bySara Magliacane
 
PDF
Ancestral Causal Inference - WIML 2016 @ NIPS
bySara Magliacane
 
NIPS2010: optimization algorithms in machine learning
byzukun
 
Alexis Ohanian talks about the early days of reddit at Mass Challenge
byAlexis Ohanian
 
Ancestral Causal Inference - NIPS 2016 poster
bySara Magliacane
 
Research project ppt
byJohn McKeown
 
Trust Models for RDF Data: Semantics and Complexity - AAAI2015
byValeria Fionda
 
Talk: Joint causal inference on observational and experimental data - NIPS 20...
bySara Magliacane
 
ISWC 2012 "Efficient execution of top-k SPARQL queries"
bySara Magliacane
 
Ancestral Causal Inference - WIML 2016 @ NIPS
bySara Magliacane
 

Similar to Formal Maps and their Algebra

PDF
Lecture 07 leonidas guibas - networks of shapes and images
bymustafa sarac
 
PDF
SP1: Exploratory Network Analysis with Gephi
byJohn Breslin
 
PDF
Tda presentation
byHJ van Veen
 
PDF
Curse of Dimensionality and Big Data
byStephane Marchand-Maillet
 
KEY
Introducing Riak
byKevin Smith
 
PPTX
Knowledge Graphs and Milestone
byBarry Norton
 
PDF
Place graphs are the new social graphs
byMatt Biddulph
 
PDF
Network Mapping & Data Storytelling for Beginners
byRenaud Clément
 
PPT
Participatory Web
byUniversity of Edinburgh
 
PDF
Link Analysis in Networks - or - Finding the Terrorists
byJames McGivern
 
PDF
Gephi icwsm-tutorial
bycsedays
 
PDF
Big datacourse
byMassimiliano Ruocco
 
PDF
MPhil Lecture on Data Vis for Analysis
byShawn Day
 
PDF
Interaction - Lecture 10 - Information Visualisation (4019538FNR)
byBeat Signer
 
ODP
finding nobel prize window by PageRank
byYuji Fujita
 
PDF
ESWC SS 2012 - Tuesday Tutorial Dan Brickley and Denny Vrandecic: Linked Open...
byeswcsummerschool
 
PDF
LinkedUp Veni Shortlist Presentations
byMarieke Guy
 
PDF
ch 11-part 1.pdf
byMisterAK
 
PDF
Creating visualizations using Linked Data
byAlvaro Graves
 
KEY
Introducing Riak
byKevin Smith
 
Lecture 07 leonidas guibas - networks of shapes and images
bymustafa sarac
 
SP1: Exploratory Network Analysis with Gephi
byJohn Breslin
 
Tda presentation
byHJ van Veen
 
Curse of Dimensionality and Big Data
byStephane Marchand-Maillet
 
Introducing Riak
byKevin Smith
 
Knowledge Graphs and Milestone
byBarry Norton
 
Place graphs are the new social graphs
byMatt Biddulph
 
Network Mapping & Data Storytelling for Beginners
byRenaud Clément
 
Participatory Web
byUniversity of Edinburgh
 
Link Analysis in Networks - or - Finding the Terrorists
byJames McGivern
 
Gephi icwsm-tutorial
bycsedays
 
Big datacourse
byMassimiliano Ruocco
 
MPhil Lecture on Data Vis for Analysis
byShawn Day
 
Interaction - Lecture 10 - Information Visualisation (4019538FNR)
byBeat Signer
 
finding nobel prize window by PageRank
byYuji Fujita
 
ESWC SS 2012 - Tuesday Tutorial Dan Brickley and Denny Vrandecic: Linked Open...
byeswcsummerschool
 
LinkedUp Veni Shortlist Presentations
byMarieke Guy
 
ch 11-part 1.pdf
byMisterAK
 
Creating visualizations using Linked Data
byAlvaro Graves
 
Introducing Riak
byKevin Smith
 

Recently uploaded

PDF
WShell Gameplay and Games of Games of Games
byzramirezmtz9
 
PDF
ARTIFICIAL INTELLIGENCE DEVELOPMENT SERVICE
bydavidjohansen1597
 
PDF
ARTIFICIAL INTELLIGENCE DEVELOPMENT SERVICE
bydavidjohansen1597
 
PPTX
Bibhav Singh.pptx it's very useful for us it's in very good and very nice
byabhishekjaiswal5th33
 
PPT
html-forms in web development-courseICT.
bymadz33
 
PPTX
Computer Networks 01[1 using all terms].pptx
bywaqasahmedbhatti633
 
PPTX
Types of Cryptograph Symmetric Ceaser cipher and also about Assymetric
byhamzaabdulqadeer11
 
PPTX
Introduction Digital Signal Processing.pptx
byumairmuhammad0409
 
PPT
Memory Organization In Assembly Language
byumairmuhammad0409
 
PPTX
mc l2 Overview of Computer and Web-Technology.pptx
byavanikharde
 
PPTX
COĞRAFYA ödevi 70 sayfa güzeldir hayırlı olsun
bydtilter
 
PDF
tokiohotellistening.pdf for tokiohotelfans
byrafaelgombos1234
 
PPTX
Ideathon template.pptx it is a ideathon template
bykonav71133
 
PPTX
CaseStudy-CloudMigration -For USE CASE -Customer Success Info -6-Aug-25.pptx
bywinlentech
 
PDF
classification of elements and periodicity.pdf
byaryanshreya2010
 
PPT
Lecture_3 Network Securityeyeyggegeg.ppt
bysawsan202
 
PDF
Here are the winners of KALIDASA SAMMAN.
byglcppro
 
PPTX
SriLank SLT LTE Network Sharing V2.pptx
bynthuang
 
PPTX
PRITHVI theater, A true artist. Newzfeaturez.pptx
bysc05digital
 
PDF
Design For Test - Getting Test Automation value from Design Expressions.
byDavid Harrison
 
WShell Gameplay and Games of Games of Games
byzramirezmtz9
 
ARTIFICIAL INTELLIGENCE DEVELOPMENT SERVICE
bydavidjohansen1597
 
ARTIFICIAL INTELLIGENCE DEVELOPMENT SERVICE
bydavidjohansen1597
 
Bibhav Singh.pptx it's very useful for us it's in very good and very nice
byabhishekjaiswal5th33
 
html-forms in web development-courseICT.
bymadz33
 
Computer Networks 01[1 using all terms].pptx
bywaqasahmedbhatti633
 
Types of Cryptograph Symmetric Ceaser cipher and also about Assymetric
byhamzaabdulqadeer11
 
Introduction Digital Signal Processing.pptx
byumairmuhammad0409
 
Memory Organization In Assembly Language
byumairmuhammad0409
 
mc l2 Overview of Computer and Web-Technology.pptx
byavanikharde
 
COĞRAFYA ödevi 70 sayfa güzeldir hayırlı olsun
bydtilter
 
tokiohotellistening.pdf for tokiohotelfans
byrafaelgombos1234
 
Ideathon template.pptx it is a ideathon template
bykonav71133
 
CaseStudy-CloudMigration -For USE CASE -Customer Success Info -6-Aug-25.pptx
bywinlentech
 
classification of elements and periodicity.pdf
byaryanshreya2010
 
Lecture_3 Network Securityeyeyggegeg.ppt
bysawsan202
 
Here are the winners of KALIDASA SAMMAN.
byglcppro
 
SriLank SLT LTE Network Sharing V2.pptx
bynthuang
 
PRITHVI theater, A true artist. Newzfeaturez.pptx
bysc05digital
 
Design For Test - Getting Test Automation value from Design Expressions.
byDavid Harrison
 

Formal Maps and their Algebra

  • 1.
    Formal Maps andtheir Algebra Valeria Fionda, Claudio Gutierrez Giuseppe Pirr´o V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 1 / 43
  • 2.
    Outline 1 Introduction V. Fionda,C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 2 / 43
  • 3.
    Outline 1 Introduction 2 Contribution V.Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 2 / 43
  • 4.
    Outline 1 Introduction 2 Contribution 3The notion of map V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 2 / 43
  • 5.
    Outline 1 Introduction 2 Contribution 3The notion of map 4 Related research V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 2 / 43
  • 6.
    Outline 1 Introduction 2 Contribution 3The notion of map 4 Related research 5 Preliminaries V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 2 / 43
  • 7.
    Outline 1 Introduction 2 Contribution 3The notion of map 4 Related research 5 Preliminaries 6 Definition of Map V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 2 / 43
  • 8.
    Outline 1 Introduction 2 Contribution 3The notion of map 4 Related research 5 Preliminaries 6 Definition of Map 7 Maps as mathematical objects V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 2 / 43
  • 9.
    Outline 1 Introduction 2 Contribution 3The notion of map 4 Related research 5 Preliminaries 6 Definition of Map 7 Maps as mathematical objects 8 Regions and maps on the Web V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 2 / 43
  • 10.
    Introduction Outline 1 Introduction 2 Contribution 3The notion of map 4 Related research 5 Preliminaries 6 Definition of Map 7 Maps as mathematical objects 8 Regions and maps on the Web V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 3 / 43
  • 11.
    Introduction What is amap? Maps are artifacts that orient users in information spaces V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 4 / 43
  • 12.
    Introduction What is amap? Maps are artifacts that orient users in information spaces V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 4 / 43
  • 13.
    Introduction What is amap? Maps are artifacts that orient users in information spaces V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 4 / 43
  • 14.
    Introduction Goals Our broad goalis to investigate how cartographical principles can be applied over the Web space V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 5 / 43
  • 15.
    Introduction Goals Our broad goalis to investigate how cartographical principles can be applied over the Web space The web is a graph In particular we are interested in the Web of linked data, that is a huge, distributed, directed, labeled multigraph V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 5 / 43
  • 16.
    Introduction Goals Our broad goalis to investigate how cartographical principles can be applied over the Web space The web is a graph In particular we are interested in the Web of linked data, that is a huge, distributed, directed, labeled multigraph Specific goals: 1) We want to build maps of a graph 2) Algebra of maps V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 5 / 43
  • 17.
    Contribution Outline 1 Introduction 2 Contribution 3The notion of map 4 Related research 5 Preliminaries 6 Definition of Map 7 Maps as mathematical objects 8 Regions and maps on the Web V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 6 / 43
  • 18.
    Contribution Contribution Our contributions are: 1We provide a formal general framework to cope with the notion of map as a means to abstract graphs. V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 7 / 43
  • 19.
    Contribution Contribution Our contributions are: 1We provide a formal general framework to cope with the notion of map as a means to abstract graphs. 2 We studied the properties of different types of maps and developed efficient algorithms to compute them. V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 7 / 43
  • 20.
    Contribution Contribution Our contributions are: 1We provide a formal general framework to cope with the notion of map as a means to abstract graphs. 2 We studied the properties of different types of maps and developed efficient algorithms to compute them. 3 We introduced an algebra for maps. V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 7 / 43
  • 21.
    Contribution Contribution Our contributions are: 1We provide a formal general framework to cope with the notion of map as a means to abstract graphs. 2 We studied the properties of different types of maps and developed efficient algorithms to compute them. 3 We introduced an algebra for maps. 4 We tackle the problem of how to apply our framework to the Web: 1 By investigating how to specify regions of the Web - new semantics of Web navigational languages returning graphs 2 Obtaining maps from those regions V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 7 / 43
  • 22.
    Contribution Contribution Our contributions are: 1We provide a formal general framework to cope with the notion of map as a means to abstract graphs. 2 We studied the properties of different types of maps and developed efficient algorithms to compute them. 3 We introduced an algebra for maps. 4 We tackle the problem of how to apply our framework to the Web: 1 By investigating how to specify regions of the Web - new semantics of Web navigational languages returning graphs 2 Obtaining maps from those regions V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 7 / 43
  • 23.
    Contribution Contribution Our contributions are: 1We provide a formal general framework to cope with the notion of map as a means to abstract graphs. 2 We studied the properties of different types of maps and developed efficient algorithms to compute them. 3 We introduced an algebra for maps. 4 We tackle the problem of how to apply our framework to the Web: 1 By investigating how to specify regions of the Web - new semantics of Web navigational languages returning graphs 2 Obtaining maps from those regions V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 7 / 43
  • 24.
    Contribution Contribution Our contributions are: 1We provide a formal general framework to cope with the notion of map as a means to abstract graphs. 2 We studied the properties of different types of maps and developed efficient algorithms to compute them. 3 We introduced an algebra for maps. 4 We tackle the problem of how to apply our framework to the Web: 1 By investigating how to specify regions of the Web - new semantics of Web navigational languages returning graphs 2 Obtaining maps from those regions V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 7 / 43
  • 25.
    The notion ofmap Outline 1 Introduction 2 Contribution 3 The notion of map 4 Related research 5 Preliminaries 6 Definition of Map 7 Maps as mathematical objects 8 Regions and maps on the Web V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 8 / 43
  • 26.
    The notion ofmap A region Martin Scorsese John Ford Orson Welles Quentin Tarantino Stanley Kubrick Tim Burton Woody Allen Lars von Trier David Lynch Influeces between directors Peter Jackson Terry Gilliam David Fincher Greg Harrison Paul T. Anderson Nicolas Renf V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 9 / 43
  • 27.
    The notion ofmap Distinguished nodes Martin Scorsese John Ford Orson Welles Quentin Tarantino Stanley Kubrick Tim Burton Woody Allen Lars von Trier David Lynch Influeces between directors Peter Jackson Terry Gilliam David Fincher Greg Harrison Paul T. Anderson Nicolas Renf V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 10 / 43
  • 28.
    The notion ofmap Examples of maps Martin Scorsese John Ford Orson Welles Quentin Tarantino Stanley Kubrick Tim Burton Woody Allen Lars von Trier David Lynch Influeces between directors Peter Jackson Terry Gilliam David Fincher Greg Harrison Paul T. Anderson Nicolas Renf Martin Scorsese John Ford Quentin Tarantino Stanley Kubrick Woody Allen John Ford Quentin Tarantino Stanley Kubrick Woody Allen Map 2Map 1 e1 e2 V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 11 / 43
  • 29.
    The notion ofmap Abstraction level A map should: Represent the region Be concise Keep the connectivity V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 12 / 43
  • 30.
    The notion ofmap Abstraction level A map should: Represent the region Be concise Keep the connectivity How much of the original region has to be included in the map? V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 12 / 43
  • 31.
    Related research Outline 1 Introduction 2Contribution 3 The notion of map 4 Related research 5 Preliminaries 6 Definition of Map 7 Maps as mathematical objects 8 Regions and maps on the Web V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 13 / 43
  • 32.
    Related research Graph summarization Graphsummarization [1,2,3]: Goal: produce a compressed representation of an input graph G Determine a function F in order to find a simplified structure Gs satisfying some requirements Removes some of the details from the graphs in order to reduce space consumption by usually clustering nodes in partitions. [1] C. Faloutsos, K.S. McCurley, and A. Tomkins. Fast Discovery of Connection Subgraphs. In KDD, pages 118-127. ACM, 2004. [2] J. Adibi, H. Chalupsky, E. Melz, A. Valente, et al. The KOJAK Group Finder: Connecting the Dots via Integrated Knowledge-based and Statistical Reasoning. In AAAI, pages 800-807, 2004. [3] F. Zhou, S. Malher, and H. Toivonen. Network Simplification with Minimal Loss of Connectivity. In ICDM, pages 659-668. IEEE, 2010. V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 14 / 43
  • 33.
    Related research Graph indexing Graphindexing [4]: Goal: produce a list of graph substructures with references to the place where they can be found Make querying the graph faster [4] X. Yan and J. Han. Graph Indexing. Managing and Mining Graph Data 2010, pages 161-180 V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 15 / 43
  • 34.
    Related research Differences 1 Thesetechniques work on the whole graphs, they do not provide means to specify regions. Benefit: the web cannot be mapped altogheter! Isolated portions should be considered (according to user interests) V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 16 / 43
  • 35.
    Related research Differences 1 Thesetechniques work on the whole graphs, they do not provide means to specify regions. Benefit: the web cannot be mapped altogheter! Isolated portions should be considered (according to user interests) 2 We focus also on giving machine readable representations structures and are represented in a standard format to be extended, reused and combined. V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 16 / 43
  • 36.
    Related research Differences 1 Thesetechniques work on the whole graphs, they do not provide means to specify regions. Benefit: the web cannot be mapped altogheter! Isolated portions should be considered (according to user interests) 2 We focus also on giving machine readable representations structures and are represented in a standard format to be extended, reused and combined. 3 Our map frameworks allow to obtain maps that can be treated as mathematical objects by defining an algebra over maps. V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 16 / 43
  • 37.
    Preliminaries Outline 1 Introduction 2 Contribution 3The notion of map 4 Related research 5 Preliminaries 6 Definition of Map 7 Maps as mathematical objects 8 Regions and maps on the Web V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 17 / 43
  • 38.
    Preliminaries Notation Let G =(VG , EG ) be a directed graph, VG the set of nodes, EG the set of edges and u, v nodes in G and N ⊆ VG be a set of nodes: Martin Scorsese John Ford Orson Welles Quentin Tarantino Stanley Kubrick Tim Burton Woody Allen Lars von Trier David Lynch Influeces between directors Peter Jackson Terry Gilliam David Fincher Greg Harrison Paul T. Anderson Nicolas Renf N={Martin Scorsese, Woody Allen} V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 18 / 43
  • 39.
    Preliminaries Notation Let G =(VG , EG ) be a directed graph, VG the set of nodes, EG the set of edges and u, v nodes in G and N ⊆ VG be a set of nodes: u → v denotes an edge (u, v) ∈ EG Martin Scorsese John Ford Orson Welles Quentin Tarantino Stanley Kubrick Tim Burton Woody Allen Lars von Trier David Lynch Influeces between directors Peter Jackson Terry Gilliam David Fincher Greg Harrison Paul T. Anderson Nicolas Renf John Ford → Martin Scorsese N={Martin Scorsese, Woody Allen} V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 18 / 43
  • 40.
    Preliminaries Notation Let G =(VG , EG ) be a directed graph, VG the set of nodes, EG the set of edges and u, v nodes in G and N ⊆ VG be a set of nodes: u → v denotes an edge (u, v) ∈ EG u v denotes a path from u to v in G Martin Scorsese John Ford Orson Welles Quentin Tarantino Stanley Kubrick Tim Burton Woody Allen Lars von Trier David Lynch Influeces between directors Peter Jackson Terry Gilliam David Fincher Greg Harrison Paul T. Anderson Nicolas Renf John Ford → Martin Scorsese John Ford Stanley Kubrick N={Martin Scorsese, Woody Allen} V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 18 / 43
  • 41.
    Preliminaries Notation Let G =(VG , EG ) be a directed graph, VG the set of nodes, EG the set of edges and u, v nodes in G and N ⊆ VG be a set of nodes: u → v denotes an edge (u, v) ∈ EG u v denotes a path from u to v in G u Nv denotes a path from u to v in G not passing through intermediate nodes in N Martin Scorsese John Ford Orson Welles Quentin Tarantino Stanley Kubrick Tim Burton Woody Allen Lars von Trier David Lynch Influeces between directors Peter Jackson Terry Gilliam David Fincher Greg Harrison Paul T. Anderson Nicolas Renf John Ford → Martin Scorsese John Ford Stanley Kubrick N={Martin Scorsese, Woody Allen} John Ford N Stanley Kubrick NOTJohn Ford N Paul T. Anderson V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 18 / 43
  • 42.
    Definition of Map Outline 1Introduction 2 Contribution 3 The notion of map 4 Related research 5 Preliminaries 6 Definition of Map 7 Maps as mathematical objects 8 Regions and maps on the Web V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 19 / 43
  • 43.
    Definition of Map Mapof a graph Definition A map M = (VM, EM) of G is a graph such that VM ⊆ VG and each edge (x, y) ∈ EM implies x y in G V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 20 / 43
  • 44.
    Definition of Map Mapof a graph Definition A map M = (VM, EM) of G is a graph such that VM ⊆ VG and each edge (x, y) ∈ EM implies x y in G Martin Scorsese John Ford Orson Welles Quentin Tarantino Stanley Kubrick Tim Burton Woody Allen Lars von Trier David Lynch Peter Jackson Terry Gilliam David Fincher Greg Harrison Paul T. Anderson Nicolas Renf Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 20 / 43
  • 45.
    Definition of Map Completemap of a graph Definition A map M = (VM, EM) of G is complete iff x y in G implies x y in M. V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 21 / 43
  • 46.
    Definition of Map Completemap of a graph Definition A map M = (VM, EM) of G is complete iff x y in G implies x y in M. Martin Scorsese John Ford Orson Welles Quentin Tarantino Stanley Kubrick Tim Burton Woody Allen Lars von Trier David Lynch Peter Jackson Terry Gilliam David Fincher Greg Harrison Paul T. Anderson Nicolas Renf Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 21 / 43
  • 47.
    Definition of Map Completemap of a graph Definition A map M = (VM, EM) of G is complete iff x y in G implies x y in M. Martin Scorsese John Ford Orson Welles Quentin Tarantino Stanley Kubrick Tim Burton Woody Allen Lars von Trier David Lynch Peter Jackson Terry Gilliam David Fincher Greg Harrison Paul T. Anderson Nicolas Renf Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 22 / 43
  • 48.
    Definition of Map Completemap of a graph Completeness is not always enough to summarize information via maps Martin Scorsese John Ford Orson Welles Quentin Tarantino Stanley Kubrick Tim Burton Woody Allen Lars von Trier David Lynch Peter Jackson Terry Gilliam David Fincher Greg Harrison Paul T. Anderson Nicolas Renf Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 23 / 43
  • 49.
    Definition of Map Completemap of a graph Completeness is not always enough to summarize information via maps Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 24 / 43
  • 50.
    Definition of Map Completemap of a graph Completeness is not always enough to summarize information via maps Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 25 / 43
  • 51.
    Definition of Map Completemap of a graph Completeness is not always enough to summarize information via maps Martin Scorsese John Ford Orson Welles Quentin Tarantino Stanley Kubrick Tim Burton Woody Allen Lars von Trier David Lynch Peter Jackson Terry Gilliam David Fincher Greg Harrison Paul T. Anderson Nicolas Renf Redundant: paths from John Ford to Quentin Tarantino in G only pass for some distinguished nodes Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 26 / 43
  • 52.
    Definition of Map Route-Completemap of a graph Definition A map M = (VM, EM) of G is route-complete iff x VM y in G implies x → y in M V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 27 / 43
  • 53.
    Definition of Map Route-Completemap of a graph Definition A map M = (VM, EM) of G is route-complete iff x VM y in G implies x → y in M Martin Scorsese John Ford Orson Welles Quentin Tarantino Stanley Kubrick Tim Burton Woody Allen Lars von Trier David Lynch Peter Jackson Terry Gilliam David Fincher Greg Harrison Paul T. Anderson Nicolas Renf Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 27 / 43
  • 54.
    Definition of Map Non-Redundantmap of a graph Definition A map M = (VM, EM) of G is non-redundant iff x → y in M implies x VM y in G. V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 28 / 43
  • 55.
    Definition of Map Non-Redundantmap of a graph Definition A map M = (VM, EM) of G is non-redundant iff x → y in M implies x VM y in G. Martin Scorsese John Ford Orson Welles Quentin Tarantino Stanley Kubrick Tim Burton Woody Allen Lars von Trier David Lynch Peter Jackson Terry Gilliam David Fincher Greg Harrison Paul T. Anderson Nicolas Renf Martin ScorseseJohn Ford Quentin Tarantino Stanley Kubrick Woody Allen David Lynch V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 28 / 43
  • 56.
    Definition of Map Goodmap of a graph Definition A map M = (VM, EM) of G is good iff it is: complete (x y in G implies x y in M) route-complete (x VM y in G implies x → y in M) non-redundant (x → y in M implies x VM y in G) V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 29 / 43
  • 57.
    Definition of Map Goodmap of a graph Lemma A map M = (VM, EM) of G is good iff x → y in M ⇔ x VM y in G, ∀x, y ∈ VM V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 30 / 43
  • 58.
    Definition of Map Goodmap of a graph Lemma A map M = (VM, EM) of G is good iff x → y in M ⇔ x VM y in G, ∀x, y ∈ VM Martin Scorsese John Ford Orson Welles Quentin Tarantino Stanley Kubrick Tim Burton Woody Allen Lars von Trier David Lynch Peter Jackson Terry Gilliam David Fincher Greg Harrison Paul T. Anderson Nicolas Renf V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 30 / 43
  • 59.
    Definition of Map Goodmap of a graph Lemma A map M = (VM, EM) of G is good iff x → y in M ⇔ x VM y in G, ∀x, y ∈ VM V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 31 / 43
  • 60.
    Definition of Map Goodmap of a graph Lemma A map M = (VM, EM) of G is good iff x → y in M ⇔ x VM y in G, ∀x, y ∈ VM V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 32 / 43
  • 61.
    Definition of Map Goodmap of a graph Theorem Let G = (VG , EG ) be a graph. Given N ⊆ V , there is a unique good map M over G. V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 33 / 43
  • 62.
    Definition of Map Goodmap of a graph Theorem Let G = (VG , EG ) be a graph. Given N ⊆ V , there is a unique good map M over G. (Sketch). Existence and uniqueness follow from the previous lemma. The edge x → y in M is defined by the existence of a particular path in G. V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 33 / 43
  • 63.
    Definition of Map Computinggood maps of a graph Martin Scorsese John Ford Orson Welles Quentin Tarantino Stanley Kubrick Tim Burton Woody Allen Lars von Trier David Lynch Peter Jackson Terry Gilliam David Fincher Greg Harrison Paul T. Anderson Nicolas Renf V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 34 / 43
  • 64.
    Definition of Map Computinggood maps of a graph V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 35 / 43
  • 65.
    Definition of Map Computinggood maps of a graph V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 36 / 43
  • 66.
    Maps as mathematicalobjects Outline 1 Introduction 2 Contribution 3 The notion of map 4 Related research 5 Preliminaries 6 Definition of Map 7 Maps as mathematical objects 8 Regions and maps on the Web V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 37 / 43
  • 67.
    Maps as mathematicalobjects Algebra of maps Theorem Let G = (VG , EG ) be a graph and M(G) the set of all good maps over G. Mi = (VMi , EMi ) ∈ M(G) is a map. Then: 1 The binary relation over M(G), defined by M1 M2 iff VM1 ⊆ VM2 , is a partial order on M(G). 2 The order induces a Boolean algebra (M(G), , , G, ∅), where: M1 M2 is the unique good map of G over VM1 ∪ VM2 ; M1 M2 is the unique good map of G over VM1 ∩ VM2 . 3 There is an isomorphism of Boolean algebras from the algebra of sets (P(V ), ∪, ∩, V , ∅) to (M(G), , , G, ∅), given by N MN (the unique good map of N over G). V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 38 / 43
  • 68.
    Regions and mapson the Web Outline 1 Introduction 2 Contribution 3 The notion of map 4 Related research 5 Preliminaries 6 Definition of Map 7 Maps as mathematical objects 8 Regions and maps on the Web V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 39 / 43
  • 69.
    Regions and mapson the Web Navigational language to specify regions Navigational languages [5,6,7] declaratively specify nodes in a graph or sub-graph (possibly the Web). No information about node connection is provided and then they are not suitable for building maps. We defined a general navigational language to deal with subgraphs besides sets of nodes. [5] W. W. W. Consortium. XML Path Language (Xpath) Recommendation., Nov. 1999. [6] V. Fionda, C. Gutierrez, and G. Pirr´o. Semantic Navigation on the Web of Data: Specification of Routes, Web Fragments and Actions. In WWW, pages 281290. ACM, 2012. [7] F. Alkhateeb, J.-F. Baget, and J. Euzenat. Extending SPARQL with Regular Expression Patterns (for querying RDF). JWS, 7(2):5773, 2009. V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 40 / 43
  • 70.
    Regions and mapson the Web Our framework The high level specification for building maps of the Web is: 1 Specify the resources of interest (distinguished nodes): We leverage a navigational language. V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 41 / 43
  • 71.
    Regions and mapson the Web Our framework The high level specification for building maps of the Web is: 1 Specify the resources of interest (distinguished nodes): We leverage a navigational language. 2 Build the region R corresponding to this specification: We enhanced the semantics of our navigational language to return subgraphs besides sets of pairs of nodes. V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 41 / 43
  • 72.
    Regions and mapson the Web Our framework The high level specification for building maps of the Web is: 1 Specify the resources of interest (distinguished nodes): We leverage a navigational language. 2 Build the region R corresponding to this specification: We enhanced the semantics of our navigational language to return subgraphs besides sets of pairs of nodes. 3 Build a formal map corresponding to the region R: We build maps from regions by using the map framework discussed in the talk. V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 41 / 43
  • 73.
    Regions and mapson the Web The implemented system The map framework has been implemented in a tool, which can be downloaded at the address http://mapsforweb.wordpress.com. V. Fionda, C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 42 / 43
  • 74.
    THANK YOU V. Fionda,C. Gutierrez, G. Pirr´o Formal Maps and their Algebra 43 / 43