微型电脑应用2016，Vol.32Issue(1)：33-37,5.
大图挖掘中一种基于云计算的改进SpiderMine算法
Improved SpiderMine Algorithm Based on Cloud Computing in Big Graph Mining
摘要
Abstract
The existing graph mining algorithms in a cloud environment are difficult to carry out mining the high frequent patterns of a massive graph .To solve this problem, this paper has made the improvement to the SpiderMine algorithm, and an improved SpiderMine algorithm is proposed based on the cloud(c-SpiderMine). Firstly, one big graph data is divided into several sub graphs by minimum cut algorithm to minimize partition/merge costs. And then it exploits SpiderMine to mine the patterns, which generates large patterns with much lower combinational complexity. Finally, a pattern key (PK) function is proposed to preserve the patterns, which guarantees that all patterns can be successfully recovered and merged. The experiments are conducted with three real data sets, and the experimental results demonstrate that c-SpiderMine can efficiently mine top-k large patternsin the cloud, and performs well in memory usage and execution time with different data sizes and minimum supports than the SpiderMine.关键词
图挖掘/云计算/高频模式/最小切割算法/模式键函数/运行时间Key words
Graph Mining/Cloud Computing/Frequent Patterns/Minimum Cut Algorithm/Pattern Key Function/Execution Time分类
信息技术与安全科学引用本文复制引用
刘莹,杜奕智,邹乐..大图挖掘中一种基于云计算的改进SpiderMine算法[J].微型电脑应用,2016,32(1):33-37,5.基金项目
合肥学院校级基金 （）
