Unveiling Scholarly Communities over Knowledge Graphs

  title={Unveiling Scholarly Communities over Knowledge Graphs},
  author={Sahar Vahdati and Guillermo Palma and Rahul Jyoti Nath and Christoph Lange and S. Auer and Maria-Esther Vidal},
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… 

Exploring Scholarly Data by Semantic Query on Knowledge Graph Embedding Space

The semantic queries are defined, which are algebraic operations between the embedding vectors in the knowledge graph embedding space, to solve queries such as similarity and analogy between the entities on the original datasets.

Scholarly knowledge graphs through structuring scholarly communication: a review

This review paper investigates the field of applying machine learning, rule-based learning, and natural language processing tools and approaches to construct SKG and presents the review of knowledge graph utilization and refinement to provide a view of current research efforts.

Embedding-Based Recommendations on Scholarly Knowledge Graphs

A significant improvement in the accuracy of the experimented KGE models on the considered scholarly KGs using this specific loss function (Soft Margin) is shown and the predicted co-authorship links have been validated by evaluating profile of scholars.

Link Prediction of Weighted Triples for Knowledge Graph Completion Within the Scholarly Domain

The Weighted Triple Loss is proposed, a new loss function for KGE models that takes full advantage of the additional numerical weights on facts and it is even tolerant to incorrect weights, which enables to complete information about affiliation types, countries, and research topics.

Context-Compatible Information Fusion for Scientific Knowledge Graphs

The consequences of uncontrolled knowledge graph evolution in real-world scientific libraries using NLM’s PubMed corpus vs. the SemMedDB knowledge base are quantified and the implicit notion of context compatibility is superior to existing methods in terms of both, simplicity and retrieval quality.

Shall I Work with Them? A Knowledge Graph-Based Approach for Predicting Future Research Collaborations

This work investigates whether the integration of unstructured textual data into a single knowledge graph affects the performance of a link prediction model, and proposes a three-phase pipeline that enables the exploitation of structural and textual information, as well as of pre-trained word embeddings.

Integrating Scholarly Data with Knowledge Graphs

The current Lattes platform is explored by extracting information from it to create a RDF triple store, and techniques to create links to external triple datasets are provided, building a knowledge graph for scholarly data containing Brazilians researchers and publications.

Metaresearch Recommendations using Knowledge Graph Embeddings

The task of scholarly recommendation is formulated as a link prediction task based on knowledge graph embeddings that considers only triples in the knowledge graph and DKRL which in addition incorporates natural language descriptions of entities during training.

Improving Scholarly Knowledge Representation: Evaluating BERT-based Models for Scientific Relation Classification

This study aims to offer recommendations to the stakeholders of digital libraries for selecting the appropriate technique to build knowledge-graph-based systems for enhanced scholarly information organization by focusing on two key factors: 1) Bert model variants, and 2) classification strategies.

The Geranium Platform: A KG-Based System for Academic Publications

The Geranium recommendation system is described, which exploits Graph Neural Networks (GNNs) to suggest collaboration opportunities between researchers of different disciplines and shows that the fusion of these technologies represents a promising approach for recommendation and metadata inference in the scholarly domain.



Considering Semantics on the Discovery of Relations in Knowledge Graphs

KOI is able to discover missing edges between related TED talks that cannot be discovered by state-of-the-art approaches and reveals that combining semantics encoded both in the similarity measures and in the knowledge graph structure, has a positive impact on the relation discovery problem.

GADES: A Graph-based Semantic Similarity Measure

This work addresses the problem of similarity assessment between knowledge graph entities, and devise GADES, which relies on aspect similarities and computes a similarity measure as the combination of these similarity values.

Link Prediction on the Semantic MEDLINE Network - An Approach to Literature-Based Discovery

A methodology for link prediction of implicit relationships in the Semantic MEDLINE network is proposed and evaluated, which shows high prediction performance and is complementary to, and may augment, existing LBD approaches.

Knowledge graph refinement: A survey of approaches and evaluation methods

A survey of such knowledge graph refinement approaches, with a dual look at both the methods being proposed as well as the evaluation methodologies used.

Drug-Target Interaction Prediction Using Semantic Similarity and Edge Partitioning

A novel method that combines a data mining framework for link prediction, semantic knowledge from ontologies or semantic spaces, and an algorithmic approach to partition the edges of a heterogeneous graph that includes drug-target interaction edges, and drug-drug and target-target similarity edges is presented.

Big Scholarly Data: A Survey

The background and state of the art of scholarly data management and relevant technologies are examined, and data analysis methods, such as statistical analysis, social network analysis, and content analysis for dealing with big scholarly data are reviewed.

The link-prediction problem for social networks

Experiments on large coauthorship networks suggest that information about future interactions can be extracted from network topology alone, and that fairly subtle measures for detecting node proximity can outperform more direct measures.

Modularity and community structure in networks.

  • M. Newman
  • Computer Science
    Proceedings of the National Academy of Sciences of the United States of America
  • 2006
It is shown that the modularity of a network can be expressed in terms of the eigenvectors of a characteristic matrix for the network, which is called modularity matrix, and that this expression leads to a spectral algorithm for community detection that returns results of demonstrably higher quality than competing methods in shorter running times.

A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs

This work presents a new coarsening heuristic (called heavy-edge heuristic) for which the size of the partition of the coarse graph is within a small factor of theSize of the final partition obtained after multilevel refinement, and presents a much faster variation of the Kernighan--Lin (KL) algorithm for refining during uncoarsening.

Distributed Representations of Sentences and Documents

Paragraph Vector is an unsupervised algorithm that learns fixed-length feature representations from variable-length pieces of texts, such as sentences, paragraphs, and documents, and its construction gives the algorithm the potential to overcome the weaknesses of bag-of-words models.