6 citations · 7 across the 5 of their papers we have counts for
Showing cs.AIShow all
3 papers · 1 filter
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…