Vše

Co hledáte?

Vše
Projekty
Výsledky výzkumu
Subjekty

Rychlé hledání

  • Projekty podpořené TA ČR
  • Významné projekty
  • Projekty s nejvyšší státní podporou
  • Aktuálně běžící projekty

Chytré vyhledávání

  • Takto najdu konkrétní +slovo
  • Takto z výsledků -slovo zcela vynechám
  • “Takto můžu najít celou frázi”

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

Identifikátory výsledku

  • Kód výsledku v 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>

  • Výsledek na webu

    <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>

Alternativní jazyky

  • Jazyk výsledku

    angličtina

  • Název v původním jazyce

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

  • Popis výsledku v původním jazyce

    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.

  • Název v anglickém jazyce

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

  • Popis výsledku anglicky

    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.

Klasifikace

  • Druh

    D - Stať ve sborníku

  • CEP obor

  • OECD FORD obor

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

Návaznosti výsledku

  • Projekt

    <a href="/cs/project/FW01010381" target="_blank" >FW01010381: Inteligentní robotická ochrana zdraví ekosystému hydroponického skleníku</a><br>

  • Návaznosti

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

Ostatní

  • Rok uplatnění

    2022

  • 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ů

Údaje specifické pro druh výsledku

  • Název statě ve sborníku

    2022 IEEE Workshop on Complexity in Engineering, COMPENG 2022

  • ISBN

    978-1-72817-124-1

  • ISSN

  • e-ISSN

  • Počet stran výsledku

    5

  • Strana od-do

  • Název nakladatele

    Institute of Electrical and Electronics Engineers Inc.

  • Místo vydání

    Piscataway, New Jersey

  • Místo konání akce

    Florencie

  • Datum konání akce

    18. 7. 2022

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

    WRD - Celosvětová akce

  • Kód UT WoS článku