Does anyone know, if there are any fast k-nearest neighbor methods available for R, and how they consume memory and time with increasing n (n, n*log(n), n^2) ? (I will summarize, if I receive information not send to the list, except the contributor asks for privacy) -- Dr. Jens Oehlschl?gel-Akiyoshi MD FACTORY GmbH Bayerstrasse 21 80335 M?nchen Tel.: 089 545 28-27 Fax.: 089 545 28-10 http://www.mdfactory.de -.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.- r-help mailing list -- Read http://www.ci.tuwien.ac.at/~hornik/R/R-FAQ.html Send "info", "help", or "[un]subscribe" (in the "body", not the subject !) To: r-help-request at stat.math.ethz.ch _._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._