FNN: Fast Nearest Neighbor Search Algorithms and Applications

Cover-tree and kd-tree fast k-nearest neighbor search algorithms and related applications including KNN classification, regression and information measures are implemented.

AuthorAlina Beygelzimer, Sham Kakadet and John Langford (cover tree library), Sunil Arya and David Mount (ANN library for the kd-tree approach), Shengqiao Li
Date of publication2013-07-31 21:31:17
MaintainerShengqiao Li <lishengqiao@yahoo.com>
LicenseGPL (>= 2.1)
Version1.1

View on CRAN

Files

FNN
FNN/inst
FNN/inst/COPYRIGHTS
FNN/src
FNN/src/KNN_mutual_information.cpp
FNN/src/kd_util.cpp
FNN/src/bd_fix_rad_search.cpp
FNN/src/Makevars
FNN/src/kd_split.cpp
FNN/src/kd_util.h
FNN/src/kd_pr_search.cpp
FNN/src/pr_queue_k.h
FNN/src/KNN_ANN.cpp
FNN/src/bd_tree.cpp
FNN/src/bd_tree.h
FNN/src/cover_tree.h
FNN/src/ANN.cpp
FNN/src/kd_pr_search.h
FNN/src/perf.cpp
FNN/src/pr_queue.h
FNN/src/kd_split.h
FNN/src/kd_tree.h
FNN/src/bd_search.cpp
FNN/src/KNN_correlation_distance.cpp
FNN/src/bd_pr_search.cpp
FNN/src/KNN_cover_test.cpp
FNN/src/stack.h
FNN/src/kd_fix_rad_search.cpp
FNN/src/kd_dump.cpp
FNN/src/Makevars.win
FNN/src/KNN_cover_tree.cpp
FNN/src/brute.cpp
FNN/src/kd_fix_rad_search.h
FNN/src/kd_search.cpp
FNN/src/kd_tree.cpp
FNN/src/label_point.cpp
FNN/src/label_point.h
FNN/src/include
FNN/src/include/ANN
FNN/src/include/ANN/ANNperf.h
FNN/src/include/ANN/ANN.h
FNN/src/include/ANN/ANNx.h
FNN/src/kd_search.h
FNN/NAMESPACE
FNN/R
FNN/R/KNNCR.R FNN/R/KNN.information.measures.R FNN/R/KNN.R FNN/R/OWNN.R
FNN/MD5
FNN/DESCRIPTION
FNN/ChangeLog
FNN/man
FNN/man/print.knnRegCV.Rd FNN/man/entropy.Rd FNN/man/KL.divergence.Rd FNN/man/knn.Rd FNN/man/get.knn.Rd FNN/man/knn.cv.Rd FNN/man/knn.index.Rd FNN/man/knn.reg.Rd
FNN/man/ownn.rd
FNN/man/mutual_information.Rd FNN/man/KL.dist.Rd FNN/man/knn.dist.Rd FNN/man/crossentropy.Rd

Questions? Problems? Suggestions? or email at ian@mutexlabs.com.

Please suggest features or report bugs with the GitHub issue tracker.

All documentation is copyright its authors; we didn't write any of that.