The Anchors Hierarchy: Using the Triangle Inequality to Survive High Dimensional Data

A hierarchical O(N log N) force-calculation algorithm

1986 • 3,425 citations

An Algorithm for Finding Best Matches in Logarithmic Expected Time

1977 • 2,694 citations

Fast discovery of association rules

1996 • 2,401 citations

X-means: Extending K-means with Efficient Estimation of the Number of Clusters

2000 • 2,107 citations

M-tree: An Efficient Access Method for Similarity Search in Metric Spaces

1997 • 1,556 citations

Implementing data cubes efficiently

1996 • 1,181 citations

Satisfying general proximity / similarity queries with metric trees

1991 • 706 citations

Accelerating exactk-means algorithms with geometric reasoning

1999 • 372 citations

Cached Sufficient Statistics for Efficient Machine Learning with Large Datasets

1998 • 210 citations

Very Fast EM-Based Mixture Model Clustering Using Multiresolution Kd-Trees

1998 • 162 citations

Efficient Locally Weighted Polynomial Regression Predictions

1997 • 99 citations

Multiresolution instance-based learning

1995 • 71 citations

Bumptrees for Efficient Function, Constraint and Classification Learning

1990 • 70 citations

Efficient regular data structures and algorithms for location and proximity problems

2003 • 34 citations