Author name disambiguation for collaboration network analysis and visualization

Abstract

Abstract In this paper we outline a heuristic algorithm for disambiguating author names of publications via deterministic clustering based on well‐defined similarity measures between publications in which their names appear as authors. The algorithm is designed to be used in the construction of a collaboration network, i.e., a graph of author nodes and co‐author links. In this context, the goal is to produce a co‐authorship graph with network characteristics that are close to those of the “true” collaboration network, so that meaningful network metrics can be determined. The algorithm we present here is fairly easily comprehended as it does not depend on any sophisticated AI techniques. This is important in the context of policy studies, in which we successfully applied it, as it enables policy makers to judge the soundness of the methodology with considerable confidence. It is also quite fast, making it possible to run large‐scale analyses (here, in the order of a hundred thousand publications and in the order of a million names to be disambiguated) on a moderately sized desktop computer within a few days. The algorithm is, finally, open to improvement via extensions that take into account additional kinds of fields in bibliographic records of publications to provide evidence that two occurrences of similar names belong to the same individual.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 40 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.