Search Results for author: Justin Sybrandt

Found 10 papers, 3 papers with code

Literature-based Discovery for Landscape Planning

no code implementations5 Jun 2023 David Marasco, Ilya Tyagin, Justin Sybrandt, James H. Spencer, Ilya Safro

This project demonstrates how medical corpus hypothesis generation, a knowledge discovery field of AI, can be used to derive new research angles for landscape and urban planners.

Accelerating COVID-19 research with graph mining and transformer-based learning

1 code implementation10 Feb 2021 Ilya Tyagin, Ankit Kulshrestha, Justin Sybrandt, Krish Matta, Michael Shtutman, Ilya Safro

In 2020, the White House released the, "Call to Action to the Tech Community on New Machine Readable COVID-19 Dataset," wherein artificial intelligence experts are asked to collect data and develop text mining techniques that can help the science community answer high-priority scientific questions related to COVID-19.

Graph Mining

Accelerating Text Mining Using Domain-Specific Stop Word Lists

no code implementations18 Nov 2020 Farah Alshanik, Amy Apon, Alexander Herzog, Ilya Safro, Justin Sybrandt

Eliminating domain-specific common words in a corpus reduces the dimensionality of the feature space, and improves the performance of text mining tasks.

Computational Efficiency Dimensionality Reduction +1

CBAG: Conditional Biomedical Abstract Generation

no code implementations13 Feb 2020 Justin Sybrandt, Ilya Safro

We propose a transformer-based conditional language model with a shallow encoder "condition" stack, and a deep "language model" stack of multi-headed attention blocks.

Descriptive Language Modelling +1

AGATHA: Automatic Graph-mining And Transformer based Hypothesis generation Approach

1 code implementation13 Feb 2020 Justin Sybrandt, Ilya Tyagin, Michael Shtutman, Ilya Safro

Hypothesis generation systems address this challenge by mining the wealth of publicly available scientific information to predict plausible research directions.

Drug Discovery Graph Mining

Hypergraph Partitioning With Embeddings

no code implementations9 Sep 2019 Justin Sybrandt, Ruslan Shaydulin, Ilya Safro

As a result, hypergraph partitioning is an NP-Hard problem to both solve or approximate.

hypergraph partitioning

FOBE and HOBE: First- and High-Order Bipartite Embeddings

no code implementations27 May 2019 Justin Sybrandt, Ilya Safro

Typical graph embeddings may not capture type-specific bipartite graph features that arise in such areas as recommender systems, data visualization, and drug discovery.

Data Visualization Drug Discovery +3

Large-Scale Validation of Hypothesis Generation Systems via Candidate Ranking

no code implementations11 Feb 2018 Justin Sybrandt, Michael Shtutman, Ilya Safro

This method evaluates a HG system by its ability to rank hypotheses by plausibility; a process reminiscent of human candidate selection.

Topic Models

Cannot find the paper you are looking for? You can Submit a new open access paper.