期刊名称：International Journal of Innovative Research in Computer and Communication Engineering
印刷版ISSN：2320-9798
电子版ISSN：2320-9801
出版年度：2017
卷号：5
期号：1
页码：607
DOI：10.15680/IJIRCCE.2017.0501123
出版社：S&S Publications
摘要：Frequent sequence mining is well known data mining. The output of the algorithm is used in many otherareas like chemistry, bioinformatics, and market basket analysis. Unfortunately, the frequent sequence mining iscomputationally quite expensive. we present a novel parallel algorithm for mining of frequent sequences based on astatic load-balancing. The static load balancing is done by measuring the computational time using a probabilisticalgorithm and parallel algorithm. For reasonable size of instance, the algorithms achieve speedups up to =3/4 P where Pis the number of processors. In the experimental evaluation, our method performs significantly better than the currentstate-of-the-art methods. The presented approach is very universal it can be used for static load balancing of otherpattern mining and parallel mining algorithms such as item set/tree/graph mining algorithms.
