Building networks of shared research themes in an academic unit by word co-occurrence fingerprinting

Departments within a university are not only administrative units, but also an effort to gather investigators around common fields of academic study. Identifying shared research interests among members is a pervasive challenge. Here I describe a workflow that uses natural language processing to generate a network connecting 𝑛 = 7 9 members of a university department, or multiple departments within a faculty ( 𝑛 = 2 7 8 ), based on common topics in their research publications. After extracting and processing terms from 𝑛 = 1 6 , 9 4 8 abstracts in the PubMed database, the co-occurrence of terms is encoded in a sparse document-term matrix. Based on the angular distances between the presence-absence vectors for every pair of terms, I use the uniform manifold approximation and projection (UMAP) method to embed the terms into a representation space such that terms that tend to appear in the same documents are closer together. Each author’s corpus defines a probability distribution over terms in this space. Using the Wasserstein distance to quantify the similarity between these distributions, I generate a distance matrix among authors that can be analyzed and visualized as a graph. I demonstrate that the distribution of edges in the graph relating members of a faculty are significantly associated with departmental and research centre affiliations, while identifying untapped connections among members.

Authors

Institutions

Publication Details

Journal
Journal of Informetrics
Published
2026-10-05
DOI
https://doi.org/10.1016/j.joi.2026.101882
Primary Topic
scientometrics and bibliometrics research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Building networks of shared research themes in an academic unit by word co-occurrence fingerprinting

Art F. Y. Poon
Journal of Informetrics
scientometrics and bibliometrics research
article

Building networks of shared research themes in an academic unit by word co-occurrence fingerprinting

Art F. Y. Poon
article en

Abstract

Departments within a university are not only administrative units, but also an effort to gather investigators around common fields of academic study. Identifying shared research interests among members is a pervasive challenge. Here I describe a workflow that uses natural language processing to generate a network connecting 𝑛 = 7 9 members of a university department, or multiple departments within a faculty ( 𝑛 = 2 7 8 ), based on common topics in their research publications. After extracting and processing terms from 𝑛 = 1 6 , 9 4 8 abstracts in the PubMed database, the co-occurrence of terms is encoded in a sparse document-term matrix. Based on the angular distances between the presence-absence vectors for every pair of terms, I use the uniform manifold approximation and projection (UMAP) method to embed the terms into a representation space such that terms that tend to appear in the same documents are closer together. Each author’s corpus defines a probability distribution over terms in this space. Using the Wasserstein distance to quantify the similarity between these distributions, I generate a distance matrix among authors that can be analyzed and visualized as a graph. I demonstrate that the distribution of edges in the graph relating members of a faculty are significantly associated with departmental and research centre affiliations, while identifying untapped connections among members.

Journal of InformetricsVol. 20(4)
Western University (CA)
Openalex Percentile: Top 9%
scientometrics and bibliometrics research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.