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”

Efficient mining of high average-utility itemsets

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F17%3A10236456" target="_blank" >RIV/61989100:27240/17:10236456 - isvavai.cz</a>

  • Alternative codes found

    RIV/61989100:27740/17:10236456

  • Result on the web

    <a href="https://www.taylorfrancis.com/books/e/9781498779456/chapters/10.1201%2F9781315375083-37" target="_blank" >https://www.taylorfrancis.com/books/e/9781498779456/chapters/10.1201%2F9781315375083-37</a>

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Efficient mining of high average-utility itemsets

  • Original language description

    In traditional High-Utility Itemset Mining (HUIM), the utility of an itemset is defined as the sum of the utilities of its items in transactions where it appears. An important problem with this definition is that it does not take itemset length into account. To provide a better assessment of each itemset’s utility, the task of High Average-Utility Itemset Mining (HAUIM) was proposed and several algorithms have been extensively studied. Most of the past works are based on level-wise or patterngrowth approaches, which required amounts of computation to mine the required High Average-Utility Itemsets (HAUIs). In this paper, we present an efficient Average-Utility (AU)-list structure to discover the HAUIs more efficiently. A depth-first search algorithm named HAUI-Miner is proposed to explore the search space without candidate generation, and an efficient pruning strategy is developed to reduce the search space and speed up the mining process. Extensive experiments are conducted to compare the performance of HAUI-Miner with the state-of-the-art algorithms of HAUIM in terms of runtime and number of determining nodes.

  • 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

    2017

  • 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

    Communication, Management and Information Technology - Proceedings of the International Conference on Communication, Management and Information Technology, ICCMIT 2016

  • ISBN

    978-1-315-37508-3

  • ISSN

  • e-ISSN

    neuvedeno

  • Number of pages

    8

  • Pages from-to

    241-248

  • Publisher name

    CRC Press

  • Place of publication

    Leiden

  • Event location

    Cosenza

  • Event date

    Apr 26, 2016

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article