Optimal construction of k-nearest neighbor graphs for identifying noisy clusters

1 Optimal construction of k-nearest neighbor graphs for identifying noisy clusters Markus Maier a,, Matthias Hein b, Ulrike von Luxburg a a Max Planck...
Author:  Quentin Pitts

1 downloads 9 Views 291KB Size

Recommend Documents

1 Practical Construction of k Nearest Neighbor Graphs in Metric Spaces Rodrigo Paredes and Gonzalo Navarro Center for Web Research, Dept. of Computer ...

1 Opimal Conrol wih Noiy Time Andrew Lamperki and Noah J Cowan Abrac Thi paper examine ochaic opimal conrol problem in which he ae i perfecly known, b...

1 Project Number: MA-PRC-3271 A Construction of Cospectral Graphs A Major Qualifying Project Report submitted to the Faculty of the WORCESTER POLYTECH...

1 Construction of Codes Identifying Sets of Vertices Sylvain Gravier CNRS - UJF, ERTé Maths à Modeler, Groupe de Recherche GéoD L...

1 Max Planck Institut für biologische Kybernetik Max Planck Institute for Biological Cybernetics Technical Report No TR-63 Cluster Identification...

1 Cluster Identification in Nearest-Neighbor Graphs Markus Maier, Matthias Hein, and Ulrike von Luxburg Max Planck Institute for Biological Cybernetic...

1 Proc. ACM SIGMOD Int. Conf. on Management of Data, Seattle, Washington, June Optimal Multi-Step k-nearest Neighbor Search Thomas Seidl University of...

1 Chapter 63 An Optimal Algorithm for Approximate Nearest Neighbor Searching Sunil Arya* David M. Mount+ Nathan S. Net anyahut Ruth Silvermans Angela ...

1 Parallel Cosine Nearest Neighbor Graph Construction David C. Anastasiu a,, George Karypis b a San José State University, One Washington Squar...

1 Identifying codes in vertex-transitive graphs and strongly regular graphs Sylvain Gravier Institut Fourier University of Grenoble Grenoble, France A...