Faceted Browser

43 document(s) found.

Limit to site collection (autonweb) Limit to site variant (branch main, language en)
Order by:
Open this query in the query search page

Filters:

Tags equals Kd-trees and Ball-trees

Remove all

1-10 of 43 Next >

Accelerating Exact k-means Algorithms with Geometric Reasoning

Document Type: Paper
Tags: Statistical Data Mining for Astrophysics, Cached Sufficient Statistics, Astrostatistics, Clustering, Efficient Statistical Algorithms, Kd-trees and Ball-trees, Mixture Models

A K-means tutorial. We present new algorithms for the k-means clustering problem. They use the kd-tree data structure to reduce the large number of nearest-neighbor queries issued by the traditional algorithm. Sufficient statistics are stored in the nodes of the kd-tree. Then, an analysis of th...

Accelerating Exact k-means Algorithms with Geometric Reasoning (Extended version)

Document Type: Paper
Tags: Statistical Data Mining for Astrophysics, Cached Sufficient Statistics, Clustering, Kd-trees and Ball-trees, Efficient Statistical Algorithms, Mixture Models

This is an extended version of the KDD99 paper (available here. We present new algorithms for the k-means clustering problem. They use the kd-tree data structure to reduce the large number of nearest-neighbor queries issued by the traditional algorithm. Sufficient statistics are stored in the no...

Acquisition of Dynamic Control Knowledge for a Robotic Manipulator

Document Type: Paper
Tags: Kd-trees and Ball-trees, Memory-based Learning, Active Learning

To make efficient use of a dynamic system such as a mechanical manipulator, the robotic controller needs various models of its behaviour. I describe a method of learning in which all the experiences in the lifetime of the robot are explicitly remembered. They are stored in a manner which permits...

A Fast Multi-Resolution Method for Detection of Significant Spatial Disease Clusters

Document Type: Paper
Tags: Biosurveillance, Clustering, Kd-trees and Ball-trees, Efficient Statistical Algorithms, Applications

Given an N x N grid of squares, where each square has a count and an underlying population, our goal is to find the square region with the highest density, and to calculate its significance by randomization. Any density measure D, dependent on the total count and total population of a region, ca...

A Fast Multi-Resolution Method for Detection of Significant Spatial Overdensities

Document Type: Paper
Tags: Biosurveillance, Statistical Data Mining for Astrophysics, Clustering, Efficient Statistical Algorithms, Kd-trees and Ball-trees, Applications, Spatial Statistics

Given an NxN grid of squares, where each square s_ij has count c_ij and an underlying population p_ij, our goal is to find the square region S with the highest density, and to calculate the significance of this region by Monte Carlo testing. Any density measure D, which depends on the total coun...

Alexander Gray

Document Type: Person
Tags: Auton Fast Classifiers, Statistical Data Mining for Astrophysics, K Nearest Neighbor, Astrostatistics, Cached Sufficient Statistics, Clustering, Memory-based Learning, Efficient Statistical Algorithms, Life Science Data Mining, Locally Weighted Learning, Kernel Density Estimation, Bayesian Networks, Kd-trees and Ball-trees, Mixture Models, Optimization

Alex's fascinations in early grade school were Legos, breaking ciphers, and drawing human anatomy. After studying Applied Math and Computer Science at Berkeley, he resisted a job offer to do Hollywood special effects and ended up working at NASA's Jet Propulsion Laboratory for six years developi...

A Multiple Tree Algorithm for the Efficient Association of Asteroid Observations

Document Type: Paper
Tags: Statistical Data Mining for Astrophysics, Kd-trees and Ball-trees

In this paper we examine the problem of efficiently finding sets of observations that conform to a given underlying motion model. While this problem is often phrased as a tracking problem, where it is called track initiation, it is useful in a variety of tasks where we want to find correspondenc...

Andrew Moore

Document Type: Person
Tags: Link Analysis, Auton Fast Classifiers, Statistical Data Mining for Astrophysics, Cached Sufficient Statistics, Efficient Statistical Algorithms, Spatial Statistics, Life Science Data Mining, Logistic Regression, Locally Weighted Learning, GDA, AD-trees, Bayesian Networks, Kernel Density Estimation, Kd-trees and Ball-trees, Mixture Models, WSARE, Reinforcement Learning, Active Learning, Markov Decision Processes, K Nearest Neighbor, Astrostatistics, Clustering, Memory-based Learning, Biosurveillance, Applications, Optimization, Association Rules

Andrew began his career writing video-games for an obscure British personal computer. He rapidly became a thousandaire and retired to academia, where he received a PhD from the University of Cambridge in 1991. He researched robot learning as a Post-doc working with Chris Atkeson, and then moved ...

An Investigation of Practical Approximate Nearest Neighbor Algorithms

Document Type: Paper
Tags: Kd-trees and Ball-trees

This paper concerns approximate nearest neighbor searching algorithms, which have become increasingly important, especially in high dimensional perception areas such as computer vision, with dozens of publications in recent years. Much of this enthusiasm is due to a successful new approximate ne...

A tutorial on kd-trees

Document Type: Paper
Tags: Astrostatistics, Memory-based Learning, Kd-trees and Ball-trees

Extract from Andrew Moore's PhD Thesis. Gives a concise description of nearest neighbor search using kd-trees. See also Andrew's animations of KD-tree search algorithms.