Unveiling Scholarly Communities over Knowledge Graphs

Sahar Vahdati, Guillermo Palma, Rahul Jyoti Nath, Christoph Lange, Sören Auer, Maria-Esther VidalarXiv 2018 · arXiv

TL;DR

Korona is a new framework that leverages the rich semantics of Knowledge Graphs to predict scholarly collaborations. By combining semantic similarity measures with graph partitioning, it identifies potential co-authorship networks that traditional, topology-only methods often miss.

What Problem Does This Paper Address?

The explosion of scholarly data—millions of papers, thousands of conferences, and a growing web of researchers—makes it increasingly difficult for scientists to find relevant collaborators or track emerging research trends.

Existing community detection methods typically rely on graph topology (e.g., "who has already co-authored with whom"). However, these methods often ignore the semantics—the actual meaning of the research topics, the specific focus of publication venues, and the nuanced relationships between different scholarly entities. The authors argue that to truly "unveil" hidden communities, we need to look at what people are working on, not just who they already know.

Fig. 1: Motivating Example. Co-authorship communities from the Semantic Web area working on data-centric problems. Researchers were in different co- authorship communities (2016) (a) started a successful scientific collaboration in 2016 (b), and as a result, produced a large number of scholarly artifacts.

Methods

The authors introduce Korona, a knowledge-driven framework that operates in two main stages:

  1. Knowledge Graph Creation: The system ingests data from heterogeneous sources (like DBLP) and transforms it into a Scholarly Knowledge Graph (SKG). This graph represents researchers, papers, and venues as nodes, with edges representing relationships like isAuthorOf or publishedIn.
  2. Knowledge Discovery: This stage uses three specialized solvers:
  3. Intra-type Relatedness solver (IRs): Quantifies how similar two entities of the same type (e.g., two researchers) are. It uses semantic similarity measures like GADES or Doc2Vec to look at shared topics and publication histories.
  4. Intra-type Scholarly Community solver (ISCs): Uses unsupervised graph partitioning algorithms (specifically METIS and semEP) to cluster these entities based on their similarity scores.
  5. Scholarly Pattern generator (SPg): Applies the homophily principle—the idea that similar entities are likely to relate to one another—to predict new links, such as potential future co-authors.
Fig. 2: Korona Knowledge Graph. Scholarly entities and relations.

Datasets

The researchers evaluated Korona using a Scholarly Knowledge Graph built from:

  • DBLP: A massive collection of computer science bibliography data (specifically the April 2017 dump, totaling 7.83 GB).
  • ISWC Data: A focused subset containing researchers, papers, and publication years from the International Semantic Web Conference (ISWC) spanning 2001–2016.

Key Insights and Ideas

  • Semantics > Topology: Relying solely on existing links (topology) is reactive. By using semantics, Korona becomes predictive, identifying researchers who should collaborate because their research interests align, even if they haven't met yet.
  • The Homophily Principle: The core "aha moment" is successfully applying the sociological concept of homophily to automated link prediction in KGs. If two researchers publish on "Federated Query Processing" at the same high-tier conferences, they belong in the same community regardless of their current co-authorship status.
  • Extensibility: While the paper focuses on co-authorship, the framework is designed to be general. By changing the ontology, it could predict co-citation patterns between articles or academic collaborations between entire institutions.
Fig. 3: Scholarly networks. (a) Co-authors networks from researchers and ar- ticles.(b) Co-citation networks from discovered from events and articles.

Key Results

The authors conducted an empirical evaluation and a user survey to validate Korona's predictions:

  • Quantitative Performance: The framework showed its best performance at the 95th percentile of similarity values, effectively grouping highly related researchers while minimizing "noise" from unrelated authors.
  • User Validation: A survey of 10 researchers in the Semantic Web field confirmed the relevance of the recommendations. Participants rated the relevance of the predicted collaborators (on a scale of 1-5) with averages ranging from 3.1 to 3.8, indicating that the system identifies meaningful potential partners.
  • Algorithm Comparison: The implementation using semEP (a semantic-based partitioning tool) generally provided more precise results in the user survey compared to the standard METIS algorithm.

Limitations and Future Work

The authors acknowledge several areas for growth:

  • Scope: The current proof-of-concept is limited to co-authorship within the Semantic Web community. Future work will expand to affiliation networks and research development networks.
  • Scalability: While it works on DBLP subsets, the authors plan to study how Korona scales to truly massive, multi-domain scholarly datasets.
  • Similarity Measures: The impact of different semantic similarity measures (beyond GADES and Doc2Vec) remains to be fully explored.
  • Service Delivery: The ultimate goal is to offer Korona as an online service for the broader research community to explore and analyze scholarly trends.

Summary updated

Abstract

Knowledge graphs represent the meaning of properties of real-world entities and relationships among them in a natural way. Exploiting semantics encoded in knowledge graphs enables the implementation of knowledge-driven tasks such as semantic retrieval, query processing, and question answering, as well as solutions to knowledge discovery tasks including pattern discovery and link prediction. In this paper, we tackle the problem of knowledge discovery in scholarly knowledge graphs, i.e., graphs that integrate scholarly data, and present Korona, a knowledge-driven framework able to unveil scholarly communities for the prediction of scholarly networks. Korona implements a graph partition approach and relies on semantic similarity measures to determine relatedness between scholarly entities. As a proof of concept, we built a scholarly knowledge graph with data from researchers, conferences, and papers of the Semantic Web area, and apply Korona to uncover co-authorship networks. Results observed from our empirical evaluation suggest that exploiting semantics in scholarly knowledge graphs enables the identification of previously unknown relations between researchers. By extending the ontology, these observations can be generalized to other scholarly entities, e.g., articles or institutions, for the prediction of other scholarly patterns, e.g., co-citations or academic collaboration.
BibTeX
@misc{vahdati2018unveiling,
  author = {Sahar Vahdati and Guillermo Palma and Rahul Jyoti Nath and Christoph Lange and Sören Auer and Maria-Esther Vidal},
  title = {{Unveiling Scholarly Communities over Knowledge Graphs}},
  year = {2018},
  eprint = {1807.06816},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/1807.06816},
}
Figure