首页> 中文期刊> 《国际计算机前沿大会会议论文集》 >SparkSCAN:A Structure Similarity Clustering Algorithm on Spark

SparkSCAN:A Structure Similarity Clustering Algorithm on Spark

             

摘要

The existing directed graph clustering algorithms are born with some problems such as high latency,resource depletion and poor performance of iterative data processing.A distributed parallel algorithm of structure similarity clustering on Spark(SparkSCAN)is proposed to solve these problems:considering the interaction between nodes in the network,the similar structure of nodes are clustered together;Aiming at the large-scale characteristics of directed graphs,a data structure suitable for distributed graph computing is designed,and a distributed parallel clustering algorithm is proposed based on Spark framework,which improves the processing performance on the premise of the accuracy of clustering results.The experimental results show that the SparkSCAN have a good performance,and can effectively deal with the problem of clustering algorithm for large-scale directed graph.Keywords:Directed graph clustering Parallel algorithm

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号