322,798 results on '"Weikum, Gerhard"'
Search Results
2. Faithful Temporal Question Answering over Heterogeneous Sources
- Author
-
Jia, Zhen, Christmann, Philipp, and Weikum, Gerhard
- Subjects
Computer Science - Information Retrieval ,Computer Science - Computation and Language - Abstract
Temporal question answering (QA) involves time constraints, with phrases such as "... in 2019" or "... before COVID". In the former, time is an explicit condition, in the latter it is implicit. State-of-the-art methods have limitations along three dimensions. First, with neural inference, time constraints are merely soft-matched, giving room to invalid or inexplicable answers. Second, questions with implicit time are poorly supported. Third, answers come from a single source: either a knowledge base (KB) or a text corpus. We propose a temporal QA system that addresses these shortcomings. First, it enforces temporal constraints for faithful answering with tangible evidence. Second, it properly handles implicit questions. Third, it operates over heterogeneous sources, covering KB, text and web tables in a unified manner. The method has three stages: (i) understanding the question and its temporal conditions, (ii) retrieving evidence from all sources, and (iii) faithfully answering the question. As implicit questions are sparse in prior benchmarks, we introduce a principled method for generating diverse questions. Experiments show superior performance over a suite of baselines., Comment: Accepted at WWW 2024
- Published
- 2024
3. Cultural Commonsense Knowledge for Intercultural Dialogues
- Author
-
Nguyen, Tuan-Phong, Razniewski, Simon, and Weikum, Gerhard
- Subjects
Computer Science - Computation and Language - Abstract
Despite recent progress, large language models (LLMs) still face the challenge of appropriately reacting to the intricacies of social and cultural conventions. This paper presents MANGO, a methodology for distilling high-accuracy, high-recall assertions of cultural knowledge. We judiciously and iteratively prompt LLMs for this purpose from two entry points, concepts and cultures. Outputs are consolidated via clustering and generative summarization. Running the MANGO method with GPT-3.5 as underlying LLM yields 167K high-accuracy assertions for 30K concepts and 11K cultures, surpassing prior resources by a large margin in quality and size. In an extrinsic evaluation for intercultural dialogues, we explore augmenting dialogue systems with cultural knowledge assertions. Notably, despite LLMs inherently possessing cultural knowledge, we find that adding knowledge from MANGO improves the overall quality, specificity, and cultural sensitivity of dialogue responses, as judged by human annotators. Data and code are available for download., Comment: 11 pages, 2 figures, 10 tables, accepted at CIKM '24
- Published
- 2024
- Full Text
- View/download PDF
4. Roadmap on Data-Centric Materials Science
- Author
-
Bauer, Stefan, Benner, Peter, Bereau, Tristan, Blum, Volker, Boley, Mario, Carbogno, Christian, Catlow, C. Richard A., Dehm, Gerhard, Eibl, Sebastian, Ernstorfer, Ralph, Fekete, Ádám, Foppa, Lucas, Fratzl, Peter, Freysoldt, Christoph, Gault, Baptiste, Ghiringhelli, Luca M., Giri, Sajal K., Gladyshev, Anton, Goyal, Pawan, Hattrick-Simpers, Jason, Kabalan, Lara, Karpov, Petr, Khorrami, Mohammad S., Koch, Christoph, Kokott, Sebastian, Kosch, Thomas, Kowalec, Igor, Kremer, Kurt, Leitherer, Andreas, Li, Yue, Liebscher, Christian H., Logsdail, Andrew J., Lu, Zhongwei, Luong, Felix, Marek, Andreas, Merz, Florian, Mianroodi, Jaber R., Neugebauer, Jörg, Pei, Zongrui, Purcell, Thomas A. R., Raabe, Dierk, Rampp, Markus, Rossi, Mariana, Rost, Jan-Michael, Saal, James, Saalmann, Ulf, Sasidhar, Kasturi Narasimha, Saxena, Alaukik, Sbailò, Luigi, Scheidgen, Markus, Schloz, Marcel, Schmidt, Daniel F., Teshuva, Simon, Trunschke, Annette, Wei, Ye, Weikum, Gerhard, Xian, R. Patrick, Yao, Yi, Yin, Junqi, Zhao, Meng, and Scheffler, Matthias
- Subjects
Condensed Matter - Materials Science ,Physics - Data Analysis, Statistics and Probability - Abstract
Science is and always has been based on data, but the terms "data-centric" and the "4th paradigm of" materials research indicate a radical change in how information is retrieved, handled and research is performed. It signifies a transformative shift towards managing vast data collections, digital repositories, and innovative data analytics methods. The integration of Artificial Intelligence (AI) and its subset Machine Learning (ML), has become pivotal in addressing all these challenges. This Roadmap on Data-Centric Materials Science explores fundamental concepts and methodologies, illustrating diverse applications in electronic-structure theory, soft matter theory, microstructure research, and experimental techniques like photoemission, atom probe tomography, and electron microscopy. While the roadmap delves into specific areas within the broad interdisciplinary field of materials science, the provided examples elucidate key concepts applicable to a wider range of topics. The discussed instances offer insights into addressing the multifaceted challenges encountered in contemporary materials research., Comment: Review, outlook, roadmap, perspective
- Published
- 2024
5. Recommendations by Concise User Profiles from Review Text
- Author
-
Torbati, Ghazaleh Haratinezhad, Tigunova, Anna, Yates, Andrew, and Weikum, Gerhard
- Subjects
Computer Science - Information Retrieval - Abstract
Recommender systems are most successful for popular items and users with ample interactions (likes, ratings etc.). This work addresses the difficult and underexplored case of supporting users who have very sparse interactions but post informative review texts. Our experimental studies address two book communities with these characteristics. We design a framework with Transformer-based representation learning, covering user-item interactions, item content, and user-provided reviews. To overcome interaction sparseness, we devise techniques for selecting the most informative cues to construct concise user profiles. Comprehensive experiments, with datasets from Amazon and Goodreads, show that judicious selection of text snippets achieves the best performance, even in comparison to LLM-generated rankings and to using LLMs to generate user profiles.
- Published
- 2023
6. Evaluating the Knowledge Base Completion Potential of GPT
- Author
-
Veseli, Blerta, Razniewski, Simon, Kalo, Jan-Christoph, and Weikum, Gerhard
- Subjects
Computer Science - Computation and Language ,Computer Science - Artificial Intelligence - Abstract
Structured knowledge bases (KBs) are an asset for search engines and other applications, but are inevitably incomplete. Language models (LMs) have been proposed for unsupervised knowledge base completion (KBC), yet, their ability to do this at scale and with high accuracy remains an open question. Prior experimental studies mostly fall short because they only evaluate on popular subjects, or sample already existing facts from KBs. In this work, we perform a careful evaluation of GPT's potential to complete the largest public KB: Wikidata. We find that, despite their size and capabilities, models like GPT-3, ChatGPT and GPT-4 do not achieve fully convincing results on this task. Nonetheless, they provide solid improvements over earlier approaches with smaller LMs. In particular, we show that, with proper thresholding, GPT-3 enables to extend Wikidata by 27M facts at 90% precision., Comment: 12 pages 4 tables
- Published
- 2023
7. Robust Training for Conversational Question Answering Models with Reinforced Reformulation Generation
- Author
-
Kaiser, Magdalena, Roy, Rishiraj Saha, and Weikum, Gerhard
- Subjects
Computer Science - Computation and Language ,Computer Science - Artificial Intelligence ,Computer Science - Information Retrieval - Abstract
Models for conversational question answering (ConvQA) over knowledge graphs (KGs) are usually trained and tested on benchmarks of gold QA pairs. This implies that training is limited to surface forms seen in the respective datasets, and evaluation is on a small set of held-out questions. Through our proposed framework REIGN, we take several steps to remedy this restricted learning setup. First, we systematically generate reformulations of training questions to increase robustness of models to surface form variations. This is a particularly challenging problem, given the incomplete nature of such questions. Second, we guide ConvQA models towards higher performance by feeding it only those reformulations that help improve their answering quality, using deep reinforcement learning. Third, we demonstrate the viability of training major model components on one benchmark and applying them zero-shot to another. Finally, for a rigorous evaluation of robustness for trained models, we use and release large numbers of diverse reformulations generated by prompting GPT for benchmark test sets (resulting in 20x increase in sizes). Our findings show that ConvQA models with robust training via reformulations, significantly outperform those with standard training from gold QA pairs only., Comment: WSDM 2024 Research Paper, 11 pages
- Published
- 2023
8. Extracting Multi-valued Relations from Language Models
- Author
-
Singhania, Sneha, Razniewski, Simon, and Weikum, Gerhard
- Subjects
Computer Science - Computation and Language - Abstract
The widespread usage of latent language representations via pre-trained language models (LMs) suggests that they are a promising source of structured knowledge. However, existing methods focus only on a single object per subject-relation pair, even though often multiple objects are correct. To overcome this limitation, we analyze these representations for their potential to yield materialized multi-object relational knowledge. We formulate the problem as a rank-then-select task. For ranking candidate objects, we evaluate existing prompting techniques and propose new ones incorporating domain knowledge. Among the selection methods, we find that choosing objects with a likelihood above a learned relation-specific threshold gives a 49.5% F1 score. Our results highlight the difficulty of employing LMs for the multi-valued slot-filling task and pave the way for further research on extracting relational knowledge from latent language representations., Comment: Accepted to Repl4NLP Workshop at ACL 2023
- Published
- 2023
9. Knowledge Base Completion for Long-Tail Entities
- Author
-
Chen, Lihu, Razniewski, Simon, and Weikum, Gerhard
- Subjects
Computer Science - Computation and Language - Abstract
Despite their impressive scale, knowledge bases (KBs), such as Wikidata, still contain significant gaps. Language models (LMs) have been proposed as a source for filling these gaps. However, prior works have focused on prominent entities with rich coverage by LMs, neglecting the crucial case of long-tail entities. In this paper, we present a novel method for LM-based-KB completion that is specifically geared for facts about long-tail entities. The method leverages two different LMs in two stages: for candidate retrieval and for candidate verification and disambiguation. To evaluate our method and various baselines, we introduce a novel dataset, called MALT, rooted in Wikidata. Our method outperforms all baselines in F1, with major gains especially in recall., Comment: In ACL23 (MATCHING workshop)
- Published
- 2023
10. CompMix: A Benchmark for Heterogeneous Question Answering
- Author
-
Christmann, Philipp, Roy, Rishiraj Saha, and Weikum, Gerhard
- Subjects
Computer Science - Information Retrieval - Abstract
Fact-centric question answering (QA) often requires access to multiple, heterogeneous, information sources. By jointly considering several sources like a knowledge base (KB), a text collection, and tables from the web, QA systems can enhance their answer coverage and confidence. However, existing QA benchmarks are mostly constructed with a single source of knowledge in mind. This limits capabilities of these benchmarks to fairly evaluate QA systems that can tap into more than one information repository. To bridge this gap, we release CompMix, a crowdsourced QA benchmark which naturally demands the integration of a mixture of input sources. CompMix has a total of 9,410 questions, and features several complex intents like joins and temporal conditions. Evaluation of a range of QA systems on CompMix highlights the need for further research on leveraging information from heterogeneous sources.
- Published
- 2023
11. Explainable Conversational Question Answering over Heterogeneous Sources via Iterative Graph Neural Networks
- Author
-
Christmann, Philipp, Roy, Rishiraj Saha, and Weikum, Gerhard
- Subjects
Computer Science - Information Retrieval - Abstract
In conversational question answering, users express their information needs through a series of utterances with incomplete context. Typical ConvQA methods rely on a single source (a knowledge base (KB), or a text corpus, or a set of tables), thus being unable to benefit from increased answer coverage and redundancy of multiple sources. Our method EXPLAIGNN overcomes these limitations by integrating information from a mixture of sources with user-comprehensible explanations for answers. It constructs a heterogeneous graph from entities and evidence snippets retrieved from a KB, a text corpus, web tables, and infoboxes. This large graph is then iteratively reduced via graph neural networks that incorporate question-level attention, until the best answers and their explanations are distilled. Experiments show that EXPLAIGNN improves performance over state-of-the-art baselines. A user study demonstrates that derived answers are understandable by end users., Comment: Accepted at SIGIR 2023 (extended version)
- Published
- 2023
12. Conversational Search with Tail Entities
- Author
-
Tran, Hai Dang, Yates, Andrew, Weikum, Gerhard, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Goharian, Nazli, editor, Tonellotto, Nicola, editor, He, Yulan, editor, Lipani, Aldo, editor, McDonald, Graham, editor, Macdonald, Craig, editor, and Ounis, Iadh, editor
- Published
- 2024
- Full Text
- View/download PDF
13. Evaluating Language Models for Knowledge Base Completion
- Author
-
Veseli, Blerta, Singhania, Sneha, Razniewski, Simon, and Weikum, Gerhard
- Subjects
Computer Science - Computation and Language ,Computer Science - Artificial Intelligence - Abstract
Structured knowledge bases (KBs) are a foundation of many intelligent applications, yet are notoriously incomplete. Language models (LMs) have recently been proposed for unsupervised knowledge base completion (KBC), yet, despite encouraging initial results, questions regarding their suitability remain open. Existing evaluations often fall short because they only evaluate on popular subjects, or sample already existing facts from KBs. In this work, we introduce a novel, more challenging benchmark dataset, and a methodology tailored for a realistic assessment of the KBC potential of LMs. For automated assessment, we curate a dataset called WD-KNOWN, which provides an unbiased random sample of Wikidata, containing over 3.9 million facts. In a second step, we perform a human evaluation on predictions that are not yet in the KB, as only this provides real insights into the added value over existing KBs. Our key finding is that biases in dataset conception of previous benchmarks lead to a systematic overestimate of LM performance for KBC. However, our results also reveal strong areas of LMs. We could, for example, perform a significant completion of Wikidata on the relations nativeLanguage, by a factor of ~21 (from 260k to 5.8M) at 82% precision, usedLanguage, by a factor of ~2.1 (from 2.1M to 6.6M) at 82% precision, and citizenOf by a factor of ~0.3 (from 4.2M to 5.3M) at 90% precision. Moreover, we find that LMs possess surprisingly strong generalization capabilities: even on relations where most facts were not directly observed in LM training, prediction quality can be high., Comment: Data and code available at https://github.com/bveseli/LMsForKBC
- Published
- 2023
14. Class Cardinality Comparison as a Fermi Problem
- Author
-
Ghosh, Shrestha, Razniewski, Simon, and Weikum, Gerhard
- Subjects
Computer Science - Information Retrieval ,Computer Science - Artificial Intelligence - Abstract
Questions on class cardinality comparisons are quite tricky to answer and come with its own challenges. They require some kind of reasoning since web documents and knowledge bases, indispensable sources of information, rarely store direct answers to questions, such as, ``Are there more astronauts or Physics Nobel Laureates?'' We tackle questions on class cardinality comparison by tapping into three sources for absolute cardinalities as well as the cardinalities of orthogonal subgroups of the classes. We propose novel techniques for aggregating signals with partial coverage for more reliable estimates and evaluate them on a dataset of 4005 class pairs, achieving an accuracy of 83.7%., Comment: Accepted to the Web Conference 2023
- Published
- 2023
15. Extracting Cultural Commonsense Knowledge at Scale
- Author
-
Nguyen, Tuan-Phong, Razniewski, Simon, Varde, Aparna, and Weikum, Gerhard
- Subjects
Computer Science - Computation and Language ,Computer Science - Artificial Intelligence - Abstract
Structured knowledge is important for many AI applications. Commonsense knowledge, which is crucial for robust human-centric AI, is covered by a small number of structured knowledge projects. However, they lack knowledge about human traits and behaviors conditioned on socio-cultural contexts, which is crucial for situative AI. This paper presents CANDLE, an end-to-end methodology for extracting high-quality cultural commonsense knowledge (CCSK) at scale. CANDLE extracts CCSK assertions from a huge web corpus and organizes them into coherent clusters, for 3 domains of subjects (geography, religion, occupation) and several cultural facets (food, drinks, clothing, traditions, rituals, behaviors). CANDLE includes judicious techniques for classification-based filtering and scoring of interestingness. Experimental evaluations show the superiority of the CANDLE CCSK collection over prior works, and an extrinsic use case demonstrates the benefits of CCSK for the GPT-3 language model. Code and data can be accessed at https://candle.mpi-inf.mpg.de/., Comment: 11 pages, 6 figures, 10 tables
- Published
- 2022
- Full Text
- View/download PDF
16. Answering Count Questions with Structured Answers from Text
- Author
-
Ghosh, Shrestha, Razniewski, Simon, and Weikum, Gerhard
- Subjects
Computer Science - Information Retrieval - Abstract
In this work we address the challenging case of answering count queries in web search, such as ``number of songs by John Lennon''. Prior methods merely answer these with a single, and sometimes puzzling number or return a ranked list of text snippets with different numbers. This paper proposes a methodology for answering count queries with inference, contextualization and explanatory evidence. Unlike previous systems, our method infers final answers from multiple observations, supports semantic qualifiers for the counts, and provides evidence by enumerating representative instances. Experiments with a wide variety of queries, including existing benchmark show the benefits of our method, and the influence of specific parameter settings. Our code, data and an interactive system demonstration are publicly available at https://github.com/ghoshs/CoQEx and https://nlcounqer.mpi-inf.mpg.de/., Comment: arXiv admin note: text overlap with arXiv:2204.05039
- Published
- 2022
- Full Text
- View/download PDF
17. UnCommonSense: Informative Negative Knowledge about Everyday Concepts
- Author
-
Arnaout, Hiba, Razniewski, Simon, Weikum, Gerhard, and Pan, Jeff Z.
- Subjects
Computer Science - Artificial Intelligence ,Computer Science - Information Retrieval - Abstract
Commonsense knowledge about everyday concepts is an important asset for AI applications, such as question answering and chatbots. Recently, we have seen an increasing interest in the construction of structured commonsense knowledge bases (CSKBs). An important part of human commonsense is about properties that do not apply to concepts, yet existing CSKBs only store positive statements. Moreover, since CSKBs operate under the open-world assumption, absent statements are considered to have unknown truth rather than being invalid. This paper presents the UNCOMMONSENSE framework for materializing informative negative commonsense statements. Given a target concept, comparable concepts are identified in the CSKB, for which a local closed-world assumption is postulated. This way, positive statements about comparable concepts that are absent for the target concept become seeds for negative statement candidates. The large set of candidates is then scrutinized, pruned and ranked by informativeness. Intrinsic and extrinsic evaluations show that our method significantly outperforms the state-of-the-art. A large dataset of informative negations is released as a resource for future research.
- Published
- 2022
- Full Text
- View/download PDF
18. Conversational Question Answering on Heterogeneous Sources
- Author
-
Christmann, Philipp, Roy, Rishiraj Saha, and Weikum, Gerhard
- Subjects
Computer Science - Information Retrieval ,Computer Science - Computation and Language - Abstract
Conversational question answering (ConvQA) tackles sequential information needs where contexts in follow-up questions are left implicit. Current ConvQA systems operate over homogeneous sources of information: either a knowledge base (KB), or a text corpus, or a collection of tables. This paper addresses the novel issue of jointly tapping into all of these together, this way boosting answer coverage and confidence. We present CONVINSE, an end-to-end pipeline for ConvQA over heterogeneous sources, operating in three stages: i) learning an explicit structured representation of an incoming question and its conversational context, ii) harnessing this frame-like representation to uniformly capture relevant evidences from KB, text, and tables, and iii) running a fusion-in-decoder model to generate the answer. We construct and release the first benchmark, ConvMix, for ConvQA over heterogeneous sources, comprising 3000 real-user conversations with 16000 questions, along with entity annotations, completed question utterances, and question paraphrases. Experiments demonstrate the viability and advantages of our method, compared to state-of-the-art baselines., Comment: SIGIR 2022 Research Track Long Paper
- Published
- 2022
19. Answering Count Queries with Explanatory Evidence
- Author
-
Ghosh, Shrestha, Razniewski, Simon, and Weikum, Gerhard
- Subjects
Computer Science - Information Retrieval - Abstract
A challenging case in web search and question answering are count queries, such as \textit{"number of songs by John Lennon"}. Prior methods merely answer these with a single, and sometimes puzzling number or return a ranked list of text snippets with different numbers. This paper proposes a methodology for answering count queries with inference, contextualization and explanatory evidence. Unlike previous systems, our method infers final answers from multiple observations, supports semantic qualifiers for the counts, and provides evidence by enumerating representative instances. Experiments with a wide variety of queries show the benefits of our method. To promote further research on this underexplored topic, we release an annotated dataset of 5k queries with 200k relevant text spans., Comment: Version published at SIGIR 2022
- Published
- 2022
- Full Text
- View/download PDF
20. Refined Commonsense Knowledge from Large-Scale Web Contents
- Author
-
Nguyen, Tuan-Phong, Razniewski, Simon, Romero, Julien, and Weikum, Gerhard
- Subjects
Computer Science - Computation and Language ,Computer Science - Artificial Intelligence - Abstract
Commonsense knowledge (CSK) about concepts and their properties is helpful for AI applications. Prior works, such as ConceptNet, have compiled large CSK collections. However, they are restricted in their expressiveness to subject-predicate-object (SPO) triples with simple concepts for S and strings for P and O. This paper presents a method called ASCENT++ to automatically build a large-scale knowledge base (KB) of CSK assertions, with refined expressiveness and both better precision and recall than prior works. ASCENT++ goes beyond SPO triples by capturing composite concepts with subgroups and aspects, and by refining assertions with semantic facets. The latter is essential to express the temporal and spatial validity of assertions and further qualifiers. Furthermore, ASCENT++ combines open information extraction (OpenIE) with judicious cleaning and ranking by typicality and saliency scores. For high coverage, our method taps into the large-scale crawl C4 with broad web contents. The evaluation with human judgments shows the superior quality of the ASCENT++ KB, and an extrinsic evaluation for QA-support tasks underlines the benefits of ASCENT++. A web interface, data, and code can be accessed at https://ascentpp.mpi-inf.mpg.de/., Comment: This is a substantial extension of the previous WWW paper: arXiv:2011.00905
- Published
- 2021
- Full Text
- View/download PDF
21. Predicting Document Coverage for Relation Extraction
- Author
-
Singhania, Sneha, Razniewski, Simon, and Weikum, Gerhard
- Subjects
Computer Science - Computation and Language ,Computer Science - Artificial Intelligence - Abstract
This paper presents a new task of predicting the coverage of a text document for relation extraction (RE): does the document contain many relational tuples for a given entity? Coverage predictions are useful in selecting the best documents for knowledge base construction with large input corpora. To study this problem, we present a dataset of 31,366 diverse documents for 520 entities. We analyze the correlation of document coverage with features like length, entity mention frequency, Alexa rank, language complexity and information retrieval scores. Each of these features has only moderate predictive power. We employ methods combining features with statistical models like TF-IDF and language models like BERT. The model combining features and BERT, HERB, achieves an F1 score of up to 46%. We demonstrate the utility of coverage predictions on two use cases: KB construction and claim refutation., Comment: To appear in TACL. The arXiv version is a pre-MIT Press publication version
- Published
- 2021
22. Language Models As or For Knowledge Bases
- Author
-
Razniewski, Simon, Yates, Andrew, Kassner, Nora, and Weikum, Gerhard
- Subjects
Computer Science - Computation and Language ,Computer Science - Artificial Intelligence ,Computer Science - Databases - Abstract
Pre-trained language models (LMs) have recently gained attention for their potential as an alternative to (or proxy for) explicit knowledge bases (KBs). In this position paper, we examine this hypothesis, identify strengths and limitations of both LMs and KBs, and discuss the complementary nature of the two paradigms. In particular, we offer qualitative arguments that latent LMs are not suitable as a substitute for explicit KBs, but could play a major role for augmenting and curating KBs.
- Published
- 2021
23. Complex Temporal Question Answering on Knowledge Graphs
- Author
-
Jia, Zhen, Pramanik, Soumajit, Roy, Rishiraj Saha, and Weikum, Gerhard
- Subjects
Computer Science - Information Retrieval ,Computer Science - Computation and Language - Abstract
Question answering over knowledge graphs (KG-QA) is a vital topic in IR. Questions with temporal intent are a special class of practical importance, but have not received much attention in research. This work presents EXAQT, the first end-to-end system for answering complex temporal questions that have multiple entities and predicates, and associated temporal conditions. EXAQT answers natural language questions over KGs in two stages, one geared towards high recall, the other towards precision at top ranks. The first step computes question-relevant compact subgraphs within the KG, and judiciously enhances them with pertinent temporal facts, using Group Steiner Trees and fine-tuned BERT models. The second step constructs relational graph convolutional networks (R-GCNs) from the first step's output, and enhances the R-GCNs with time-aware entity embeddings and attention over temporal relations. We evaluate EXAQT on TimeQuestions, a large dataset of 16k temporal questions we compiled from a variety of general purpose KG-QA benchmarks. Results show that EXAQT outperforms three state-of-the-art systems for answering complex questions over KGs, thereby justifying specialized treatment of temporal QA., Comment: CIKM 2021 Long Paper, 11 pages
- Published
- 2021
- Full Text
- View/download PDF
24. You Get What You Chat: Using Conversations to Personalize Search-based Recommendations
- Author
-
Torbati, Ghazaleh Haratinezhad, Yates, Andrew, and Weikum, Gerhard
- Subjects
Computer Science - Information Retrieval - Abstract
Prior work on personalized recommendations has focused on exploiting explicit signals from user-specific queries, clicks, likes, and ratings. This paper investigates tapping into a different source of implicit signals of interests and tastes: online chats between users. The paper develops an expressive model and effective methods for personalizing search-based entity recommendations. User models derived from chats augment different methods for re-ranking entity answers for medium-grained queries. The paper presents specific techniques to enhance the user models by capturing domain-specific vocabularies and by entity-based expansion. Experiments are based on a collection of online chats from a controlled user study covering three domains: books, travel, food. We evaluate different configurations and compare chat-based user models against concise user profiles from questionnaires. Overall, these two variants perform on par in terms of NCDG@20, but each has advantages in certain domains.
- Published
- 2021
25. Personalized Entity Search by Sparse and Scrutable User Profiles
- Author
-
Torbati, Ghazaleh Haratinezhad, Yates, Andrew, and Weikum, Gerhard
- Subjects
Computer Science - Information Retrieval - Abstract
Prior work on personalizing web search results has focused on considering query-and-click logs to capture users individual interests. For product search, extensive user histories about purchases and ratings have been exploited. However, for general entity search, such as for books on specific topics or travel destinations with certain features, personalization is largely underexplored. In this paper, we address personalization of book search, as an exemplary case of entity search, by exploiting sparse user profiles obtained through online questionnaires. We devise and compare a variety of re-ranking methods based on language models or neural learning. Our experiments show that even very sparse information about individuals can enhance the effectiveness of the search results.
- Published
- 2021
26. Detecting and Mitigating Test-time Failure Risks via Model-agnostic Uncertainty Learning
- Author
-
Lahoti, Preethi, Gummadi, Krishna P., and Weikum, Gerhard
- Subjects
Computer Science - Machine Learning ,Computer Science - Information Retrieval ,Statistics - Machine Learning - Abstract
Reliably predicting potential failure risks of machine learning (ML) systems when deployed with production data is a crucial aspect of trustworthy AI. This paper introduces Risk Advisor, a novel post-hoc meta-learner for estimating failure risks and predictive uncertainties of any already-trained black-box classification model. In addition to providing a risk score, the Risk Advisor decomposes the uncertainty estimates into aleatoric and epistemic uncertainty components, thus giving informative insights into the sources of uncertainty inducing the failures. Consequently, Risk Advisor can distinguish between failures caused by data variability, data shifts and model limitations and advise on mitigation actions (e.g., collecting more data to counter data shift). Extensive experiments on various families of black-box classification models and on real-world and synthetic datasets covering common ML failure scenarios show that the Risk Advisor reliably predicts deployment-time failure risks in all the scenarios, and outperforms strong baselines., Comment: To appear in the 21st IEEE International Conference on Data Mining (ICDM 2021), Auckland, New Zealand
- Published
- 2021
27. UNIQORN: Unified Question Answering over RDF Knowledge Graphs and Natural Language Text
- Author
-
Pramanik, Soumajit, Alabi, Jesujoba, Roy, Rishiraj Saha, and Weikum, Gerhard
- Subjects
Computer Science - Information Retrieval ,Computer Science - Computation and Language ,H.3.3 - Abstract
Question answering over RDF data like knowledge graphs has been greatly advanced, with a number of good systems providing crisp answers for natural language questions or telegraphic queries. Some of these systems incorporate textual sources as additional evidence for the answering process, but cannot compute answers that are present in text alone. Conversely, the IR and NLP communities have addressed QA over text, but such systems barely utilize semantic data and knowledge. This paper presents a method for complex questions that can seamlessly operate over a mixture of RDF datasets and text corpora, or individual sources, in a unified framework. Our method, called UNIQORN, builds a context graph on-the-fly, by retrieving question-relevant evidences from the RDF data and/or a text corpus, using fine-tuned BERT models. The resulting graph typically contains all question-relevant evidences but also a lot of noise. UNIQORN copes with this input by a graph algorithm for Group Steiner Trees, that identifies the best answer candidates in the context graph. Experimental results on several benchmarks of complex questions with multiple entities and relations, show that UNIQORN significantly outperforms state-of-the-art methods for heterogeneous QA -- in a full training mode, as well as in zero-shot settings. The graph-based methodology provides user-interpretable evidence for the complete answering process., Comment: 27 pages
- Published
- 2021
28. Beyond NED: Fast and Effective Search Space Reduction for Complex Question Answering over Knowledge Bases
- Author
-
Christmann, Philipp, Roy, Rishiraj Saha, and Weikum, Gerhard
- Subjects
Computer Science - Information Retrieval ,Computer Science - Computation and Language - Abstract
Answering complex questions over knowledge bases (KB-QA) faces huge input data with billions of facts, involving millions of entities and thousands of predicates. For efficiency, QA systems first reduce the answer search space by identifying a set of facts that is likely to contain all answers and relevant cues. The most common technique for doing this is to apply named entity disambiguation (NED) systems to the question, and retrieve KB facts for the disambiguated entities. This work presents CLOCQ, an efficient method that prunes irrelevant parts of the search space using KB-aware signals. CLOCQ uses a top-k query processor over score-ordered lists of KB items that combine signals about lexical matching, relevance to the question, coherence among candidate items, and connectivity in the KB graph. Experiments with two recent QA benchmarks for complex questions demonstrate the superiority of CLOCQ over state-of-the-art baselines with respect to answer presence, size of the search space, and runtimes., Comment: WSDM 2022 Research Track Long Paper (Extended version)
- Published
- 2021
29. Inside ASCENT: Exploring a Deep Commonsense Knowledge Base and its Usage in Question Answering
- Author
-
Nguyen, Tuan-Phong, Razniewski, Simon, and Weikum, Gerhard
- Subjects
Computer Science - Artificial Intelligence ,Computer Science - Computation and Language - Abstract
ASCENT is a fully automated methodology for extracting and consolidating commonsense assertions from web contents (Nguyen et al., WWW 2021). It advances traditional triple-based commonsense knowledge representation by capturing semantic facets like locations and purposes, and composite concepts, i.e., subgroups and related aspects of subjects. In this demo, we present a web portal that allows users to understand its construction process, explore its content, and observe its impact in the use case of question answering. The demo website and an introductory video are both available online., Comment: Demo website: https://ascent.mpi-inf.mpg.de; introductory video: https://youtu.be/qMkJXqu_Yd4
- Published
- 2021
- Full Text
- View/download PDF
30. Reinforcement Learning from Reformulations in Conversational Question Answering over Knowledge Graphs
- Author
-
Kaiser, Magdalena, Roy, Rishiraj Saha, and Weikum, Gerhard
- Subjects
Computer Science - Information Retrieval ,Computer Science - Computation and Language - Abstract
The rise of personal assistants has made conversational question answering (ConvQA) a very popular mechanism for user-system interaction. State-of-the-art methods for ConvQA over knowledge graphs (KGs) can only learn from crisp question-answer pairs found in popular benchmarks. In reality, however, such training data is hard to come by: users would rarely mark answers explicitly as correct or wrong. In this work, we take a step towards a more natural learning paradigm - from noisy and implicit feedback via question reformulations. A reformulation is likely to be triggered by an incorrect system response, whereas a new follow-up question could be a positive signal on the previous turn's answer. We present a reinforcement learning model, termed CONQUER, that can learn from a conversational stream of questions and reformulations. CONQUER models the answering process as multiple agents walking in parallel on the KG, where the walks are determined by actions sampled using a policy network. This policy network takes the question along with the conversational context as inputs and is trained via noisy rewards obtained from the reformulation likelihood. To evaluate CONQUER, we create and release ConvRef, a benchmark with about 11k natural conversations containing around 205k reformulations. Experiments show that CONQUER successfully learns to answer conversational questions from noisy reward signals, significantly improving over a state-of-the-art baseline., Comment: SIGIR 2021 Long Paper, 11 pages
- Published
- 2021
- Full Text
- View/download PDF
31. ELIXIR: Learning from User Feedback on Explanations to Improve Recommender Models
- Author
-
Ghazimatin, Azin, Pramanik, Soumajit, Roy, Rishiraj Saha, and Weikum, Gerhard
- Subjects
Computer Science - Information Retrieval ,Computer Science - Artificial Intelligence ,Computer Science - Machine Learning - Abstract
System-provided explanations for recommendations are an important component towards transparent and trustworthy AI. In state-of-the-art research, this is a one-way signal, though, to improve user acceptance. In this paper, we turn the role of explanations around and investigate how they can contribute to enhancing the quality of the generated recommendations themselves. We devise a human-in-the-loop framework, called ELIXIR, where user feedback on explanations is leveraged for pairwise learning of user preferences. ELIXIR leverages feedback on pairs of recommendations and explanations to learn user-specific latent preference vectors, overcoming sparseness by label propagation with item-similarity-based neighborhoods. Our framework is instantiated using generalized graph recommendation via Random Walk with Restart. Insightful experiments with a real user study show significant improvements in movie and book recommendations over item-level feedback., Comment: WWW 2021, 11 pages
- Published
- 2021
- Full Text
- View/download PDF
32. Cross-Domain Learning for Classifying Propaganda in Online Contents
- Author
-
Wang, Liqiang, Shen, Xiaoyu, de Melo, Gerard, and Weikum, Gerhard
- Subjects
Computer Science - Computation and Language - Abstract
As news and social media exhibit an increasing amount of manipulative polarized content, detecting such propaganda has received attention as a new task for content analysis. Prior work has focused on supervised learning with training data from the same domain. However, as propaganda can be subtle and keeps evolving, manual identification and proper labeling are very demanding. As a consequence, training data is a major bottleneck. In this paper, we tackle this bottleneck and present an approach to leverage cross-domain learning, based on labeled documents and sentences from news and tweets, as well as political speeches with a clear difference in their degrees of being propagandistic. We devise informative features and build various classifiers for propaganda labeling, using cross-domain learning. Our experiments demonstrate the usefulness of this approach, and identify difficulties and limitations in various configurations of sources and targets for the transfer step. We further analyze the influence of various features, and characterize salient indicators of propaganda., Comment: TTO 2020
- Published
- 2020
33. Advanced Semantics for Commonsense Knowledge Extraction
- Author
-
Nguyen, Tuan-Phong, Razniewski, Simon, and Weikum, Gerhard
- Subjects
Computer Science - Artificial Intelligence ,Computer Science - Computation and Language - Abstract
Commonsense knowledge (CSK) about concepts and their properties is useful for AI applications such as robust chatbots. Prior works like ConceptNet, TupleKB and others compiled large CSK collections, but are restricted in their expressiveness to subject-predicate-object (SPO) triples with simple concepts for S and monolithic strings for P and O. Also, these projects have either prioritized precision or recall, but hardly reconcile these complementary goals. This paper presents a methodology, called Ascent, to automatically build a large-scale knowledge base (KB) of CSK assertions, with advanced expressiveness and both better precision and recall than prior works. Ascent goes beyond triples by capturing composite concepts with subgroups and aspects, and by refining assertions with semantic facets. The latter are important to express temporal and spatial validity of assertions and further qualifiers. Ascent combines open information extraction with judicious cleaning using language models. Intrinsic evaluation shows the superior size and quality of the Ascent KB, and an extrinsic evaluation for QA-support tasks underlines the benefits of Ascent. A web interface, data and code can be found at https://ascent.mpi-inf.mpg.de/., Comment: 12 pages, 3 figures, 11 tables
- Published
- 2020
- Full Text
- View/download PDF
34. Responsible model deployment via model-agnostic uncertainty learning
- Author
-
Lahoti, Preethi, Gummadi, Krishna, and Weikum, Gerhard
- Published
- 2023
- Full Text
- View/download PDF
35. Machine Knowledge: Creation and Curation of Comprehensive Knowledge Bases
- Author
-
Weikum, Gerhard, Dong, Luna, Razniewski, Simon, and Suchanek, Fabian
- Subjects
Computer Science - Artificial Intelligence ,Computer Science - Databases - Abstract
Equipping machines with comprehensive knowledge of the world's entities and their relationships has been a long-standing goal of AI. Over the last decade, large-scale knowledge bases, also known as knowledge graphs, have been automatically constructed from web contents and text sources, and have become a key asset for search engines. This machine knowledge can be harnessed to semantically interpret textual phrases in news, social media and web tables, and contributes to question answering, natural language processing and data analytics. This article surveys fundamental concepts and practical methods for creating and curating large knowledge bases. It covers models and methods for discovering and canonicalizing entities and their semantic types and organizing them into clean taxonomies. On top of this, the article discusses the automatic extraction of entity-centric properties. To support the long-term life-cycle and the quality assurance of machine knowledge, the article presents methods for constructing open schemas and for knowledge curation. Case studies on academic projects and industrial knowledge graphs complement the survey of concepts and methods., Comment: Submitted to Foundations and Trends in Databases
- Published
- 2020
36. CounQER: A System for Discovering and Linking Count Information in Knowledge Bases
- Author
-
Ghosh, Shrestha, Razniewski, Simon, and Weikum, Gerhard
- Subjects
Computer Science - Information Retrieval ,Computer Science - Artificial Intelligence ,Computer Science - Databases - Abstract
Predicate constraints of general-purpose knowledge bases (KBs) like Wikidata, DBpedia and Freebase are often limited to subproperty, domain and range constraints. In this demo we showcase CounQER, a system that illustrates the alignment of counting predicates, like staffSize, and enumerating predicates, like workInstitution^{-1} . In the demonstration session, attendees can inspect these alignments, and will learn about the importance of these alignments for KB question answering and curation. CounQER is available at https://counqer.mpi-inf.mpg.de/spo., Comment: Accepted at ESWC 2020
- Published
- 2020
37. Conversational Question Answering over Passages by Leveraging Word Proximity Networks
- Author
-
Kaiser, Magdalena, Roy, Rishiraj Saha, and Weikum, Gerhard
- Subjects
Computer Science - Information Retrieval ,Computer Science - Computation and Language - Abstract
Question answering (QA) over text passages is a problem of long-standing interest in information retrieval. Recently, the conversational setting has attracted attention, where a user asks a sequence of questions to satisfy her information needs around a topic. While this setup is a natural one and similar to humans conversing with each other, it introduces two key research challenges: understanding the context left implicit by the user in follow-up questions, and dealing with ad hoc question formulations. In this work, we demonstrate CROWN (Conversational passage ranking by Reasoning Over Word Networks): an unsupervised yet effective system for conversational QA with passage responses, that supports several modes of context propagation over multiple turns. To this end, CROWN first builds a word proximity network (WPN) from large corpora to store statistically significant term co-occurrences. At answering time, passages are ranked by a combination of their similarity to the question, and coherence of query terms within: these factors are measured by reading off node and edge weights from the WPN. CROWN provides an interface that is both intuitive for end-users, and insightful for experts for reconfiguration to individual setups. CROWN was evaluated on TREC CAsT data, where it achieved above-median performance in a pool of neural methods., Comment: SIGIR 2020 Demonstrations
- Published
- 2020
38. Uncovering Hidden Semantics of Set Information in Knowledge Bases
- Author
-
Ghosh, Shrestha, Razniewski, Simon, and Weikum, Gerhard
- Subjects
Computer Science - Databases ,Computer Science - Information Retrieval - Abstract
Knowledge Bases (KBs) contain a wealth of structured information about entities and predicates. This paper focuses on set-valued predicates, i.e., the relationship between an entity and a set of entities. In KBs, this information is often represented in two formats: (i) via counting predicates such as numberOfChildren and staffSize, that store aggregated integers, and (ii) via enumerating predicates such as parentOf and worksFor, that store individual set memberships. Both formats are typically complementary: unlike enumerating predicates, counting predicates do not give away individuals, but are more likely informative towards the true set size, thus this coexistence could enable interesting applications in question answering and KB curation. In this paper we aim at uncovering this hidden knowledge. We proceed in two steps. (i) We identify set-valued predicates from a given KB predicates via statistical and embedding-based features. (ii) We link counting predicates and enumerating predicates by a combination of co-occurrence, correlation and textual relatedness metrics. We analyze the prevalence of count information in four prominent knowledge bases, and show that our linking method achieves up to 0.55 F1 score in set predicate identification versus 0.40 F1 score of a random selection, and normalized discounted gains of up to 0.84 at position 1 and 0.75 at position 3 in relevant predicate alignments. Our predicate alignments are showcased in a demonstration system available at https://counqer.mpi-inf.mpg.de/spo., Comment: This work is under review in the Journal of Web Semantics, Special Issue on Language Technology and Knowledge Graphs. This is a revision draft
- Published
- 2020
39. Negative Statements Considered Useful
- Author
-
Arnaout, Hiba, Razniewski, Simon, Weikum, Gerhard, and Pan, Jeff Z.
- Subjects
Computer Science - Information Retrieval ,Computer Science - Artificial Intelligence ,Computer Science - Computation and Language ,Computer Science - Databases - Abstract
Knowledge bases (KBs) about notable entities and their properties are an important asset in applications such as search, question answering and dialogue. All popular KBs capture virtually only positive statements, and abstain from taking any stance on statements not stored in the KB. This paper makes the case for explicitly stating salient statements that do not hold. Negative statements are useful to overcome limitations of question answering systems that are mainly geared for positive questions; they can also contribute to informative summaries of entities. Due to the abundance of such invalid statements, any effort to compile them needs to address ranking by saliency. We present a statisticalinference method for compiling and ranking negative statements, based on expectations from positive statements of related entities in peer groups. Experimental results, with a variety of datasets, show that the method can effectively discover notable negative statements, and extrinsic studies underline their usefulness for entity summarization. Datasets and code are released as resources for further research.
- Published
- 2020
- Full Text
- View/download PDF
40. Joint Reasoning for Multi-Faceted Commonsense Knowledge
- Author
-
Chalier, Yohan, Razniewski, Simon, and Weikum, Gerhard
- Subjects
Computer Science - Computation and Language ,Computer Science - Artificial Intelligence ,Computer Science - Information Retrieval - Abstract
Commonsense knowledge (CSK) supports a variety of AI applications, from visual understanding to chatbots. Prior works on acquiring CSK, such as ConceptNet, have compiled statements that associate concepts, like everyday objects or activities, with properties that hold for most or some instances of the concept. Each concept is treated in isolation from other concepts, and the only quantitative measure (or ranking) of properties is a confidence score that the statement is valid. This paper aims to overcome these limitations by introducing a multi-faceted model of CSK statements and methods for joint reasoning over sets of inter-related statements. Our model captures four different dimensions of CSK statements: plausibility, typicality, remarkability and salience, with scoring and ranking along each dimension. For example, hyenas drinking water is typical but not salient, whereas hyenas eating carcasses is salient. For reasoning and ranking, we develop a method with soft constraints, to couple the inference over concepts that are related in in a taxonomic hierarchy. The reasoning is cast into an integer linear programming (ILP), and we leverage the theory of reduction costs of a relaxed LP to compute informative rankings. This methodology is applied to several large CSK collections. Our evaluation shows that we can consolidate these inputs into much cleaner and more expressive knowledge. Results are available at https://dice.mpi-inf.mpg.de., Comment: 11 pages
- Published
- 2020
41. PRINCE: Provider-side Interpretability with Counterfactual Explanations in Recommender Systems
- Author
-
Ghazimatin, Azin, Balalau, Oana, Roy, Rishiraj Saha, and Weikum, Gerhard
- Subjects
Computer Science - Machine Learning ,Computer Science - Artificial Intelligence ,Statistics - Machine Learning - Abstract
Interpretable explanations for recommender systems and other machine learning models are crucial to gain user trust. Prior works that have focused on paths connecting users and items in a heterogeneous network have several limitations, such as discovering relationships rather than true explanations, or disregarding other users' privacy. In this work, we take a fresh perspective, and present PRINCE: a provider-side mechanism to produce tangible explanations for end-users, where an explanation is defined to be a set of minimal actions performed by the user that, if removed, changes the recommendation to a different item. Given a recommendation, PRINCE uses a polynomial-time optimal algorithm for finding this minimal set of a user's actions from an exponential search space, based on random walks over dynamic graphs. Experiments on two real-world datasets show that PRINCE provides more compact explanations than intuitive baselines, and insights from a crowdsourced user-study demonstrate the viability of such action-based explanations. We thus posit that PRINCE produces scrutable, actionable, and concise explanations, owing to its use of counterfactual evidence, a user's own actions, and minimal sets, respectively., Comment: WSDM 2020, 9 pages
- Published
- 2019
- Full Text
- View/download PDF
42. CROWN: Conversational Passage Ranking by Reasoning over Word Networks
- Author
-
Kaiser, Magdalena, Roy, Rishiraj Saha, and Weikum, Gerhard
- Subjects
Computer Science - Information Retrieval ,Computer Science - Computation and Language - Abstract
Information needs around a topic cannot be satisfied in a single turn; users typically ask follow-up questions referring to the same theme and a system must be capable of understanding the conversational context of a request to retrieve correct answers. In this paper, we present our submission to the TREC Conversational Assistance Track 2019, in which such a conversational setting is explored. We propose a simple unsupervised method for conversational passage ranking by formulating the passage score for a query as a combination of similarity and coherence. To be specific, passages are preferred that contain words semantically similar to the words used in the question, and where such words appear close by. We built a word-proximity network (WPN) from a large corpus, where words are nodes and there is an edge between two nodes if they co-occur in the same passages in a statistically significant way, within a context window. Our approach, named CROWN, improved nDCG scores over a provided Indri baseline on the CAsT training data. On the evaluation data for CAsT, our best run submission achieved above-average performance with respect to AP@5 and nDCG@1000., Comment: TREC 2019, 14 pages
- Published
- 2019
43. STANCY: Stance Classification Based on Consistency Cues
- Author
-
Popat, Kashyap, Mukherjee, Subhabrata, Yates, Andrew, and Weikum, Gerhard
- Subjects
Computer Science - Computation and Language ,Computer Science - Artificial Intelligence ,Computer Science - Machine Learning - Abstract
Controversial claims are abundant in online media and discussion forums. A better understanding of such claims requires analyzing them from different perspectives. Stance classification is a necessary step for inferring these perspectives in terms of supporting or opposing the claim. In this work, we present a neural network model for stance classification leveraging BERT representations and augmenting them with a novel consistency constraint. Experiments on the Perspectrum dataset, consisting of claims and users' perspectives from various debate websites, demonstrate the effectiveness of our approach over state-of-the-art baselines., Comment: Accepted at EMNLP 2019
- Published
- 2019
44. Look before you Hop: Conversational Question Answering over Knowledge Graphs Using Judicious Context Expansion
- Author
-
Christmann, Philipp, Roy, Rishiraj Saha, Abujabal, Abdalghani, Singh, Jyotsna, and Weikum, Gerhard
- Subjects
Computer Science - Information Retrieval ,Computer Science - Computation and Language - Abstract
Fact-centric information needs are rarely one-shot; users typically ask follow-up questions to explore a topic. In such a conversational setting, the user's inputs are often incomplete, with entities or predicates left out, and ungrammatical phrases. This poses a huge challenge to question answering (QA) systems that typically rely on cues in full-fledged interrogative sentences. As a solution, we develop CONVEX: an unsupervised method that can answer incomplete questions over a knowledge graph (KG) by maintaining conversation context using entities and predicates seen so far and automatically inferring missing or ambiguous pieces for follow-up questions. The core of our method is a graph exploration algorithm that judiciously expands a frontier to find candidate answers for the current question. To evaluate CONVEX, we release ConvQuestions, a crowdsourced benchmark with 11,200 distinct conversations from five different domains. We show that CONVEX: (i) adds conversational support to any stand-alone QA system, and (ii) outperforms state-of-the-art baselines and question completion strategies., Comment: CIKM 2019 Long Paper, 10 pages
- Published
- 2019
- Full Text
- View/download PDF
45. Evaluating Language Models for Knowledge Base Completion
- Author
-
Veseli, Blerta, primary, Singhania, Sneha, additional, Razniewski, Simon, additional, and Weikum, Gerhard, additional
- Published
- 2023
- Full Text
- View/download PDF
46. Know2Look: Commonsense Knowledge for Visual Search
- Author
-
Chowdhury, Sreyasi Nag, Tandon, Niket, and Weikum, Gerhard
- Subjects
Computer Science - Information Retrieval - Abstract
With the rise in popularity of social media, images accompanied by contextual text form a huge section of the web. However, search and retrieval of documents are still largely dependent on solely textual cues. Although visual cues have started to gain focus, the imperfection in object/scene detection do not lead to significantly improved results. We hypothesize that the use of background commonsense knowledge on query terms can significantly aid in retrieval of documents with associated images. To this end we deploy three different modalities - text, visual cues, and commonsense knowledge pertaining to the query - as a recipe for efficient search and retrieval., Comment: Published in AKBC 2016
- Published
- 2019
47. VISIR: Visual and Semantic Image Label Refinement
- Author
-
Chowdhury, Sreyasi Nag, Tandon, Niket, Ferhatosmanoglu, Hakan, and Weikum, Gerhard
- Subjects
Computer Science - Multimedia ,Computer Science - Computer Vision and Pattern Recognition ,Computer Science - Information Retrieval - Abstract
The social media explosion has populated the Internet with a wealth of images. There are two existing paradigms for image retrieval: 1) content-based image retrieval (CBIR), which has traditionally used visual features for similarity search (e.g., SIFT features), and 2) tag-based image retrieval (TBIR), which has relied on user tagging (e.g., Flickr tags). CBIR now gains semantic expressiveness by advances in deep-learning-based detection of visual labels. TBIR benefits from query-and-click logs to automatically infer more informative labels. However, learning-based tagging still yields noisy labels and is restricted to concrete objects, missing out on generalizations and abstractions. Click-based tagging is limited to terms that appear in the textual context of an image or in queries that lead to a click. This paper addresses the above limitations by semantically refining and expanding the labels suggested by learning-based object detection. We consider the semantic coherence between the labels for different objects, leverage lexical and commonsense knowledge, and cast the label assignment into a constrained optimization problem solved by an integer linear program. Experiments show that our method, called VISIR, improves the quality of the state-of-the-art visual labeling tools like LSDA and YOLO., Comment: Published in WSDM 2018
- Published
- 2019
- Full Text
- View/download PDF
48. Story-oriented Image Selection and Placement
- Author
-
Chowdhury, Sreyasi Nag, Razniewski, Simon, and Weikum, Gerhard
- Subjects
Computer Science - Computation and Language - Abstract
Multimodal contents have become commonplace on the Internet today, manifested as news articles, social media posts, and personal or business blog posts. Among the various kinds of media (images, videos, graphics, icons, audio) used in such multimodal stories, images are the most popular. The selection of images from a collection - either author's personal photo album, or web repositories - and their meticulous placement within a text, builds a succinct multimodal commentary for digital consumption. In this paper we present a system that automates the process of selecting relevant images for a story and placing them at contextual paragraphs within the story for a multimodal narration. We leverage automatic object recognition, user-provided tags, and commonsense knowledge, and use an unsupervised combinatorial optimization to solve the selection and placement problems seamlessly as a single unit.
- Published
- 2019
49. TEQUILA: Temporal Question Answering over Knowledge Bases
- Author
-
Jia, Zhen, Abujabal, Abdalghani, Roy, Rishiraj Saha, Stroetgen, Jannik, and Weikum, Gerhard
- Subjects
Computer Science - Information Retrieval ,Computer Science - Computation and Language - Abstract
Question answering over knowledge bases (KB-QA) poses challenges in handling complex questions that need to be decomposed into sub-questions. An important case, addressed here, is that of temporal questions, where cues for temporal relations need to be discovered and handled. We present TEQUILA, an enabler method for temporal QA that can run on top of any KB-QA engine. TEQUILA has four stages. It detects if a question has temporal intent. It decomposes and rewrites the question into non-temporal sub-questions and temporal constraints. Answers to sub-questions are then retrieved from the underlying KB-QA engine. Finally, TEQUILA uses constraint reasoning on temporal intervals to compute final answers to the full question. Comparisons against state-of-the-art baselines show the viability of our method., Comment: CIKM 2018 Short Paper
- Published
- 2019
- Full Text
- View/download PDF
50. FAIRY: A Framework for Understanding Relationships between Users' Actions and their Social Feeds
- Author
-
Ghazimatin, Azin, Roy, Rishiraj Saha, and Weikum, Gerhard
- Subjects
Computer Science - Social and Information Networks ,Computer Science - Machine Learning ,Statistics - Machine Learning - Abstract
Users increasingly rely on social media feeds for consuming daily information. The items in a feed, such as news, questions, songs, etc., usually result from the complex interplay of a user's social contacts, her interests and her actions on the platform. The relationship of the user's own behavior and the received feed is often puzzling, and many users would like to have a clear explanation on why certain items were shown to them. Transparency and explainability are key concerns in the modern world of cognitive overload, filter bubbles, user tracking, and privacy risks. This paper presents FAIRY, a framework that systematically discovers, ranks, and explains relationships between users' actions and items in their social media feeds. We model the user's local neighborhood on the platform as an interaction graph, a form of heterogeneous information network constructed solely from information that is easily accessible to the concerned user. We posit that paths in this interaction graph connecting the user and her feed items can act as pertinent explanations for the user. These paths are scored with a learning-to-rank model that captures relevance and surprisal. User studies on two social platforms demonstrate the practical viability and user benefits of the FAIRY method., Comment: WSDM 2019
- Published
- 2019
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.