A declarative framework for mining Top-k high utility itemsets - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2021

A declarative framework for mining Top-k high utility itemsets

Résumé

The problem of mining high utility itemsets entails identifying a set of items that yield the highest utility values based on a given user utility threshold. In this paper, we utilize propositional satisfiability to model the Top-k high utility itemset problem as the computation of models of CNF formulas. To achieve our goal, we use a decomposition technique to improve our method’s scalability by deriving small and independent sub-problems to capture the Top-k high utility itemsets. Through empirical evaluations, we demonstrate that our approach is competitive to the state-of-the-art specialized algorithms.
Fichier non déposé

Dates et versions

hal-03466369 , version 1 (05-12-2021)

Identifiants

Citer

Amel Hidouri, Said Jabbour, Badran Raddaoui, Mouna Chebbah, Boutheina Ben Yaghlane. A declarative framework for mining Top-k high utility itemsets. DaWaK 2021: 23rd international conference on Big Data Analytics and Knowledge Discovery, Sep 2021, Linz (online), Austria. pp.250-256, ⟨10.1007/978-3-030-86534-4_24⟩. ⟨hal-03466369⟩
26 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More