parallel construction of approximate knn graph

ISCAS OpenIR

	parallel construction of approximate knn graph
	Wang Dilin; Zheng Yanmei; Cao Jianwen
	2012
会议名称	11th International Symposium on Distributed Computing and Applications to Business, Engineering and Science, DCABES 2012
会议录名称	Proceedings - 11th International Symposium on Distributed Computing and Applications to Business, Engineering and Science, DCABES 2012
页码	22-26
会议日期	October 19, 2012 - October 22, 2012
会议地点	Guilin, China
收录类别	EI
ISBN	9780769548180
部门归属	(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
摘要	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.
关键词	Parallel Architectures
语种	英语
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/15846
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	Wang Dilin,Zheng Yanmei,Cao Jianwen. parallel construction of approximate knn graph[C],2012:22-26.