Ranking Narrative Query Graphs for Biomedical Document Retrieval (Technical Report)

• URL: http://arxiv.org/abs/2412.15232v1
• Date: Fri, 06 Dec 2024 12:49:28 GMT
• Title: Ranking Narrative Query Graphs for Biomedical Document Retrieval (Technical Report)
• Authors: Hermann Kroll, Pascal Sackhoff, Timo Breuer, Ralf Schenkel, Wolf-Tilo Balke,
• Abstract summary: This paper extends our existing graph-based discovery system for the biomedical domain. It contributes effective graph-based unsupervised ranking methods, a new query relaxation paradigm, and ontological rewriting.
• Score: 7.527096697768715
• License:
• Abstract: Keyword-based searches are today's standard in digital libraries. Yet, complex retrieval scenarios like in scientific knowledge bases, need more sophisticated access paths. Although each document somewhat contributes to a domain's body of knowledge, the exact structure between keywords, i.e., their possible relationships, and the contexts spanned within each single document will be crucial for effective retrieval. Following this logic, individual documents can be seen as small-scale knowledge graphs on which graph queries can provide focused document retrieval. We implemented a full-fledged graph-based discovery system for the biomedical domain and demonstrated its benefits in the past. Unfortunately, graph-based retrieval methods generally follow an 'exact match' paradigm, which severely hampers search efficiency, since exact match results are hard to rank by relevance. This paper extends our existing discovery system and contributes effective graph-based unsupervised ranking methods, a new query relaxation paradigm, and ontological rewriting. These extensions improve the system further so that users can retrieve results with higher precision and higher recall due to partial matching and ontological rewriting.

Related papers

• ReTreever: Tree-based Coarse-to-Fine Representations for Retrieval [64.44265315244579]
  We propose a tree-based method for organizing and representing reference documents at various granular levels. Our method, called ReTreever, jointly learns a routing function per internal node of a binary tree such that query and reference documents are assigned to similar tree branches. Our evaluations show that ReTreever generally preserves full representation accuracy.
  arXiv  Detail & Related papers  (2025-02-11T21:35:13Z)
• CG-RAG: Research Question Answering by Citation Graph Retrieval-Augmented LLMs [9.718354494802002]
  Contextualized Graph Retrieval-Augmented Generation (CG-RAG) is a novel framework that integrates sparse and dense retrieval signals within graph structures. First, we propose a contextual graph representation for citation graphs, effectively capturing both explicit and implicit connections within and across documents. Second, we introduce Lexical-Semantic Graph Retrieval (LeSeGR), which seamlessly integrates sparse and dense retrieval signals with graph encoding. Third, we present a context-aware generation strategy that utilizes the retrieved graph-structured information to generate precise and contextually enriched responses.
  arXiv  Detail & Related papers  (2025-01-25T04:18:08Z)
• Generative Retrieval for Book search [106.67655212825025]
  We propose an effective Generative retrieval framework for Book Search. It features two main components: data augmentation and outline-oriented book encoding. Experiments on a proprietary Baidu dataset demonstrate that GBS outperforms strong baselines.
  arXiv  Detail & Related papers  (2025-01-19T12:57:13Z)
• G-RAG: Knowledge Expansion in Material Science [0.0]
  Graph RAG integrates graph databases to enhance the retrieval process. We implement an agent-based parsing technique to achieve a more detailed representation of the documents.
  arXiv  Detail & Related papers  (2024-11-21T21:22:58Z)
• PseudoSeer: a Search Engine for Pseudocode [18.726136894285403]
  A novel pseudocode search engine is designed to facilitate efficient retrieval and search of academic papers containing pseudocode. By leveraging snippets, the system enables users to search across various facets of a paper, such as the title, abstract, author information, and code snippets. A weighted BM25-based ranking algorithm is used by the search engine, and factors considered when prioritizing search results are described.
  arXiv  Detail & Related papers  (2024-11-19T16:58:03Z)
• Taxonomy-guided Semantic Indexing for Academic Paper Search [51.07749719327668]
  TaxoIndex is a semantic index framework for academic paper search. It organizes key concepts from papers as a semantic index guided by an academic taxonomy. It can be flexibly employed to enhance existing dense retrievers.
  arXiv  Detail & Related papers  (2024-10-25T00:00:17Z)
• Conversational Exploratory Search of Scholarly Publications Using Knowledge Graphs [3.3916160303055567]
  We develop a conversational search system for exploring scholarly publications using a knowledge graph. To assess the system's effectiveness, we employed various performance metrics and conducted a human evaluation with 40 participants.
  arXiv  Detail & Related papers  (2024-10-01T06:16:07Z)
• Query-oriented Data Augmentation for Session Search [71.84678750612754]
  We propose query-oriented data augmentation to enrich search logs and empower the modeling. We generate supplemental training pairs by altering the most important part of a search context. We develop several strategies to alter the current query, resulting in new training data with varying degrees of difficulty.
  arXiv  Detail & Related papers  (2024-07-04T08:08:33Z)
• DiscoverPath: A Knowledge Refinement and Retrieval System for Interdisciplinarity on Biomedical Research [96.10765714077208]
  Traditional keyword-based search engines fall short in assisting users who may not be familiar with specific terminologies. We present a knowledge graph-based paper search engine for biomedical research to enhance the user experience. The system, dubbed DiscoverPath, employs Named Entity Recognition (NER) and part-of-speech (POS) tagging to extract terminologies and relationships from article abstracts to create a KG.
  arXiv  Detail & Related papers  (2023-09-04T20:52:33Z)
• Autoregressive Search Engines: Generating Substrings as Document Identifiers [53.0729058170278]
  Autoregressive language models are emerging as the de-facto standard for generating answers. Previous work has explored ways to partition the search space into hierarchical structures. In this work we propose an alternative that doesn't force any structure in the search space: using all ngrams in a passage as its possible identifiers.
  arXiv  Detail & Related papers  (2022-04-22T10:45:01Z)
• CODER: An efficient framework for improving retrieval through COntextualized Document Embedding Reranking [11.635294568328625]
  We present a framework for improving the performance of a wide class of retrieval models at minimal computational cost. It utilizes precomputed document representations extracted by a base dense retrieval method. It incurs a negligible computational overhead on top of any first-stage method at run time, allowing it to be easily combined with any state-of-the-art dense retrieval method.
  arXiv  Detail & Related papers  (2021-12-16T10:25:26Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.