资源分类
》 资源 》论文》Shortest path distance in random k-nearest neighbor graphs

Shortest path distance in random k-nearest neighbor graphs

2020-02-28 | |  56 |   49 |   0

Abstract

Consider a weighted or unweighted k-nearest neighbor graph that has been built on n data points drawn randomly according to some density p on Rd . We study the convergence of the shortest path distance in such graphs as the sample size tends to infinity. We prove that for unweighted kNN graphs, this distance converges to an unpleasant distance function on the underlying space whose properties are detrimental to machine learning. We also study the behavior of the shortest path distance in weighted kNN graphs.

上一篇：Revisiting k-means: New Algorithms via Bayesian Nonparametrics

下一篇：Convergence of the EM Algorithm for Gaussian Mixtures with Unbalanced Mixing Coefficients

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...