【作者】 毛韶阳； 李肯立；

【Author】 MAO Shao-yang1,2, LI Ken-li2 (1 Department of Mathematics, Hunan Institute of Humanities, Science and Technology, Loudi 417000, China; 2 School of Computer and Communication, Hunan University, Changsha 410082, China)

【机构】 湖南人文科技学院数学系； 湖南大学计算机与通信学院；

【摘要】 提出了一种基于密度的聚类并行算法,在APRAM模型的分布式存储系统中,通过欧几里德距离矩阵和密度函数两次时间复杂度为O(n2)的计算,可使聚类过程的时间复杂度变为O(n),以增加一次计算的代价来降低聚类过程的时间复杂度。基于8结点的机群计算实验表明本算法能够达到较同类算法更高的并行加速比,能提高高维生物数据的聚类速度。更多还原

【Abstract】 Put forward a clustering parallel algorithms based on the density. Use MPI under the APRAM model, passing twice computing with time complexity is O(n2) that of the Euclidean distance matrix and the density function, can make the time complexity of clustering procedure be O(n), reduce the time complexity of clustering through adding once computing. The experiment based on eight nodes indicates that this algorithm can attain higher parallel accelerate ratio than the same kind algorithm, raise the clustering rate of the high dimension living data.更多还原