Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces
- 1 July 2004
- journal article
- Published by Springer Nature in Machine Learning
- Vol. 56 (1-3) , 153-167
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Sparse partitions2002
- Efficient Search for Approximate Nearest Neighbor in High Dimensional SpacesSIAM Journal on Computing, 2000
- Syntactic clustering of the WebComputer Networks and ISDN Systems, 1997
- Two algorithms for nearest-neighbor search in high dimensions1997
- The geometry of graphs and some of its algorithmic applicationsCombinatorica, 1995
- Relative neighborhood graphs and their relativesProceedings of the IEEE, 1992
- The Johnson-Lindenstrauss lemma and the sphericity of some graphsJournal of Combinatorial Theory, Series B, 1988
- How to search in historyInformation and Control, 1985
- Extensions of Lipschitz mappings into a Hilbert space1984
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related ProblemsSIAM Journal on Computing, 1982