Browsing by Subject "DECOMPOSITION"
Now showing items 1-1 of 1
-
(SPRINGER-VERLAG BERLIN, 2006)Let U be a set of elements and d a distance function defined among them. Let NNk (u) be the k elements in U - {u} having the smallest distance to u. The k-nearest neighbor graph (kNNG) is a weighted directed graph G(U,E) ...