An Evolutionary Algorithm to Mine High-Utility Itemsets

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F15%3A86094299" target="_blank" >RIV/61989100:27240/15:86094299 - isvavai.cz</a>

Výsledek na webu

<a href="http://advances.utc.sk/index.php/AEEE/article/view/1474" target="_blank" >http://advances.utc.sk/index.php/AEEE/article/view/1474</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.15598/aeee.v13i4.1474" target="_blank" >10.15598/aeee.v13i4.1474</a>

Jazyk výsledku

angličtina

Název v původním jazyce

An Evolutionary Algorithm to Mine High-Utility Itemsets

Popis výsledku v původním jazyce

High-utility itemset mining (HUIM) is a critical issue in recent years since it can be used to reveal the profitable products by considering both the quantity and profit factors instead of frequent itemset mining (FIM) of association rules (ARs). In thispaper, an evolutionary algorithm is presented to efficiently mine high-utility itemsets (HUIs) based on the binary particle swarm optimization. A maximal pattern (MP)-tree strcutrue is further designed to solve the combinational problem in the evolutionprocess. Substantial experiments on real-life datasets show that the proposed binary PSO-based algorithm has better results compared to the state-of-the-art GA-based algorithm.

Název v anglickém jazyce

An Evolutionary Algorithm to Mine High-Utility Itemsets

Popis výsledku anglicky

High-utility itemset mining (HUIM) is a critical issue in recent years since it can be used to reveal the profitable products by considering both the quantity and profit factors instead of frequent itemset mining (FIM) of association rules (ARs). In thispaper, an evolutionary algorithm is presented to efficiently mine high-utility itemsets (HUIs) based on the binary particle swarm optimization. A maximal pattern (MP)-tree strcutrue is further designed to solve the combinational problem in the evolutionprocess. Substantial experiments on real-life datasets show that the proposed binary PSO-based algorithm has better results compared to the state-of-the-art GA-based algorithm.

Druh

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

CEP obor

JC - Počítačový hardware a software

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2015

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

Advances in Electrical and Electronic Engineering

ISSN

1336-1376

e-ISSN

—

Svazek periodika

13

Číslo periodika v rámci svazku

4

Stát vydavatele periodika

CZ - Česká republika

Počet stran výsledku

7

Strana od-do

392-398

Kód UT WoS článku

—

EID výsledku v databázi Scopus

2-s2.0-84948769777