MathGroup Archive 2000

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: finding the k-nearest neighbour

  • To: mathgroup at
  • Subject: [mg26154] Re: finding the k-nearest neighbour
  • From: Jens-Peer Kuska <kuska at>
  • Date: Thu, 30 Nov 2000 01:04:00 -0500 (EST)
  • Organization: Universitaet Leipzig
  • References: <8vvr6e$>
  • Sender: owner-wri-mathgroup at


you don't like :


Ludsteck wrote:
> Dear MathGroup members,
> I have to find the distance between a number x and its k - nearest
> neighbour in a list of numbers (where k is an integer and distance is
> simply Abs).
> This is quite easy in Mathematica. I use
> knearest[x_, li_List, k_Integer]:= Sort[ Abs/@(li - x) ][[k]]
> However, it is also very inefficient, since the whole list of absolute
> deviations
> has to be sorted. Now my lists are very long and I have to apply the
> knearest[...] function
> several thousands of times. Therefore I have to search for much faster
> solutions.
> I think the fasted way would be to use a priority queue of length k.
> Has someone other solutions or can someone provide ready-to-use code for
> priority queues in Mathematica?
> Thank you very much,
>         Johannes

  • Prev by Date: Re: PageWidth mystery
  • Next by Date: 2D graph for problem in Numerical Analysis
  • Previous by thread: finding the k-nearest neighbour
  • Next by thread: Re: finding the k-nearest neighbour