Mehwish Alam

Dr. Mehwish Alam

FIZ Karlsruhe - Leibniz Institute for Information Infrastructure, 76344 Karlsruhe, Germany
orcid

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
17 June 2021 in Semantic Web: – Interoperability, Usability, Applicability
Verified
Journal Article
Closed access
PDF file
GGGenet Asefa Gesese
Genet Asefa Gesese
RBRussa Biswas
Russa Biswas
Mehwish AlamMehwish Alam
Mehwish Alam
HSHarald Sack
Harald Sack
Knowledge Graphs (KGs) are composed of structured information about a particular domain in the form of entities and relations. In addition to the structured information KGs help in facilitating interconnectivity and interoperability between different resources represented in the Linked Data Cloud. KGs have been used in a variety of applications such as entity linking, question answering, recommender systems, etc. However, KG applications suffer from high computational and storage costs. Hence, there arises the necessity for a representation able to map the high dimensional KGs into low dimensional spaces, i.e., embedding space, preserving structural as well as relational information. This paper conducts a survey of KG embedding models which not only consider the structured information contained in the form of entities and relations in a KG but also its unstructured information represented as literals such as text, numerical values, images, etc. Along with a theoretical analysis and comparison of the methods proposed so far for generating KG embeddings with literals, an empirical evaluation of the different methods under identical settings has been performed for the general task of link prediction.

10 July 2024
Verified
Conference Paper
Open access
FSFabian M. Suchanek
Fabian M. Suchanek
Mehwish AlamMehwish Alam
Mehwish Alam
TBThomas Bonald
Thomas Bonald
LCLihu Chen
Lihu Chen
PPPierre-Henri Paris
Pierre-Henri Paris
JSJules Soria
Jules Soria
Knowledge Bases (KBs) find applications in many knowledge-intensive tasks and, most notably, in information retrieval. Wikidata is one of the largest public general-purpose KBs. Yet, its collaborative nature has led to a convoluted schema and taxonomy. The YAGO~4 KB cleaned up the taxonomy by incorporating the ontology of Schema.org, resulting in a cleaner structure amenable to automated reasoning. However, it also cut away large parts of the Wikidata taxonomy, which is essential for information retrieval. In this paper, we extend YAGO~4 with a large part of the Wikidata taxonomy -- while respecting logical constraints and the distinction between classes and instances. This yields YAGO~4.5, a new, logically consistent version of YAGO that adds a rich layer of informative classes. An intrinsic and an extrinsic evaluation show the value of the new resource.

4 November 2016
Verified
Book Chapter
Closed access
PDF file
AGAldo Gangemi
Aldo Gangemi
Mehwish AlamMehwish Alam
Mehwish Alam
LALuigi Asprino
Luigi Asprino
VPValentina Presutti
Valentina Presutti
Diego Reforgiato RecuperoDiego Reforgiato Recupero
Diego Reforgiato Recupero

27 October 2022
Verified
Conference Paper
Open access
GGGenet Asefa Gesese
Genet Asefa Gesese
Harald SackHarald Sack
Harald Sack
Mehwish AlamMehwish Alam
Mehwish Alam
Due to the open world assumption, Knowledge Graphs (KGs) are never complete. In order to address this issue, various Link Prediction (LP) methods are proposed so far. Some of these methods are inductive LP models which are capable of learning representations for entities not seen during training. However, to the best of our knowledge, none of the existing inductive LP models focus on learning representations for unseen relations. In this work, a novel Relation Aware Inductive Link preDiction (RAILD) is proposed for KG completion which learns representations for both unseen entities and unseen relations. In addition to leveraging textual literals associated with both entities and relations by employing language models, RAILD also introduces a novel graph-based approach to generate features for relations. Experiments are conducted with different existing and newly created challenging benchmark datasets and the results indicate that RAILD leads to performance improvement over the state-of-the-art models. Moreover, since there are no existing inductive LP models which learn representations for unseen relations, we have created our own baselines and the results obtained with RAILD also outperform these baselines.

1 October 2015
Verified
Conference Paper
Closed access
Mehwish AlamMehwish Alam
Mehwish Alam
ANAmedeo Napoli
Amedeo Napoli
With an increased interest in machine processable data, many datasets are now published in RDF (Resource Description Framework) format in Linked Data Cloud. These data are distributed over independent resources which need to be centralized and explored for domain specific applications. This paper proposes a new approach based on interactive data exploration paradigm using Pattern Structures, an extension of Formal Concept Analysis, to provide exploration and navigation over Linked Data through concept lattices. It takes RDF triples and RDF Schema based on user requirements and provides one navigation space resulting from several RDF resources. This navigation space allows user to navigate and search only the part of data that is interesting for her.

1 November 2019 in IEEE Computational Intelligence Magazine
Verified
Journal Article
Closed access
Diego Reforgiato RecuperoDiego Reforgiato Recupero
Diego Reforgiato Recupero
Mehwish AlamMehwish Alam
Mehwish Alam
DBDavide Buscaldi
Davide Buscaldi
AGAude Grezka
Aude Grezka
FTFarideh Tavazoee
Farideh Tavazoee