An efficient approach for mining sequential patterns using multiple threads on very large databases
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F18%3A10241747" target="_blank" >RIV/61989100:27240/18:10241747 - isvavai.cz</a>
Result on the web
<a href="https://www.sciencedirect.com/science/article/pii/S0952197618301404?via%3Dihub" target="_blank" >https://www.sciencedirect.com/science/article/pii/S0952197618301404?via%3Dihub</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.engappai.2018.06.009" target="_blank" >10.1016/j.engappai.2018.06.009</a>
Alternative languages
Result language
angličtina
Original language name
An efficient approach for mining sequential patterns using multiple threads on very large databases
Original language description
Sequential pattern mining (SPM) plays an important role in data mining, with broad applications such as in financial markets, education, medicine, and prediction. Although there are many efficient algorithms for SPM, the mining time is still high, especially for mining sequential patterns from huge databases, which require the use of a parallel technique. In this paper, we propose a parallel approach named MCM-SPADE (Multiple threads CM-SPADE), for use on a multi-core processor system as a :multi-threading technique for SPM with very large database, to enhance the performance of the previous methods SPADE and CM-SPADE. The proposed algorithm uses the vertical data format and a data structure named CMAP (Co-occurrence MAP) for storing co-occurrence information. Based on the data structure CMAP, the proposed algorithm performs early pruning of the candidates to reduce the search space and it partitions the related tasks to each processor core by using the divide-and-conquer property. The proposed algorithm also uses dynamic scheduling to avoid task idling and achieve load balancing between processor cores. The experimental results show that MCM-SPADE attains good parallelization efficiency on various input databases.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2018
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE
ISSN
0952-1976
e-ISSN
—
Volume of the periodical
74
Issue of the periodical within the volume
September
Country of publishing house
GB - UNITED KINGDOM
Number of pages
10
Pages from-to
242-251
UT code for WoS article
000442705600018
EID of the result in the Scopus database
2-s2.0-85049880245