K近邻C/C ++实现 [英] K-nearest neighbour C/C++ implementation

查看:95
本文介绍了K近邻C/C ++实现的处理方法,对大家解决问题具有一定的参考价值,需要的朋友们下面随着小编来一起学习吧!

问题描述

在哪里可以找到k近邻算法的串行C/C ++实现?
您知道有图书馆吗?
我已经找到了openCV,但是实现已经是并行的.
我想从串行实现开始,并使其与pthreads openMP和MPI并行.

Where can I find an serial C/C++ implementation of the k-nearest neighbour algorithm?
Do you know of any library that has this?
I have found openCV but the implementation is already parallel.
I want to start from a serial implementation and parallelize it with pthreads openMP and MPI.

谢谢,
亚历克斯

Thanks,
Alex

推荐答案

ANN怎么样? http://www.cs.umd.edu/~mount/ANN/ .我曾经使用过kdtree实现,但是还有其他选择.

How about ANN? http://www.cs.umd.edu/~mount/ANN/. I have once used the kdtree implementation, but there are other options.

从网站上引用:"ANN是用C ++编写的库,它支持任意高度维度上的精确和近似最近邻居搜索的数据结构和算法."

Quoting from the website: "ANN is a library written in C++, which supports data structures and algorithms for both exact and approximate nearest neighbor searching in arbitrarily high dimensions."

这篇关于K近邻C/C ++实现的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持IT屋!

查看全文
登录 关闭
扫码关注1秒登录
发送“验证码”获取 | 15天全站免登陆