Algorithms Based on Dynamic Minimum Probabilistic Support and Utility Thresholds for Mining Top-K High-Utility Itemsets From Uncertain Databases
Mining high-utility itemsets (HUIs) from large and uncertain databases is challenging due to the vast data volume and extensive search space. Determining the minimum utility and probabilistic support for all items is also a time-consuming task. Setting these thresholds too high results in too few it...
Na minha lista:
| Principais autores: | , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
IEEE
2025-01-01
|
| coleção: | IEEE Access |
| Assuntos: | |
| Acesso em linha: | https://ieeexplore.ieee.org/document/11173640/ |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|