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%2F11%3APU96076" target="_blank" >RIV/00216305:26230/11:PU96076 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

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. An GSP algorithm, which is one of them, can be used for mining sequential patterns with some additional constraints, like gaps between items. Taxonomies can exist upon the items in sequences. It can be applied to mine sequential patterns with items on several hierarchical levels of the taxonomy. If a more general item appears in a pattern, the pattern has higher or at least the same support as the one containing the corresponding specific item. This allows us to mine more patterns with the same minimal support parameter and to reveal new potentially useful patterns. This paper presents a method for mining multi-level sequential patterns. The method is based on the GSP algorithm and generalization of more specific sequences based on the information theory.

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. An GSP algorithm, which is one of them, can be used for mining sequential patterns with some additional constraints, like gaps between items. Taxonomies can exist upon the items in sequences. It can be applied to mine sequential patterns with items on several hierarchical levels of the taxonomy. If a more general item appears in a pattern, the pattern has higher or at least the same support as the one containing the corresponding specific item. This allows us to mine more patterns with the same minimal support parameter and to reveal new potentially useful patterns. This paper presents a method for mining multi-level sequential patterns. The method is based on the GSP algorithm and generalization of more specific sequences based on the information theory.

Druh

D - Stať ve sborníku

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í

2011

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 statě ve sborníku

Proceedings of the Eleventh International Conference on Informatics INFORMATICS'2011

ISBN

978-80-89284-94-8

ISSN

—

e-ISSN

—

Počet stran výsledku

6

Strana od-do

185-190

Název nakladatele

Faculty of Electrical Engineering and Informatics, University of Technology Košice

Místo vydání

Košice

Místo konání akce

Rožňava

Datum konání akce

16. 11. 2011

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—