Shortest path distance in random k-nearest neighbor graphs

Alamgir, M; von Luxburg, U

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Shortest path distance in random k-nearest neighbor graphs

MPS-Authors

/persons/resource/persons83779

Alamgir, M
Dept. Empirical Inference, Max Planck Institute for Intelligent Systems, Max Planck Society;

/persons/resource/persons76237

von Luxburg, U
Research Group Machines Learning Theory, Max Planck Institute for Intelligent Systems, Max Planck Society;
Dept. Empirical Inference, Max Planck Institute for Intelligent Systems, Max Planck Society;
External Organizations;

External Resource

https://doi.org/10.48550/arXiv.1206.6381
(Preprint)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Alamgir, M., & von Luxburg, U. (2012). Shortest path distance in random k-nearest neighbor graphs. In J. Langford, & J. Pineau (Eds.), Proceedings of the Twenty-Ninth International Conference on Machine Learning (pp. 1031-1038). Madison, WI: Omnipress. Retrieved from https://icml.cc/2012/papers.1.html.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000E-FE58-8

Abstract

There is no abstract available