Mining Top-K high utility itemset using bio-inspired algorithms

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F70883521%3A28140%2F22%3A63556578" target="_blank" >RIV/70883521:28140/22:63556578 - isvavai.cz</a>

Result on the web

<a href="https://ieeexplore.ieee.org/document/9905433" target="_blank" >https://ieeexplore.ieee.org/document/9905433</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/COMPENG50184.2022.9905433" target="_blank" >10.1109/COMPENG50184.2022.9905433</a>

Result language

angličtina

Original language name

Mining Top-K high utility itemset using bio-inspired algorithms

Original language description

High utility itemset (HUI) mining is a necessary research problem in the field of knowledge discovery and data mining. Many algorithms for Top-K HUI mining have been proposed. However, the principal issue with these algorithms is that they need to store potential top-k patterns in the memory anytime, and they request the minimum utility threshold to automatically rise when finding HUIs. Consequently, the performance of existing exact algorithms for Top-K HUIs mining tends to decrease when the database size and the number of distinct items in the databases rise. To address this issue, we suggest a Binary Particle Swarm Optimization (BPSO) based algorithm for mining Top-K HUIs effectively, namely TKO-BPSO (Top-K high utility itemset mining in One phase based on Binary Particle Swarm Optimization). The main idea of TKO-BPSO is not only to use a one-phase model and strategy Raising the threshold by the Utility of Candidates (RUC) to effectively increase the border thresholds for pruning the search space but also to adopt the sigmoid function in the updating process of the particles. This might significantly reduce the combinational problem in traditional HUIM when the database size and the number of distinct items in the databases rise. Consequently, its performance outperforms existing exact algorithms for mining Top-K HUIs because it efficiently overcomes the problem of the vast amount candidates. Substantial experiments conducted on publicly available several real and synthetic datasets show that the proposed algorithm has better results than existing state-of-the-art algorithms in terms of runtime, which can significantly reduce the combinational problem and memory usage. © 2022 IEEE.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

<a href="/en/project/FW01010381" target="_blank" >FW01010381: Intelligent robotic health protection of the hydroponic greenhouse ecosystem</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2022

Confidentiality

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

Article name in the collection

2022 IEEE Workshop on Complexity in Engineering, COMPENG 2022

ISBN

978-1-72817-124-1

ISSN

—

e-ISSN

—

Number of pages

5

Pages from-to

—

Publisher name

Institute of Electrical and Electronics Engineers Inc.

Place of publication

Piscataway, New Jersey

Event location

Florencie

Event date

Jul 18, 2022

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—