Multi-level Sequence Mining Based on GSP

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F12%3APU101753" target="_blank" >RIV/00216305:26230/12:PU101753 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.2478/v10198-012-0012-8" target="_blank" >http://dx.doi.org/10.2478/v10198-012-0012-8</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.2478/v10198-012-0012-8" target="_blank" >10.2478/v10198-012-0012-8</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Multi-level Sequence Mining Based on GSP

Popis výsledku v původním jazyce

Mining sequential patterns is an important problem in the field of data mining and many algorithms and optimization techniques have been published to deal with that problem. The GSP algorithm, which is one of them, can be used for mining sequential patterns with some additional constraints. In this paper, we propose a new algorithm for mining multi-level sequential patterns based on GSP. The idea is that if a more general item appears in a pattern, the pattern has higher or at least the same support asthe one containing the corresponding specific item. However, too generalized sequence patterns are not important for user. In our algorithm generalization uses a selective method based on information content of patterns. This allows us to mine more patterns with the same minimal support threshold and to reveal new potentially useful patterns.

Název v anglickém jazyce

Multi-level Sequence Mining Based on GSP

Popis výsledku anglicky

Mining sequential patterns is an important problem in the field of data mining and many algorithms and optimization techniques have been published to deal with that problem. The GSP algorithm, which is one of them, can be used for mining sequential patterns with some additional constraints. In this paper, we propose a new algorithm for mining multi-level sequential patterns based on GSP. The idea is that if a more general item appears in a pattern, the pattern has higher or at least the same support asthe one containing the corresponding specific item. However, too generalized sequence patterns are not important for user. In our algorithm generalization uses a selective method based on information content of patterns. This allows us to mine more patterns with the same minimal support threshold and to reveal new potentially useful patterns.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/TA01010858" target="_blank" >TA01010858: Systém pro zvýšení bezpečnosti v prostředí Internetu analýzou šíření škodlivého kódu</a><br>

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2012

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Acta Electrotechnica et Informatica

ISSN

1335-8243

e-ISSN

—

Svazek periodika

2012

Číslo periodika v rámci svazku

2

Stát vydavatele periodika

SK - Slovenská republika

Počet stran výsledku

8

Strana od-do

31-38

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—