Cargando…

Has Large-Scale Named-Entity Network Analysis Been Resting on a Flawed Assumption?

The assumption that a name uniquely identifies an entity introduces two types of errors: splitting treats one entity as two or more (because of name variants); lumping treats multiple entities as if they were one (because of shared names). Here we investigate the extent to which splitting and lumpin...

Descripción completa

Detalles Bibliográficos
Autores principales: Fegley, Brent D., Torvik, Vetle I.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Public Library of Science 2013
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3722140/
https://www.ncbi.nlm.nih.gov/pubmed/23894639
http://dx.doi.org/10.1371/journal.pone.0070299
_version_ 1782278149216665600
author Fegley, Brent D.
Torvik, Vetle I.
author_facet Fegley, Brent D.
Torvik, Vetle I.
author_sort Fegley, Brent D.
collection PubMed
description The assumption that a name uniquely identifies an entity introduces two types of errors: splitting treats one entity as two or more (because of name variants); lumping treats multiple entities as if they were one (because of shared names). Here we investigate the extent to which splitting and lumping affect commonly-used measures of large-scale named-entity networks within two disambiguated bibliographic datasets: one for co-author names in biomedicine (PubMed, 2003–2007); the other for co-inventor names in U.S. patents (USPTO, 2003–2007). In both cases, we find that splitting has relatively little effect, whereas lumping has a dramatic effect on network measures. For example, in the biomedical co-authorship network, lumping (based on last name and both initials) drives several measures down: the global clustering coefficient by a factor of 4 (from 0.265 to 0.066); degree assortativity by a factor of ∼13 (from 0.763 to 0.06); and average shortest path by a factor of 1.3 (from 5.9 to 4.5). These results can be explained in part by the fact that lumping artificially creates many intransitive relationships and high-degree vertices. This effect of lumping is much less dramatic but persists with measures that give less weight to high-degree vertices, such as the mean local clustering coefficient and log-based degree assortativity. Furthermore, the log-log distribution of collaborator counts follows a much straighter line (power law) with splitting and lumping errors than without, particularly at the low and the high counts. This suggests that part of the power law often observed for collaborator counts in science and technology reflects an artifact: name ambiguity.
format Online
Article
Text
id pubmed-3722140
institution National Center for Biotechnology Information
language English
publishDate 2013
publisher Public Library of Science
record_format MEDLINE/PubMed
spelling pubmed-37221402013-07-26 Has Large-Scale Named-Entity Network Analysis Been Resting on a Flawed Assumption? Fegley, Brent D. Torvik, Vetle I. PLoS One Research Article The assumption that a name uniquely identifies an entity introduces two types of errors: splitting treats one entity as two or more (because of name variants); lumping treats multiple entities as if they were one (because of shared names). Here we investigate the extent to which splitting and lumping affect commonly-used measures of large-scale named-entity networks within two disambiguated bibliographic datasets: one for co-author names in biomedicine (PubMed, 2003–2007); the other for co-inventor names in U.S. patents (USPTO, 2003–2007). In both cases, we find that splitting has relatively little effect, whereas lumping has a dramatic effect on network measures. For example, in the biomedical co-authorship network, lumping (based on last name and both initials) drives several measures down: the global clustering coefficient by a factor of 4 (from 0.265 to 0.066); degree assortativity by a factor of ∼13 (from 0.763 to 0.06); and average shortest path by a factor of 1.3 (from 5.9 to 4.5). These results can be explained in part by the fact that lumping artificially creates many intransitive relationships and high-degree vertices. This effect of lumping is much less dramatic but persists with measures that give less weight to high-degree vertices, such as the mean local clustering coefficient and log-based degree assortativity. Furthermore, the log-log distribution of collaborator counts follows a much straighter line (power law) with splitting and lumping errors than without, particularly at the low and the high counts. This suggests that part of the power law often observed for collaborator counts in science and technology reflects an artifact: name ambiguity. Public Library of Science 2013-07-24 /pmc/articles/PMC3722140/ /pubmed/23894639 http://dx.doi.org/10.1371/journal.pone.0070299 Text en © 2013 Fegley, Torvik http://creativecommons.org/licenses/by/4.0/ This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are properly credited.
spellingShingle Research Article
Fegley, Brent D.
Torvik, Vetle I.
Has Large-Scale Named-Entity Network Analysis Been Resting on a Flawed Assumption?
title Has Large-Scale Named-Entity Network Analysis Been Resting on a Flawed Assumption?
title_full Has Large-Scale Named-Entity Network Analysis Been Resting on a Flawed Assumption?
title_fullStr Has Large-Scale Named-Entity Network Analysis Been Resting on a Flawed Assumption?
title_full_unstemmed Has Large-Scale Named-Entity Network Analysis Been Resting on a Flawed Assumption?
title_short Has Large-Scale Named-Entity Network Analysis Been Resting on a Flawed Assumption?
title_sort has large-scale named-entity network analysis been resting on a flawed assumption?
topic Research Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3722140/
https://www.ncbi.nlm.nih.gov/pubmed/23894639
http://dx.doi.org/10.1371/journal.pone.0070299
work_keys_str_mv AT fegleybrentd haslargescalenamedentitynetworkanalysisbeenrestingonaflawedassumption
AT torvikvetlei haslargescalenamedentitynetworkanalysisbeenrestingonaflawedassumption