This HTML5 document contains 14 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n16http://www.openlinksw.com/data/turtle/general/GlossaryOfTerms.ttl#
n12https://medium.com/virtuoso-blog/graph-analytics-using-virtuosos-sparql-bi-extensions-to-sparql-5e75b4be32b3#
n4http://www.openlinksw.com/data/turtle/general/
n10http://leonidzhukov.net/hse/2014/socialnetworks/papers/
wdrshttp://www.w3.org/2007/05/powder-s#
n11https://community.openlinksw.com/t/graph-analytics-using-virtuoso-s-sparql-bi-extensions-to-sparql/1443#
schemahttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n5https://www.openlinksw.com/about/id/entity/urn/data:openlink:
n7http://data.openlinksw.com/oplweb/glossary-term/NetworkCentrality#
n15https://miro.medium.com/max/432/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
n2http://data.openlinksw.com/oplweb/glossary-term/ClosenessCentrality#
xsdhhttp://www.w3.org/2001/XMLSchema#
dbpediahttp://dbpedia.org/resource/
n8https://towardsdatascience.com/graph-analytics-introduction-and-concepts-of-centrality-8f5543b55de3#

Statements

Subject Item
n2:this
schema:description
Closeness Centrality is based on the number of "hops" (sometimes counted as the number of intervening nodes plus one) between two nodes, based on the shortest path between each pair of nodes.
wdrs:describedby
n4:GlossaryOfTerms.ttl n5:glossary n5:websites
schema:name
Closeness Centrality
schema:image
n15:1*rkbccriB91tmNbIDqsUx9w.png
skos:inScheme
n16:this
skos:broader
n7:this
skos:related
n8: n10:freeman79-centrality.pdf n11: n12:
owl:sameAs
dbpedia:Closeness_centrality
rdf:type
skos:Concept