Implementing Sequential Prefixspan Algorithm by Using Static Load Balancing

Abstract

Repeated series mining is well known and well studied trouble in information mining. The productivity of the formula is used in several alternative regions like chemistry, bioinformatics, and market basket analysis. A completely unique parallel algorithmic rule for mining of frequent sequences supported a static load-balancing is planned. The static load balancing is done by measure the machine time using a probabilistic algorithm. For cheap size of instance, the algorithms deliver the good speedups. The conferred approach is extremely universal: it is often used for static load-balancing of alternative pattern mining algorithms like item set/tree/graph mining algorithms.