Showing papers by "Jerome H. Friedman published in 1979"
TL;DR: In this paper, generalizations of the Wald-Wolfowitz runs statistic and the Smirnov maximum deviation statistic for the two-sample problem are presented based on the minimal spanning tree of the pooled sample points.
Abstract: Multivariate generalizations of the Wald--Wolfowitz runs statistic and the Smirnov maximum deviation statistic for the two-sample problem are presented. They are based on the minimal spanning tree of the pooled sample points. Some null distribution results are derived and a simulation study of power is reported. 5 figures, 2 tables.
702 citations
TL;DR: The purpose of this paper is to acquaint the reader with the structures currently avadable for solving the particular problem of range searching, and to display a set of general methods for attacking multikey searching problems.
Abstract: Much research has recently been devoted to "multikey" searching problems. In this paper the partmular multlkey problem of range searching Is investigated and a number of data structures that have been proposed as solutions to this problem are surveyed. The purposes of this paper are to bring together a collection of widely scattered results, to acquaint the reader with the structures currently avadable for solving the particular problem of range searching, and to display a set of general methods for attacking multikey searching problems.
652 citations
01 Jan 1979
TL;DR: In this article, a nonparametric regression problem is formulated where one is given a set of vector valued variables 3 (termed carriers) and with each associated scalar quantity Y (the response) and the problem is to estimate each corresponding response using the values of its carriers and the training sample.
Abstract: In the nonparametric regression problem, one is given a set of vector valued variables 3 (termed carriers) and with each an associated scalar quantity Y (termed the response). This set of carriers and associated responses CYi,Xil (l
55 citations
01 Jan 1979
TL;DR: A computer-graphic system that facilitates interactive viewing and manipulation of an ensemble of points that performs successive partitioning of the cloud by use of hyperplanes and explores expanding sequences of neighborhoods.
Abstract: The need to explore structure in high-dimensional clouds of data points that may concentrate near (possibly nonlinear) manifolds of lower dimension led to the current development of three new approaches. The first is a computer-graphic system (PRIM'79) that facilitates interactive viewing and manipulation of an ensemble of points. The other two are automatic procedures for separating a cloud into more manageable pieces. One of these (BIDEC) performs successive partitioning of the cloud by use of hyperplanes; the other (Cake Maker) explores expanding sequences of neighborhoods. Both procedures provide facilities for examining the resulting pieces and the relationships among them.
6 citations