| ... | ... | @@ -82,11 +82,11 @@ searchNoQuery( +integer, |
|
|
|
|
|
|
|
If you want a more detailed explanation, then go to the python documentation. There is most of the time a good explanation on how the methods work and what the parameters do.
|
|
|
|
|
|
|
|
* [MLpack::kfn_C++\_documentation](https://www.mlpack.org/doc/stable/doxygen/classmlpack_1_1neighbor_1_1NeighborSearch.html)
|
|
|
|
* [MLpack::kfn_Python_documentation](https://www.mlpack.org/doc/stable/python_documentation.html#kfn)
|
|
|
|
* [**MLpack::kfn_C++\_documentation**](https://www.mlpack.org/doc/stable/doxygen/classmlpack_1_1neighbor_1_1NeighborSearch.html)
|
|
|
|
* [**MLpack::kfn_Python_documentation**](https://www.mlpack.org/doc/stable/python_documentation.html#kfn)
|
|
|
|
|
|
|
|
added some of the links from the python documentation
|
|
|
|
|
|
|
|
* approx_kfn
|
|
|
|
* knn
|
|
|
|
* [Tree-independent dual-tree algorithms (pdf)](http://proceedings.mlr.press/v28/curtin13.pdf) |
|
|
\ No newline at end of file |
|
|
|
* [**approx_kfn**](https://gitlab.cs.uni-duesseldorf.de/stups/abschlussarbeiten/prolog-mlpack-libary/-/wikis/PrologMethods/Geometry/approx_kfn)
|
|
|
|
* [**knn**](https://gitlab.cs.uni-duesseldorf.de/stups/abschlussarbeiten/prolog-mlpack-libary/-/wikis/PrologMethods/Geometry/knn)
|
|
|
|
* [**Tree-independent dual-tree algorithms (pdf)**](http://proceedings.mlr.press/v28/curtin13.pdf) |
|
|
\ No newline at end of file |
