Hiba Arnaout

Hiba Arnaout

Auto-generated profile, based on publicly available information

Hiba Arnaout

Max Planck Institute for Informatics Germany

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
23 February 2024 in ACM Computing Surveys
Verified
Journal Article
Open access
SRSimon Razniewski
Simon Razniewski
HAHiba Arnaout
Hiba Arnaout
SGShrestha Ghosh
Shrestha Ghosh
FSFabian Suchanek
Fabian Suchanek
General-purpose knowledge bases (KBs) are a cornerstone of knowledge-centric AI. Many of them are constructed pragmatically from web sources and are thus far from complete. This poses challenges for the consumption as well as the curation of their content. While several surveys target the problem of completing incomplete KBs, the first problem is arguably to know whether and where the KB is incomplete in the first place, and to which degree. In this survey, we discuss how knowledge about completeness, recall, and negation in KBs can be expressed, extracted, and inferred. We cover (i) the logical foundations of knowledge representation and querying under partial closed-world semantics; (ii) the estimation of this information via statistical patterns; (iii) the extraction of information about recall from KBs and text; (iv) the identification of interesting negative statements; and (v) relaxed notions of relative recall. This survey is targeted at two types of audiences: (1) practitioners who are interested in tracking KB quality, focusing extraction efforts, and building quality-aware downstream applications; and (2) data management, knowledge base, and semantic web researchers who wish to understand the state-of-the-art of knowledge bases beyond the open-world assumption. Consequently, our survey presents both fundamental methodologies and the results that they have produced, and gives practice-oriented recommendations on how to choose between different approaches for a problem at hand.

19 April 2021
Verified
Conference Paper
Open access
HAHiba Arnaout
Hiba Arnaout
SRSimon Razniewski
Simon Razniewski
GWGerhard Weikum
Gerhard Weikum
Jeff Z.  PanJeff Z. Pan
Jeff Z. Pan
The Wikidata knowledge base (KB) is one of the most popular structured data repositories on the web, containing more than 1 billion statements for over 90 million entities. Like most major KBs, it is nonetheless incomplete and therefore operates under the open-world assumption (OWA) - statements not contained in Wikidata should be assumed to have an unknown truth. The OWA ignores however, that a significant part of interesting knowledge is negative, which cannot be readily expressed in this data model. In this paper, we review the challenges arising from the OWA, as well as some specific attempts Wikidata has made to overcome them. We review a statistical inference method for negative statements, called peer-based inference, and present Wikinegata, a platform that implements this inference over Wikidata. We discuss lessons learned from the development of this platform, as well as how the platform can be used both for learning about interesting negations, as well as about modelling challenges inside Wikidata. Wikinegata is available at https://d5demos.mpi-inf.mpg.de/negation.

1 January 2017
Verified
Conference Paper
Open access
HYHrag Yoghourdjian
Hrag Yoghourdjian
SEShady Elbassuoni
Shady Elbassuoni
MJMohamad Jaber
Mohamad Jaber
HAHiba Arnaout
Hiba Arnaout

1 July 2021 in Proceedings of the VLDB Endowment
Verified
Journal Article
Open access
SRSimon Razniewski
Simon Razniewski
HAHiba Arnaout
Hiba Arnaout
SGShrestha Ghosh
Shrestha Ghosh
FSFabian Suchanek
Fabian Suchanek
General-purpose knowledge bases (KBs) are an important component of several data-driven applications. Pragmatically constructed from available web sources, these KBs are far from complete, which poses a set of challenges in curation as well as consumption. In this tutorial we discuss how completeness, recall and negation in DBs and KBs can be represented, extracted, and inferred. We proceed in 5 parts: (i) We introduce the logical foundations of knowledge representation and querying under partial closed-world semantics. (ii) We show how information about recall can be identified in KBs and in text, and (iii) how it can be estimated via statistical patterns. (iv) We show how interesting negative statements can be identified, and (v) how recall can be targeted in a comparative notion.

27 February 2023
Verified
Conference Paper
Open access
HAHiba Arnaout
Hiba Arnaout
TNTuan-Phong Nguyen
Tuan-Phong Nguyen
SRSimon Razniewski
Simon Razniewski
GWGerhard Weikum
Gerhard Weikum
Knowledge bases about commonsense knowledge i.e., CSKBs, are crucial in applications such as search and question answering. Prominent CSKBs mostly focus on positive statements. In this paper we show that materializing important negations increases the usability of CSKBs. We present Uncommonsense, a web portal to explore informative negations about everyday concepts: (i) in a research-focused interface, users get a glimpse into results-per-steps of the methodology; (ii) in a trivia interface, users can browse fun negative trivia about concepts of their choice; and (iii) in a query interface, users can submit triple-pattern queries with explicit negated relations and compare results with significantly less relevant answers from the positive-only baseline. It can be accessed at:https://uncommonsense.mpi-inf.mpg.de/.

21 February 2025
Verified
Book
Closed access
HAHiba Arnaout
Hiba Arnaout
Knowledge Graphs (KGs) about real-world entities and their properties are an important asset in many AI applications, but web-scale KGs generally store only positive statements. Due to this incompleteness, absent statements are considered unknown rat...