skip to main content
10.1145/3529399.3529428acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicmltConference Proceedingsconference-collections
research-article

Graph-based Similarity for Document Retrieval in the Biomedical Domain

Authors Info & Claims
Published:10 June 2022Publication History

ABSTRACT

The growing amount of available data in the biomedical domain turns out to be beneficial for decision-making, but a sufficiently accurate DR system is required. Plenty of NLP techniques and models have been proposed for semantic similarity in DR, but few of them have been able to consider the variations of the language and relationship between distant words in texts. This work is focused on formulating a Graph-based Similarity for DR method (GBS-DR) for the biomedical domain and comparing the obtained results with traditional DR paradigms. The graph-based methods were selected to prove the importance of analyzing the semantic, syntactic, and long-distant word relationships in texts. It will be demonstrated that through the graph's topology the system can extract the structural information of documents, which solves relevant issues that are faced in this research area.

CCS CONCEPTS • Information Systems • Information Retrieval • Retrieval Models and Ranking • Learning to Rank

References

  1. V.Boteva, D.Gholipour, A.Sokolov, and S.Riezler. “Full-Text Learning to Rank Dataset for Medical Information Retrieval”(2016)Google ScholarGoogle Scholar
  2. S.Zhao, C.Su, A.Sboner and F.Wang. “GRAPHENE: A Precise Biomedical Literature Retrieval Engine with Graph Augmented Deep Learning and External Knowledge Empowerment” (2019)Google ScholarGoogle Scholar
  3. G.Brokos, P.Malakasiotis and I.Androutsopoulos., “Using Centroids of Word Embeddings and Word Mover's Distance for Biomedical Document Retrieval in Question Answering” (2016).Google ScholarGoogle Scholar
  4. T.Zhang, B.Liu, D.Niu, K.Lai and Y.Xu. “Multiresolution Graph Attention Networks for Relevance Matching” (2018)Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. T. Mikolov, K. Chen, G. Corrado and J. Dean, Efficient Estimation of Word Representations in Vector Space” (2013) International Conference on Learning Representations (2013)Google ScholarGoogle Scholar
  6. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A. N., Kaiser, Ł. & Polosukhin, I. (2017). Attention is all you need. Advances in Neural Information Processing Systems (p./pp. 5998–6008)Google ScholarGoogle Scholar
  7. X.Yu,W.Xu, Z.Cui and S.Wu1,L.Wang “Graph-based Hierarchical Relevance Matching Signals for Ad-hoc Retrieval” (2021)Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. J.Frej, J.Chevallet, D.Schwab, “Knowledge Based Transformer Model for Information Retrieval” Joint Conference of the Information Retrieval Communities in Europe (CIRCLE 2020), (2020), Samatan, France. ffhal-03263784fGoogle ScholarGoogle Scholar
  9. M. Zuckerman and M.Last “Using Graphs for Word Embedding with En-hanced Semantic Relations” (2019)Google ScholarGoogle Scholar
  10. K.M. Svore and C. J. C. Burges “A Machine Learning Approach for Improved BM25 Retrieval” (2009)Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. T.Tan “Evolution of Language Models: N-Grams, Word Embeddings, Attention & Transformers” (2020)Google ScholarGoogle Scholar
  12. C.Nicholson. “A Beginner's Guide to Attention Mechanisms and Memory Networks” (2019)Google ScholarGoogle Scholar

Index Terms

  1. Graph-based Similarity for Document Retrieval in the Biomedical Domain
        Index terms have been assigned to the content through auto-classification.

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Other conferences
          ICMLT '22: Proceedings of the 2022 7th International Conference on Machine Learning Technologies
          March 2022
          291 pages
          ISBN:9781450395748
          DOI:10.1145/3529399

          Copyright © 2022 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 10 June 2022

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article
          • Research
          • Refereed limited
        • Article Metrics

          • Downloads (Last 12 months)13
          • Downloads (Last 6 weeks)0

          Other Metrics

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        HTML Format

        View this article in HTML Format .

        View HTML Format