Institutional Repository
| parallel construction of approximate knn graph | |
| Wang Dilin; Zheng Yanmei; Cao Jianwen | |
| 2012 | |
| Conference Name | 11th International Symposium on Distributed Computing and Applications to Business, Engineering and Science, DCABES 2012 |
| Source | Proceedings - 11th International Symposium on Distributed Computing and Applications to Business, Engineering and Science, DCABES 2012 |
| Pages | 22-26 |
| Conference Date | October 19, 2012 - October 22, 2012 |
| Conference Place | Guilin, China |
| Indexed Type | EI |
| ISBN | 9780769548180 |
| Department | (1) Laboratory of Parallel Software and Computational Science of Software Institute of Software Chinese Academy of Sciences Beijing 100190 China; (2) Graduate University Chinese Academy of Sciences Beijing 100049 China |
| English Abstract | Building k-nearest neighbor (kNN) graphs is a necessary step in such areas as data mining and machine learning. So in this paper, we attempt to study the kNN furthermore, we first propose a parallel algorithm for approximate kNN graph construction and then apply the kNN graph to the application of clustering. Experiments show that our MPI/OpenMP mixed mode codes can make the construction of approximate kNN graph faster and make the parallelization and implementation easier. Finally, we compare the results of agglomerative clustering methods by using our parallel algorithm to illustrate the applicability of this method. © 2012 IEEE.; Building k-nearest neighbor (kNN) graphs is a necessary step in such areas as data mining and machine learning. So in this paper, we attempt to study the kNN furthermore, we first propose a parallel algorithm for approximate kNN graph construction and then apply the kNN graph to the application of clustering. Experiments show that our MPI/OpenMP mixed mode codes can make the construction of approximate kNN graph faster and make the parallelization and implementation easier. Finally, we compare the results of agglomerative clustering methods by using our parallel algorithm to illustrate the applicability of this method. © 2012 IEEE. |
| Keyword | Parallel Architectures |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/15846 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Wang Dilin,Zheng Yanmei,Cao Jianwen. parallel construction of approximate knn graph[C],2012:22-26. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment