Disentangling categorical relationships through a graph of co-occurrences

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

Research output: Contribution to journalArticle

15 Citations (Scopus)

Abstract

The mesoscopic structure of complex networks has proven a powerful level of description to understand the linchpins of the system represented by the network. Nevertheless, the mapping of a series of relationships between elements, in terms of a graph, is sometimes not straightforward. Given that all the information we would extract using complex network tools depend on this initial graph, it is mandatory to preprocess the data to build it on in the most accurate manner. Here we propose a procedure to build a network, attending only to statistically significant relations between constituents. We use a paradigmatic example of word associations to show the development of our approach. Analyzing the modular structure of the obtained network we are able to disentangle categorical relations, disambiguating words with success that is comparable to the best algorithms designed to the same end.

Original languageEnglish
Article number046108
JournalPhysical Review E - Statistical, Nonlinear, and Soft Matter Physics
Volume84
Issue number4
DOIs
Publication statusPublished - 19 Oct 2011
Externally publishedYes

Fingerprint

Categorical
occurrences
Complex Networks
Graph in graph theory
Series
Relationships

ASJC Scopus subject areas

  • Condensed Matter Physics
  • Statistical and Nonlinear Physics
  • Statistics and Probability

Cite this

Martinez-Romo, J., Araujo, L., Borge-Holthoefer, J., Arenas, A., Capitán, J. A., & Cuesta, J. A. (2011). Disentangling categorical relationships through a graph of co-occurrences. Physical Review E - Statistical, Nonlinear, and Soft Matter Physics, 84(4), [046108]. https://doi.org/10.1103/PhysRevE.84.046108

Disentangling categorical relationships through a graph of co-occurrences. / Martinez-Romo, Juan; Araujo, Lourdes; Borge-Holthoefer, Javier; Arenas, Alex; Capitán, José A.; Cuesta, José A.

In: Physical Review E - Statistical, Nonlinear, and Soft Matter Physics, Vol. 84, No. 4, 046108, 19.10.2011.

Research output: Contribution to journalArticle

Martinez-Romo, J, Araujo, L, Borge-Holthoefer, J, Arenas, A, Capitán, JA & Cuesta, JA 2011, 'Disentangling categorical relationships through a graph of co-occurrences', Physical Review E - Statistical, Nonlinear, and Soft Matter Physics, vol. 84, no. 4, 046108. https://doi.org/10.1103/PhysRevE.84.046108
Martinez-Romo, Juan ; Araujo, Lourdes ; Borge-Holthoefer, Javier ; Arenas, Alex ; Capitán, José A. ; Cuesta, José A. / Disentangling categorical relationships through a graph of co-occurrences. In: Physical Review E - Statistical, Nonlinear, and Soft Matter Physics. 2011 ; Vol. 84, No. 4.
@article{cf453c5930b746de87ef9a0de3f92b36,
title = "Disentangling categorical relationships through a graph of co-occurrences",
abstract = "The mesoscopic structure of complex networks has proven a powerful level of description to understand the linchpins of the system represented by the network. Nevertheless, the mapping of a series of relationships between elements, in terms of a graph, is sometimes not straightforward. Given that all the information we would extract using complex network tools depend on this initial graph, it is mandatory to preprocess the data to build it on in the most accurate manner. Here we propose a procedure to build a network, attending only to statistically significant relations between constituents. We use a paradigmatic example of word associations to show the development of our approach. Analyzing the modular structure of the obtained network we are able to disentangle categorical relations, disambiguating words with success that is comparable to the best algorithms designed to the same end.",
author = "Juan Martinez-Romo and Lourdes Araujo and Javier Borge-Holthoefer and Alex Arenas and Capit{\'a}n, {Jos{\'e} A.} and Cuesta, {Jos{\'e} A.}",
year = "2011",
month = "10",
day = "19",
doi = "10.1103/PhysRevE.84.046108",
language = "English",
volume = "84",
journal = "Physical Review E",
issn = "2470-0045",
publisher = "American Physical Society",
number = "4",

}

TY - JOUR

T1 - Disentangling categorical relationships through a graph of co-occurrences

AU - Martinez-Romo, Juan

AU - Araujo, Lourdes

AU - Borge-Holthoefer, Javier

AU - Arenas, Alex

AU - Capitán, José A.

AU - Cuesta, José A.

PY - 2011/10/19

Y1 - 2011/10/19

N2 - The mesoscopic structure of complex networks has proven a powerful level of description to understand the linchpins of the system represented by the network. Nevertheless, the mapping of a series of relationships between elements, in terms of a graph, is sometimes not straightforward. Given that all the information we would extract using complex network tools depend on this initial graph, it is mandatory to preprocess the data to build it on in the most accurate manner. Here we propose a procedure to build a network, attending only to statistically significant relations between constituents. We use a paradigmatic example of word associations to show the development of our approach. Analyzing the modular structure of the obtained network we are able to disentangle categorical relations, disambiguating words with success that is comparable to the best algorithms designed to the same end.

AB - The mesoscopic structure of complex networks has proven a powerful level of description to understand the linchpins of the system represented by the network. Nevertheless, the mapping of a series of relationships between elements, in terms of a graph, is sometimes not straightforward. Given that all the information we would extract using complex network tools depend on this initial graph, it is mandatory to preprocess the data to build it on in the most accurate manner. Here we propose a procedure to build a network, attending only to statistically significant relations between constituents. We use a paradigmatic example of word associations to show the development of our approach. Analyzing the modular structure of the obtained network we are able to disentangle categorical relations, disambiguating words with success that is comparable to the best algorithms designed to the same end.

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

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

U2 - 10.1103/PhysRevE.84.046108

DO - 10.1103/PhysRevE.84.046108

M3 - Article

VL - 84

JO - Physical Review E

JF - Physical Review E

SN - 2470-0045

IS - 4

M1 - 046108

ER -