Compute spearman correlation coefficient with Matlab/CUDA

ISSPIT(2012)

引用 11|浏览13
暂无评分
摘要
Given a data matrix where the rows are entities and the columns are features, researchers often want to compute the pairwise distances among the entities. Some common choices of distances are Euclidean distance, Manhattan distance, Chebyshev distance, and Canberra distance. Pearson and Spearman correlation coefficients, with a range from -to 1, can be used to define a distance: 1 minus the coefficient. Matlab is widely used in science and engineering fields for technical computing, and it provides a function in its statistics toolbox to calculate the pairwise distances, which takes a long time when the data matrix is large. Graphics processing units have become powerful co-processors to the CPUs. Nvidia GPUs can be programmed by the CUDA language. The present work studies CUDA implementation of Spearman correlation coefficient that can be called from Matlab to speed up the computation of pairwise distances. Speedups from 7.1 to 28.9 folds are achieved.
更多
查看译文
关键词
chebyshev distance,matlab,pairwise distance,manhattan distance,gpu,statistical analysis,cuda language,pairwise distances,graphics processing units,compute unified device architecture,cuda,technical computing,mathematics computing,nvidia gpu,spearman correlation coefficient,pearson correlation coefficient,euclidean distance,canberra distance,statistics toolbox,data matrix
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要