no code implementations • 5 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.
no code implementations • 12 Apr 2023 • Daniel Golovin, Gabor Bartok, Eric Chen, Emily Donahue, Tzu-Kuo Huang, Efi Kokiopoulou, Ruoyan Qin, Nikhil Sarda, Justin Sybrandt, Vincent Tjeng
We are living in a golden age of machine learning.
1 code implementation • 10 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.
no code implementations • 18 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.
1 code implementation • 18 Mar 2020 • Fei Ding, Xiaohong Zhang, Justin Sybrandt, Ilya Safro
In addition, supervised graph representation learning requires labeled data, which is expensive and error-prone.
no code implementations • 13 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.
1 code implementation • 13 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.
no code implementations • 9 Sep 2019 • Justin Sybrandt, Ruslan Shaydulin, Ilya Safro
As a result, hypergraph partitioning is an NP-Hard problem to both solve or approximate.
no code implementations • 27 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.
no code implementations • 11 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.