Michele Pasin / Quotes

Intermediate URIrefs for structured values

Structured information like this is represented in RDF by considering the aggregate thing to be described (like John Smith's address) as a resource, and then making statements about that new resource. So, in the RDF graph, in order to break up John Smith's address into its component parts, a new node is created to represent the concept of John Smith's address, with a new URIref to identify it [...] This way of representing structured information in RDF can involve generating numerous "intermediate" URIrefs such as exaddressid:85740 to represent aggregate concepts such as John's address. Such concepts may never need to be referred to directly from outside a particular graph, and hence may not require "universal" identifiers. In addition, in the drawing of the graph representing the group of statements shown in Figure 5, the URIref assigned to identify "John Smith's address" is not really needed, since the graph could just as easily have been drawn as in Figure 6:

Saved 26 February 2013 / www.w3.org ↗

#structured-information #graph #RDF #address #RDF-graphs #information

Knowledge graph (wikipedia)

The Knowledge Graph is a knowledge base used by Google to enhance its search engine's search results with semantic-search information gathered from a wide…

Knowledge Graph - Wikipedia, The Free Encyclopedia #knowledge-graph #search-engines #search-results #Google #information #graph

Subject identity in topic maps

The goal with topic maps is to achieve a one-to-one relationship between topics and the subjects that they represent, in order to ensure that all knowledge…

The Tao Of Topic Maps #identity #resources #topic #indicators #concept #address

Why would i need entity relationships?

Imagine you are building a snazzy new web application that includes an address book where users can store their contacts. For each contact the user stores…

Modeling Entity Relationships #users #address

Building a citation graph from full texts

..the problem of building a citation graph by reliably extracting references from full-­texts and detecting their true targets. This is a fairly complicated…

The Diggicore Project: Aggregating And Mining The World Of Open Access Articles #citation-graph #graph #API

Computational ontologies and knowledge bases

We take a computational ontology to be a directed acyclic graph where nodes represent concepts and the links between concepts represent the taxonomic “isa”…

From Encyclopedia To Ontology: Toward Dynamic Representation Of The Discipline Of Philosophy #computational-ontology #ontology #graph #nodes #concept