Local-based semantic navigation on a networked representation of information

José A. Capitán, Javier Borge-Holthoefer, Sergio Gómez, Juan Martinez-Romo, Lourdes Araujo, José A. Cuesta, Alex Arenas

Research output: Contribution to journalArticle

16 Citations (Scopus)

Abstract

The size and complexity of actual networked systems hinders the access to a global knowledge of their structure. This fact pushes the problem of navigation to suboptimal solutions, one of them being the extraction of a coherent map of the topology on which navigation takes place. In this paper, we present a Markov chain based algorithm to tag networked terms according only to their topological features. The resulting tagging is used to compute similarity between terms, providing a map of the networked information. This map supports local-based navigation techniques driven by similarity. We compare the efficiency of the resulting paths according to their length compared to that of the shortest path. Additionally we claim that the path steps towards the destination are semantically coherent. To illustrate the algorithm performance we provide some results from the Simple English Wikipedia, which amounts to several thousand of pages. The simplest greedy strategy yields over an 80% of average success rate. Furthermore, the resulting content-coherent paths most often have a cost between one- and threefold compared to shortest-path lengths.

Original languageEnglish
Article numbere43694
JournalPLoS One
Volume7
Issue number8
DOIs
Publication statusPublished - 24 Aug 2012
Externally publishedYes

Fingerprint

Semantics
Navigation
Markov Chains
topology
Costs and Cost Analysis
Markov processes
Topology
Costs
methodology
Markov chain

ASJC Scopus subject areas

  • Agricultural and Biological Sciences(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Medicine(all)

Cite this

Capitán, J. A., Borge-Holthoefer, J., Gómez, S., Martinez-Romo, J., Araujo, L., Cuesta, J. A., & Arenas, A. (2012). Local-based semantic navigation on a networked representation of information. PLoS One, 7(8), [e43694]. https://doi.org/10.1371/journal.pone.0043694

Local-based semantic navigation on a networked representation of information. / Capitán, José A.; Borge-Holthoefer, Javier; Gómez, Sergio; Martinez-Romo, Juan; Araujo, Lourdes; Cuesta, José A.; Arenas, Alex.

In: PLoS One, Vol. 7, No. 8, e43694, 24.08.2012.

Research output: Contribution to journalArticle

Capitán, JA, Borge-Holthoefer, J, Gómez, S, Martinez-Romo, J, Araujo, L, Cuesta, JA & Arenas, A 2012, 'Local-based semantic navigation on a networked representation of information', PLoS One, vol. 7, no. 8, e43694. https://doi.org/10.1371/journal.pone.0043694
Capitán JA, Borge-Holthoefer J, Gómez S, Martinez-Romo J, Araujo L, Cuesta JA et al. Local-based semantic navigation on a networked representation of information. PLoS One. 2012 Aug 24;7(8). e43694. https://doi.org/10.1371/journal.pone.0043694
Capitán, José A. ; Borge-Holthoefer, Javier ; Gómez, Sergio ; Martinez-Romo, Juan ; Araujo, Lourdes ; Cuesta, José A. ; Arenas, Alex. / Local-based semantic navigation on a networked representation of information. In: PLoS One. 2012 ; Vol. 7, No. 8.
@article{a1917fb1718c496b98a2bfccd8f697b5,
title = "Local-based semantic navigation on a networked representation of information",
abstract = "The size and complexity of actual networked systems hinders the access to a global knowledge of their structure. This fact pushes the problem of navigation to suboptimal solutions, one of them being the extraction of a coherent map of the topology on which navigation takes place. In this paper, we present a Markov chain based algorithm to tag networked terms according only to their topological features. The resulting tagging is used to compute similarity between terms, providing a map of the networked information. This map supports local-based navigation techniques driven by similarity. We compare the efficiency of the resulting paths according to their length compared to that of the shortest path. Additionally we claim that the path steps towards the destination are semantically coherent. To illustrate the algorithm performance we provide some results from the Simple English Wikipedia, which amounts to several thousand of pages. The simplest greedy strategy yields over an 80{\%} of average success rate. Furthermore, the resulting content-coherent paths most often have a cost between one- and threefold compared to shortest-path lengths.",
author = "Capit{\'a}n, {Jos{\'e} A.} and Javier Borge-Holthoefer and Sergio G{\'o}mez and Juan Martinez-Romo and Lourdes Araujo and Cuesta, {Jos{\'e} A.} and Alex Arenas",
year = "2012",
month = "8",
day = "24",
doi = "10.1371/journal.pone.0043694",
language = "English",
volume = "7",
journal = "PLoS One",
issn = "1932-6203",
publisher = "Public Library of Science",
number = "8",

}

TY - JOUR

T1 - Local-based semantic navigation on a networked representation of information

AU - Capitán, José A.

AU - Borge-Holthoefer, Javier

AU - Gómez, Sergio

AU - Martinez-Romo, Juan

AU - Araujo, Lourdes

AU - Cuesta, José A.

AU - Arenas, Alex

PY - 2012/8/24

Y1 - 2012/8/24

N2 - The size and complexity of actual networked systems hinders the access to a global knowledge of their structure. This fact pushes the problem of navigation to suboptimal solutions, one of them being the extraction of a coherent map of the topology on which navigation takes place. In this paper, we present a Markov chain based algorithm to tag networked terms according only to their topological features. The resulting tagging is used to compute similarity between terms, providing a map of the networked information. This map supports local-based navigation techniques driven by similarity. We compare the efficiency of the resulting paths according to their length compared to that of the shortest path. Additionally we claim that the path steps towards the destination are semantically coherent. To illustrate the algorithm performance we provide some results from the Simple English Wikipedia, which amounts to several thousand of pages. The simplest greedy strategy yields over an 80% of average success rate. Furthermore, the resulting content-coherent paths most often have a cost between one- and threefold compared to shortest-path lengths.

AB - The size and complexity of actual networked systems hinders the access to a global knowledge of their structure. This fact pushes the problem of navigation to suboptimal solutions, one of them being the extraction of a coherent map of the topology on which navigation takes place. In this paper, we present a Markov chain based algorithm to tag networked terms according only to their topological features. The resulting tagging is used to compute similarity between terms, providing a map of the networked information. This map supports local-based navigation techniques driven by similarity. We compare the efficiency of the resulting paths according to their length compared to that of the shortest path. Additionally we claim that the path steps towards the destination are semantically coherent. To illustrate the algorithm performance we provide some results from the Simple English Wikipedia, which amounts to several thousand of pages. The simplest greedy strategy yields over an 80% of average success rate. Furthermore, the resulting content-coherent paths most often have a cost between one- and threefold compared to shortest-path lengths.

UR - http://www.scopus.com/inward/record.url?scp=84865289268&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84865289268&partnerID=8YFLogxK

U2 - 10.1371/journal.pone.0043694

DO - 10.1371/journal.pone.0043694

M3 - Article

VL - 7

JO - PLoS One

JF - PLoS One

SN - 1932-6203

IS - 8

M1 - e43694

ER -