Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Sharat Israni

dblp:254/3412 · DBLP profile ↗
← Back
6ranked-venue papers
0as first author
5since 2021 · last 2024
0000-0003-0100-5826ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 4 · 3 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
3 papers
Bioinformatics and computational biology · 59% Medical and health informatics · 41%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%
Databases, data mining, and information retrieval
2 papers
Knowledge graphs · 81% Data mining · 19%

Topics — the 13 heaviest of 14, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › knowledge representation in biology
biomedical knowledge graph
1.422024
Biomedical knowledge graph-optimized prompt generation for large language models · Bioinform. 2024
The scalable precision medicine open knowledge engine (SPOKE): a massive knowledge graph of biomedical information · Bioinform. 2023
Bioinformatics and computational biology
knowledge graph
0.922024
The scalable precision medicine open knowledge engine (SPOKE): a massive knowledge graph of biomedical information · Bioinform. 2023
Biomedical knowledge graph-optimized prompt generation for large language models · Bioinform. 2024
Bioinformatics and computational biology › biomedical text mining
biomedical question answering
0.812024
Biomedical knowledge graph-optimized prompt generation for large language models · Bioinform. 2024
Medical and health informatics
retrieval-augmented generation
0.812024
Biomedical knowledge graph-optimized prompt generation for large language models · Bioinform. 2024
Bioinformatics and computational biology › data integration
biomedical data integration
0.712023
The scalable precision medicine open knowledge engine (SPOKE): a massive knowledge graph of biomedical information · Bioinform. 2023
Medical and health informatics
precision medicine
0.712023
The scalable precision medicine open knowledge engine (SPOKE): a massive knowledge graph of biomedical information · Bioinform. 2023
Parallel and multicore computing › parallel algorithms › graph algorithms
all-pairs shortest paths
0.612022
Exaflops Biomedical Knowledge Graph Analytics · SC 2022
Parallel and multicore computing
graph processing
0.612022
Exaflops Biomedical Knowledge Graph Analytics · SC 2022
Medical and health informatics
electronic health records
0.412019
PatientExploreR: an extensible application for dynamic visualization of patient clinical history from electronic health records in the OMOP common data model · Bioinform. 2019
Medical and health informatics
medical visualization
0.412019
PatientExploreR: an extensible application for dynamic visualization of patient clinical history from electronic health records in the OMOP common data model · Bioinform. 2019
Medical and health informatics › clinical text processing
patient history analysis
0.412019
PatientExploreR: an extensible application for dynamic visualization of patient clinical history from electronic health records in the OMOP common data model · Bioinform. 2019
Knowledge graphs › domain-specific knowledge graph
biomedical knowledge graph
0.212022
Exaflops Biomedical Knowledge Graph Analytics · SC 2022
Data mining › structured data mining
relational data mining
0.212022
Exaflops Biomedical Knowledge Graph Analytics · SC 2022

Methods — techniques the papers use, named apart from their topics

tropical semiring · 1.1hyperbolic performance modeling · 1.1retrieval-augmented generation · 0.8large language model · 0.8embedding-based context pruning · 0.8ontology-based integration · 0.7REST API · 0.7r shiny · 0.4
YearPublicationVenuePosition
2024 Biomedical knowledge graph-optimized prompt generation for large language models
abstract
MOTIVATION: Large language models (LLMs) are being adopted at an unprecedented rate, yet still face challenges in knowledge-intensive domains such as biomedicine. Solutions such as pretraining and domain-specific fine-tuning add substantial computational overhead, requiring further domain-expertise. Here, we introduce a token-optimized and robust Knowledge Graph-based Retrieval Augmented Generation (KG-RAG) framework by leveraging a massive biomedical KG (SPOKE) with LLMs such as Llama-2-13b, GPT-3.5-Turbo, and GPT-4, to generate meaningful biomedical text rooted in established knowledge. RESULTS: Compared to the existing RAG technique for Knowledge Graphs, the proposed method utilizes minimal graph schema for context extraction and uses embedding methods for context pruning. This optimization in context extraction results in more than 50% reduction in token consumption without compromising the accuracy, making a cost-effective and robust RAG implementation on proprietary LLMs. KG-RAG consistently enhanced the performance of LLMs across diverse biomedical prompts by generating responses rooted in established knowledge, accompanied by accurate provenance and statistical evidence (if available) to substantiate the claims. Further benchmarking on human curated datasets, such as biomedical true/false and multiple-choice questions (MCQ), showed a remarkable 71% boost in the performance of the Llama-2 model on the challenging MCQ dataset, demonstrating the framework's capacity to empower open-source models with fewer parameters for domain-specific questions. Furthermore, KG-RAG enhanced the performance of proprietary GPT models, such as GPT-3.5 and GPT-4. In summary, the proposed framework combines explicit and implicit knowledge of KG and LLM in a token optimized fashion, thus enhancing the adaptability of general-purpose LLMs to tackle domain-specific questions in a cost-effective fashion. AVAILABILITY AND IMPLEMENTATION: SPOKE KG can be accessed at https://spoke.rbvi.ucsf.edu/neighborhood.html. It can also be accessed using REST-API (https://spoke.rbvi.ucsf.edu/swagger/). KG-RAG code is made available at https://github.com/BaranziniLab/KG_RAG. Biomedical benchmark datasets used in this study are made available to the research community in the same GitHub repository.
Karthik Soman, Peter W. Rose, John Scotter Morris, Rabia E. Akbas, Brett Smith, Braian Peetoom, Catalina Villouta-Reyes, Gabriel Cerono, Yongmei Shi, Angela Rizk-Jackson, Sharat Israni, Charlotte A. Nelson, Sui Huang, Sergio Baranzini
Bioinform.11
2023 The scalable precision medicine open knowledge engine (SPOKE): a massive knowledge graph of biomedical information
abstract
MOTIVATION: Knowledge graphs (KGs) are being adopted in industry, commerce and academia. Biomedical KG presents a challenge due to the complexity, size and heterogeneity of the underlying information. RESULTS: In this work, we present the Scalable Precision Medicine Open Knowledge Engine (SPOKE), a biomedical KG connecting millions of concepts via semantically meaningful relationships. SPOKE contains 27 million nodes of 21 different types and 53 million edges of 55 types downloaded from 41 databases. The graph is built on the framework of 11 ontologies that maintain its structure, enable mappings and facilitate navigation. SPOKE is built weekly by python scripts which download each resource, check for integrity and completeness, and then create a 'parent table' of nodes and edges. Graph queries are translated by a REST API and users can submit searches directly via an API or a graphical user interface. Conclusions/Significance: SPOKE enables the integration of seemingly disparate information to support precision medicine efforts. AVAILABILITY AND IMPLEMENTATION: The SPOKE neighborhood explorer is available at https://spoke.rbvi.ucsf.edu. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
John Scotter Morris, Karthik Soman, Rabia E. Akbas, Xiaoyuan Zhou, Brett Smith, Elaine C. Meng, Conrad C. Huang, Gabriel Cerono, Gundolf Schenk, Angela Rizk-Jackson, Adil Harroud, Lauren M. Sanders, Sylvain V. Costes, Krish Bharat, Arjun Chakraborty, Alexander R. Pico, Taline Mardirossian, Michael J. Keiser, Alice Tang, Josef Hardi, Yongmei Shi, Mark A. Musen, Sharat Israni, Sui Huang, Peter W. Rose, Charlotte A. Nelson, Sergio Baranzini
Bioinform.23
2022 Deidentifying a Corpus of 100 Million Clinical Text Documents for Information Extraction: Lessons Learned
Lakshmi Radhakrishnan, Gundolf Schenk, Kathlene Muenzen, Boris Oskotsky, Sharat Israni, Atul J. Butte
AMIA5
2022 International Workshop on Knowledge Graphs: Open Knowledge Network
abstract
Knowledge networks/graphs provide a powerful approach for data discovery, integration, and reuse. The NSF's new Convergence Accelerator program, which focuses on transitioning research to practice and translational research, announced Track A on the Open Knowledge Network (OKN). The program calls for multidisciplinary and multi-sector teams to work together to build a cooperative and shared open knowledge network infrastructure to drive innovation across science, engineering, and humanities. This workshop aims to invite researchers, practitioners, and the general public to brainstorm the ideas related to OKN, collaboratively build KGs for different domains or applications, develop AI algorithms to provide intelligent services based on OKN, and discuss the social and economic implications related to OKN.
Ying Ding 0001, Amit P. Sheth, Krzysztof Janowicz, Sergio Baranzini, Sharat Israni, Ilkay Altintas, Lilit Yeghiazarian, Ellie Young, Sam Klein
KDD5
2022 Exaflops Biomedical Knowledge Graph Analytics
abstract
We are motivated by newly proposed methods for mining large-scale corpora of scholarly publications (e.g., full biomedical literature), which consists of tens of millions of papers spanning decades of research. In this setting, analysts seek to discover relationships among concepts. They construct graph representations from annotated text databases and then formulate the relationship-mining problem as an all-pairs shortest paths (APSP) and validate connective paths against curated biomedical knowledge graphs (e.g., Spoke). In this context, we present Coast (Exascale Communication-Optimized All-Pairs Shortest Path) and demonstrate 1.004 EF/s on 9,200 Frontier nodes (73,600 GCDs). We develop hyperbolic performance models (HYPERMOD), which guide optimizations and parametric tuning. The proposed Coast algorithm achieved the memory constant parallel efficiency of 99% in the single-precision tropical semiring. Looking forward, Coast will enable the integration of scholarly corpora like PubMed into the Spoke biomedical knowledge graph.
Ramakrishnan Kannan, Piyush Sao, Hao Lu 0001, Jakub Kurzak, Gundolf Schenk, Yongmei Shi, Seung-Hwan Lim, Sharat Israni, Vijay Thakkar, Guojing Cong, Robert M. Patton, Sergio Baranzini, Richard W. Vuduc, Thomas E. Potok
SC8
2019 PatientExploreR: an extensible application for dynamic visualization of patient clinical history from electronic health records in the OMOP common data model
abstract
MOTIVATION: Electronic health records (EHRs) are quickly becoming omnipresent in healthcare, but interoperability issues and technical demands limit their use for biomedical and clinical research. Interactive and flexible software that interfaces directly with EHR data structured around a common data model (CDM) could accelerate more EHR-based research by making the data more accessible to researchers who lack computational expertise and/or domain knowledge. RESULTS: We present PatientExploreR, an extensible application built on the R/Shiny framework that interfaces with a relational database of EHR data in the Observational Medical Outcomes Partnership CDM format. PatientExploreR produces patient-level interactive and dynamic reports and facilitates visualization of clinical data without any programming required. It allows researchers to easily construct and export patient cohorts from the EHR for analysis with other software. This application could enable easier exploration of patient-level data for physicians and researchers. PatientExploreR can incorporate EHR data from any institution that employs the CDM for users with approved access. The software code is free and open source under the MIT license, enabling institutions to install and users to expand and modify the application for their own purposes. AVAILABILITY AND IMPLEMENTATION: PatientExploreR can be freely obtained from GitHub: https://github.com/BenGlicksberg/PatientExploreR. We provide instructions for how researchers with approved access to their institutional EHR can use this package. We also release an open sandbox server of synthesized patient data for users without EHR access to explore: http://patientexplorer.ucsf.edu. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Benjamin S. Glicksberg, Boris Oskotsky, Phyllis Thangaraj, Nicholas Giangreco, Marcus A. Badgeley, Kipp W. Johnson, Debajyoti Datta, Vivek A. Rudrapatna, Nadav Rappoport, Mark M. Shervey, Riccardo Miotto, Theodore C. Goldstein, Eugenia Rutenberg, Remi Frazier, Sharat Israni, Rick Larsen, Bethany Percha, Li Li 0062, Joel Dudley, Nicholas P. Tatonetti, Atul J. Butte
Bioinform.16