ParallelKNN:使用 KD Trees Divide and Conquer 并行实现 KNN 图-源码

上传者: 42122988 | 上传时间: 2021-07-04 15:03:14 | 文件大小: 8.1MB | 文件类型: ZIP
C++
并行KNN 使用 KD 树/球树并行实现 KNN 图 该存储库是可扩展机器学习的最终项目。 提供了 4 种解决并行 KNN 问题的方法。 KDTrees with OpenMP:使用 OpenMP 并行化使用 KDTrees 的 KNN 构建 KDTrees with Galois : 使用 Galois 来构造和并行化 KNN 构造,使用 KDTrees Ball Trees with OpenMP:使用 OpenMP 并行化使用 Ball Trees 的 KNN 构造 KDTrees with Galois : 使用 Galois 来构造和并行化 KNN 构造,使用 KDTrees 所有实验都在 Stampede(TACC 的一部分)上运行。 基线是 KNN 图的蛮力构造。 有关每种方法的详细信息,请参阅报告。 报告和数据集可以在找到

文件下载

资源详情

[{"title":"( 50 个子文件 8.1MB ) ParallelKNN:使用 KD Trees Divide and Conquer 并行实现 KNN 图-源码","children":[{"title":"ParallelKNN-master","children":[{"title":"LGPL <span style='color:#111;'> 25.81KB </span>","children":null,"spread":false},{"title":"src-galois-balltree","children":[{"title":"Galois_BallTree.cpp <span style='color:#111;'> 16.24KB </span>","children":null,"spread":false},{"title":"CMakeLists.txt <span style='color:#111;'> 117B </span>","children":null,"spread":false}],"spread":true},{"title":"data","children":[{"title":"mnist-test.glue <span style='color:#111;'> 1.90MB </span>","children":null,"spread":false},{"title":"frey.dat <span style='color:#111;'> 8.40MB </span>","children":null,"spread":false},{"title":"mnist.dat <span style='color:#111;'> 7.48MB </span>","children":null,"spread":false},{"title":"frey.brute <span style='color:#111;'> 576.27KB </span>","children":null,"spread":false},{"title":"mnist-test.overlap <span style='color:#111;'> 1.90MB </span>","children":null,"spread":false},{"title":"frey.glue <span style='color:#111;'> 576.27KB </span>","children":null,"spread":false},{"title":"mnist-test.dat <span style='color:#111;'> 59.81MB </span>","children":null,"spread":false},{"title":"mnist-test.brute <span style='color:#111;'> 1.90MB </span>","children":null,"spread":false},{"title":"frey.overlap <span style='color:#111;'> 576.27KB </span>","children":null,"spread":false}],"spread":true},{"title":"src-balltree","children":[{"title":"Makefile <span style='color:#111;'> 226B </span>","children":null,"spread":false},{"title":"balltree.cpp <span style='color:#111;'> 12.95KB </span>","children":null,"spread":false}],"spread":true},{"title":"src_kd_galois","children":[{"title":"Galois_KD_tree.cpp <span style='color:#111;'> 15.69KB </span>","children":null,"spread":false},{"title":".DS_Store <span style='color:#111;'> 6.00KB </span>","children":null,"spread":false}],"spread":true},{"title":"src-kdtree","children":[{"title":"kdtree.h <span style='color:#111;'> 783B </span>","children":null,"spread":false},{"title":"Makefile <span style='color:#111;'> 242B </span>","children":null,"spread":false},{"title":"test.cpp <span style='color:#111;'> 2.91KB </span>","children":null,"spread":false},{"title":"kdtree.o <span style='color:#111;'> 135.95KB </span>","children":null,"spread":false},{"title":"kdtree.c <span style='color:#111;'> 7.60KB </span>","children":null,"spread":false},{"title":"libkdtree.a <span style='color:#111;'> 136.54KB </span>","children":null,"spread":false}],"spread":true},{"title":"src_sequential","children":[{"title":"Makefile <span style='color:#111;'> 441B </span>","children":null,"spread":false},{"title":"Point.h <span style='color:#111;'> 4.21KB </span>","children":null,"spread":false},{"title":"Node.h <span style='color:#111;'> 3.53KB </span>","children":null,"spread":false},{"title":"Test_KD_tree.cpp <span style='color:#111;'> 24.70KB </span>","children":null,"spread":false},{"title":"Sequential_KD_tree.cpp <span style='color:#111;'> 3.14KB </span>","children":null,"spread":false},{"title":"KDTree.h <span style='color:#111;'> 11.64KB </span>","children":null,"spread":false},{"title":"BoundedPQueue.h <span style='color:#111;'> 6.61KB </span>","children":null,"spread":false}],"spread":true},{"title":"scripts","children":[{"title":"knn_accuracy.py <span style='color:#111;'> 1.88KB </span>","children":null,"spread":false},{"title":"measure_sklearn_stampede.py <span style='color:#111;'> 870B </span>","children":null,"spread":false},{"title":"run_sklearn.py <span style='color:#111;'> 1.33KB </span>","children":null,"spread":false},{"title":"run_sklearn.pyc <span style='color:#111;'> 935B </span>","children":null,"spread":false}],"spread":true},{"title":"README.md <span style='color:#111;'> 886B </span>","children":null,"spread":false},{"title":"src-chen","children":[{"title":"knn <span style='color:#111;'> 42.14KB </span>","children":null,"spread":false},{"title":"dynamic_array.cpp <span style='color:#111;'> 2.98KB </span>","children":null,"spread":false},{"title":"linear_algebra.cpp <span style='color:#111;'> 7.94KB </span>","children":null,"spread":false},{"title":"Makefile <span style='color:#111;'> 756B </span>","children":null,"spread":false},{"title":"aux_func.h <span style='color:#111;'> 1.41KB </span>","children":null,"spread":false},{"title":"dynamic_array.h <span style='color:#111;'> 761B </span>","children":null,"spread":false},{"title":"linear_algebra.o <span style='color:#111;'> 13.63KB </span>","children":null,"spread":false},{"title":"aux_func.cpp <span style='color:#111;'> 3.11KB </span>","children":null,"spread":false},{"title":"aux_func.o <span style='color:#111;'> 11.84KB </span>","children":null,"spread":false},{"title":"knn_algo.h <span style='color:#111;'> 1.75KB </span>","children":null,"spread":false},{"title":"knn_algo.o <span style='color:#111;'> 18.05KB </span>","children":null,"spread":false},{"title":"knn_algo.cpp <span style='color:#111;'> 13.85KB </span>","children":null,"spread":false},{"title":"linear_algebra.h <span style='color:#111;'> 777B </span>","children":null,"spread":false},{"title":"dynamic_array.o <span style='color:#111;'> 5.24KB </span>","children":null,"spread":false},{"title":"main.cpp <span style='color:#111;'> 3.68KB </span>","children":null,"spread":false},{"title":"main.o <span style='color:#111;'> 2.34KB </span>","children":null,"spread":false}],"spread":false}],"spread":true}],"spread":true}]

评论信息

免责申明

【只为小站】的资源来自网友分享,仅供学习研究,请务必在下载后24小时内给予删除,不得用于其他任何用途,否则后果自负。基于互联网的特殊性,【只为小站】 无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查;无论 【只为小站】 经营者是否已进行审查,用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场,基于网友分享,根据中国法律《信息网络传播权保护条例》第二十二条之规定,若资源存在侵权或相关问题请联系本站客服人员,zhiweidada#qq.com,请把#换成@,本站将给予最大的支持与配合,做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明