Not logged in : Login

About: Hierarchical closeness     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : owl:Thing, within Data Space : ods-qa.openlinksw.com:8896 associated with source document(s)

Hierarchical closeness (HC) is a structural centrality measure used in network theory or graph theory. It is extended from closeness centrality to rank how centrally located a node is in a directed network. While the original closeness centrality of a directed network considers the most important node to be that with the least total distance from all other nodes, hierarchical closeness evaluates the most important node as the one which reaches the most nodes by the shortest paths. The hierarchical closeness explicitly includes information about the range of other nodes that can be affected by the given node. In a directed network where is the set of nodes and is the set of interactions, hierarchical closeness of a node ∈ called was proposed by Tran and Kwon as follows:

AttributesValues
sameAs
wasDerivedFrom
dbpedia-owl:abstract
  • Hierarchical closeness (HC) is a structural centrality measure used in network theory or graph theory. It is extended from closeness centrality to rank how centrally located a node is in a directed network. While the original closeness centrality of a directed network considers the most important node to be that with the least total distance from all other nodes, hierarchical closeness evaluates the most important node as the one which reaches the most nodes by the shortest paths. The hierarchical closeness explicitly includes information about the range of other nodes that can be affected by the given node. In a directed network where is the set of nodes and is the set of interactions, hierarchical closeness of a node ∈ called was proposed by Tran and Kwon as follows: where: * is the reachability of a node defined by a path from to , and * is the normalized form of original closeness (Sabidussi, 1966). It can use a variant definition of closeness as follows: where is the distance of the shortest path, if any, from to ; otherwise, is specified as an infinite value. In the formula, represents the number of nodes in that can be reachable from . It can also represent the hierarchical position of a node in a directed network. It notes that if , then because is . In cases where , the reachability is a dominant factor because but . In other words, the first term indicates the level of the global hierarchy and the second term presents the level of the local centrality.
dbpedia-owl:wikiPageExternalLink
dbpedia-owl:wikiPageID
dbpedia-owl:wikiPageRevisionID
comment
  • Hierarchical closeness (HC) is a structural centrality measure used in network theory or graph theory. It is extended from closeness centrality to rank how centrally located a node is in a directed network. While the original closeness centrality of a directed network considers the most important node to be that with the least total distance from all other nodes, hierarchical closeness evaluates the most important node as the one which reaches the most nodes by the shortest paths. The hierarchical closeness explicitly includes information about the range of other nodes that can be affected by the given node. In a directed network where is the set of nodes and is the set of interactions, hierarchical closeness of a node ∈ called was proposed by Tran and Kwon as follows:
label
  • Hierarchical closeness
dbpprop:wikiPageUsesTemplate
described by
topic
Subject
is primary topic of
dbpedia-owl:wikiPageLength
dbpedia-owl:wikiPageWikiLink
is sameAs of
is topic of
is primary topic of
is dbpedia-owl:wikiPageWikiLink of
is inDataset of
Faceted Search & Find service v1.17_git55 as of Mar 01 2021


Alternative Linked Data Documents: ODE     Content Formats:       RDF       ODATA       Microdata      About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3322 as of Mar 14 2022, on Linux (x86_64-generic-linux-glibc25), Single-Server Edition (7 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software