Odds-On Trees

2010/02/05 by Prosenjit Bose, Bose, Prosenjit, Luc Devroye +9
Computer Science · #Computational Geometry (cs.CG) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #cs.CG #cs.DS

paper · pdf · doi:10.48550/arxiv.1002.1092

19 pages, 0 figures

arxiv created 2010/02/05 · arxiv updated 2010/02/26

Abstract

Let R^d -> A be a query problem over R^d for which there exists a data structure S that can compute P(q) in O(log n) time for any query point q in R^d. Let D be a probability measure over R^d representing a distribution of queries. We describe a data structure called the odds-on tree, of size O(n^ε) that can be used as a filter that quickly computes P(q) for some query values q in R^d and relies on S for the remaining queries. With an odds-on tree, the expected query time for a point drawn according to D is O(H*+1), where H* is a lower-bound on the expected cost of any linear decision tree that solves P. Odds-on trees have a number of applications, including distribution-sensitive data structures for point location in 2-d, point-in-polytope testing in d dimensions, ray shooting in simple polygons, ray shooting in polytopes, nearest-neighbour queries in R^d, point-location in arrangements of hyperplanes in R^d, and many other geometric searching problems that can be solved in the linear-decision tree model. A standard lifting technique extends these results to algebraic decision trees of constant degree. A slightly different version of odds-on trees yields similar results for orthogonal searching problems that can be solved in the comparison tree model.

Related

• Inference in Polytrees with Sets of Probabilities
• Randomized partition trees for exact nearest neighbor search
• Treedy: A Heuristic for Counting and Sampling Subsets
• Open Problem: Properly learning decision trees in polynomial time?
• Properly learning decision trees in almost polynomial time