Contact Project Developer Ashish D. Tiwari [astiwz@gmail.com]
Download Synopsis Abstract
Java Data Mining BE-Engineering(CO/IT) ME-Engineering(CO/IT) BCS MCS BCA MCM BSC Computer/IT MSC Computer/IT Diploma (CO/IT) IEEE-2016

Probabilistic Static Load-Balancing of Parallel Mining of Frequent Sequences

Frequent sequence mining is well known and well studied problem in datamining.
Abstract-Synopsis-Documentation

Frequent sequence mining is well known and well studied problem in datamining.

Frequent sequence mining is well known and well studied problem in datamining. The output of the algorithm is used in many other areas like bioinformatics, chemistry, and market basket analysis. Unfortunately, the frequent sequence mining is computationally quite expensive. In this paper, we present a novel parallel algorithm for mining of frequent sequences based on a static load-balancing. The static load-balancing is done by measuring the computational time using a probabilistic algorithm. For reasonable size of instance, the algorithms achieve speedups up to _ 3=4 _ P where P is the number of processors. In the experimental evaluation, we show that our method performs significantly better then the current state-of-the-art methods. The presented approach is very universal: it can be used for static load-balancing of other pattern mining algorithms such as itemset/tree/graph mining algorithms.

Comment is Only Available for registered users! Create Account or Login Now!