|
Descripción
|
|
|---|---|
| Frequent itemset mining is today one of the most popular data mining techniques. Its application is, how- ever, hindered by the high computational cost in many real-world datasets, especially for smaller values of support thresholds. In many cases, moreover, the large number of frequent itemsets discovered is over- whelming. In some real-world applications, it is sufficient to find a smaller subset of frequent itemsets, such as identifying the frequent itemsets with a maximum length. In this paper, we present a prun- ing algorithm, called LengthSort, that reduces the search space effectively and improves the efficiency of mining frequent itemsets with a maximum length. LengthSort prunes both the items and the transactions before constructing a Frequent Pattern tree structure. Our experiments on several datasets show that the proposed pruning techniques reduce the time needed to discover the frequent itemsets with a maximum length. The proposed pruning algorithm can also be applied to efficiently discover frequent itemsets that are longer than a user-specified threshold. | |
|
Internacional
|
Si |
|
JCR del ISI
|
Si |
|
Título de la revista
|
Expert Systems With Applications |
|
ISSN
|
0957-4174 |
|
Factor de impacto JCR
|
|
|
Información de impacto
|
|
|
Volumen
|
142 |
|
DOI
|
10.1016/j.eswa.2019.113004 |
|
Número de revista
|
|
|
Desde la página
|
113004 |
|
Hasta la página
|
113027 |
|
Mes
|
SIN MES |
|
Ranking
|
|