Mining colossal patterns with length constraints

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F21%3A10249059" target="_blank" >RIV/61989100:27240/21:10249059 - isvavai.cz</a>

Výsledek na webu

<a href="https://link.springer.com/article/10.1007/s10489-021-02357-8" target="_blank" >https://link.springer.com/article/10.1007/s10489-021-02357-8</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/s10489-021-02357-8" target="_blank" >10.1007/s10489-021-02357-8</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Mining colossal patterns with length constraints

Popis výsledku v původním jazyce

Mining of colossal patterns is used to mine patterns in databases with many attributes and values, but the number of instances in each database is small. Although many efficient approaches for extracting colossal patterns have been proposed, they cannot be applied to colossal pattern mining with constraints. In this paper, we solve the challenge of extracting colossal patterns with length constraints. Firstly, we describe the problems of min-length constraint and max-length constraint and combine them with length constraints. After that, we evolve a proposal for efficiently truncating candidates in the mining process and another one for fast checking of candidates. Based on these properties, we offer the mining algorithm of Length Constraints for Colossal Pattern (LCCP) to extract colossal patterns with length constraints. Experiments are also conducted to show the effectiveness of the proposed LCCP algorithm with a comparison to some other ones.

Název v anglickém jazyce

Mining colossal patterns with length constraints

Popis výsledku anglicky

Mining of colossal patterns is used to mine patterns in databases with many attributes and values, but the number of instances in each database is small. Although many efficient approaches for extracting colossal patterns have been proposed, they cannot be applied to colossal pattern mining with constraints. In this paper, we solve the challenge of extracting colossal patterns with length constraints. Firstly, we describe the problems of min-length constraint and max-length constraint and combine them with length constraints. After that, we evolve a proposal for efficiently truncating candidates in the mining process and another one for fast checking of candidates. Based on these properties, we offer the mining algorithm of Length Constraints for Colossal Pattern (LCCP) to extract colossal patterns with length constraints. Experiments are also conducted to show the effectiveness of the proposed LCCP algorithm with a comparison to some other ones.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10200 - Computer and information sciences

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2021

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

Applied Intelligence

ISSN

0924-669X

e-ISSN

1573-7497

Svazek periodika

51

Číslo periodika v rámci svazku

12

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

12

Strana od-do

nestrankovano

Kód UT WoS článku

000638056400001

EID výsledku v databázi Scopus

—