activity
19942020
most citedLogarithmic-Time Updates and Queries in Probabilistic Networks

6 citations · 7 across the 5 of their papers we have counts for

collaborators

5 papers

cs.CY2020★ 1 cited

Artificial Tikkun Olam: AI Can Be Our Best Friend in Building an Open Human-Computer Society

Simon Kasif

Technological advances of virtually every kind pose risks to society including fairness and bias. We review a long-standing wisdom that a widespread practical deployment of any tec…

q-bio.MN2020

Interpretable Network Propagation with Application to Expanding the Repertoire of Human Proteins that Interact with SARS-CoV-2

Jeffrey N. Law, Kyle Akers, Nure Tasnina +8

Background: Network propagation has been widely used for nearly 20 years to predict gene functions and phenotypes. Despite the popularity of this approach, little attention has bee…

cs.AI2014

Logarithmic-Time Updates and Queries in Probabilistic Networks

Arthur L. Delcher, Adam J. Grove, Simon Kasif +1

In this paper we propose a dynamic data structure that supports efficient algorithms for updating and querying singly connected Bayesian networks (causal trees and polytrees). In t…

cs.AI1996★ 6 cited

Logarithmic-Time Updates and Queries in Probabilistic Networks

A. L. Delcher, A. J. Grove, S. Kasif +1

Traditional databases commonly support efficient query and update procedures that operate in time which is sublinear in the size of the database. Our goal in this paper is to take…

cs.AI1994

A System for Induction of Oblique Decision Trees

S. K. Murthy, S. Kasif, S. Salzberg

This article describes a new system for induction of oblique decision trees. This system, OC1, combines deterministic hill-climbing with two forms of randomization to find a good o…