All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Student research abstract: Mining high average utility pattern using bio-inspired algorithm

The result's identifiers

  • Result code in IS VaVaI

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

  • Result on the web

    <a href="http://dx.doi.org/10.1145/3477314.3506970" target="_blank" >http://dx.doi.org/10.1145/3477314.3506970</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1145/3477314.3506970" target="_blank" >10.1145/3477314.3506970</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Student research abstract: Mining high average utility pattern using bio-inspired algorithm

  • Original language description

    High average utility pattern (itemset) Mining (HAUIM) is a necessary research problem in the field of knowledge discovery and data mining. Several algorithms have been proposed to mine high average-utility itemsets (HAUIs). Nonetheless, the large search space leads to poor performance because of excessive execution time and memory usage. To handle this limitation, particle swarm optimization (PSO) is applied to mine HAUIs. In this paper, an effective Binary PSO-based algorithm namely HAUIM-BPSO is proposed to explore HAUI efficiently. In general, HAUIM-BPSO first sets the number of discovered potential high average-utility 1-itemsets (1-PHAUIs) as the size of a particle based on average utility upper bound (AUUB) property. The sigmoid function is also used in the updating process of the individual of the proposed HAUIM-BPSO algorithm. Substantial experiments conducted on publicly available 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, memory usage, and convergence speed. © 2022 Owner/Author.

  • Czech name

  • Czech description

Classification

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

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2022

  • Confidentiality

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

Data specific for result type

  • Article name in the collection

    Proceedings of the ACM Symposium on Applied Computing

  • ISBN

    978-1-4503-8713-2

  • ISSN

  • e-ISSN

  • Number of pages

    4

  • Pages from-to

    445-448

  • Publisher name

    Association for Computing Machinery

  • Place of publication

    New York

  • Event location

    on-line

  • Event date

    Apr 25, 2022

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article