Disentangling categorical relationships through a graph of co-occurrences

e-Archivo Repository

Show simple item record

dc.contributor.author Martínez-Romo, Juan
dc.contributor.author Araujo, Lourdes
dc.contributor.author Borge-Holthoefer, Javier
dc.contributor.author Arenas, Alex
dc.contributor.author Capitán, José A.
dc.contributor.author Cuesta, José A.
dc.date.accessioned 2014-06-06T11:19:09Z
dc.date.available 2014-06-06T11:19:09Z
dc.date.issued 2011-10-19
dc.identifier.bibliographicCitation Physical Review E. (Oct. 2011), vol.84, n.4 (046108)
dc.identifier.issn 1539-3755
dc.identifier.uri http://hdl.handle.net/10016/18961
dc.description.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, themapping 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.
dc.description.sponsorship We acknowledge financia support through Grant No. FIS2009-13364-C02-01, Holopedia (Grant No. TIN2010-21128-C02-01), MOSAICO (Grant No. FIS2006-01485), PRODIEVO (Grant No. FIS2011-22449), and Complexity-NET RESINEE, all of them from Ministerio de Educación y Ciencia in Spain, as well as support from Research Networks MODELICO-CM (Grant No. S2009/ESP-1691) and MA2VICMR (Grant No. S2009/TIC-1542) from Comunidad de Madrid, and Network 2009-SGR-838 from Generalitat de Catalunya.
dc.format.extent 8
dc.format.mimetype application/pdf
dc.language.iso eng
dc.publisher American Physical Society
dc.rights © 2011 American Physical Society
dc.subject.other Community structure
dc.subject.other Complex networks
dc.subject.other Random-wolks
dc.subject.other Algorithm
dc.title Disentangling categorical relationships through a graph of co-occurrences
dc.type article
dc.relation.publisherversion http://dx.doi.org/10.1103/PhysRevE.84.046108
dc.subject.eciencia Física
dc.subject.eciencia Matemáticas
dc.identifier.doi 10.1103/PhysRevE.84.046108
dc.rights.accessRights openAccess
dc.relation.projectID Comunidad de Madrid. S2009/ESP-1691/MODELICO
dc.relation.projectID Comunidad de Madrid. S2009/TIC-1542/MA2VICMR
dc.relation.projectID Gobierno de España. FIS2006-01485/MOSAICO
dc.relation.projectID Gobierno de España. FIS2011-22449/PRODIEVO
dc.relation.projectID Gobierno de España. TIN2010-21128-C02-01
dc.relation.projectID Gobierno de España. FIS2009-13364-C02-01
dc.type.version publishedVersion
dc.identifier.publicationfirstpage 1
dc.identifier.publicationissue 4 (046108)
dc.identifier.publicationlastpage 8
dc.identifier.publicationtitle Physical review. E, Statistical, nonlinear, and soft matter physics
dc.identifier.publicationvolume 84
dc.identifier.uxxi AR/0000009452
 Find Full text

Files in this item

*Click on file's image for preview. (Embargoed files's preview is not supported)

This item appears in the following Collection(s)

Show simple item record