Itemset Mining with Penalties - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2017

Itemset Mining with Penalties

Said Jabbour
Lakhdar Saïs
Yakoub Salhi


We introduce a preferences-based itemset mining framework. Preferences are encoded by a penalty function over the transactions in a database. We define an itemset mining problem where we associate to each transaction a penalty value. This problem consists in generating the frequent itemsets with a maximum penalty threshold. We then provide a propositional satisfiability based encoding. We extend the previous problem with a penalty function over items, where we use two maximum penalty thresholds, over the transactions and over the items. In this setting, computing the optimum itemsets corresponds to computing Pareto front. The experimental evaluation on real world data shows the feasibility of our approach.
No file

Dates and versions

lirmm-01799451 , version 1 (24-05-2018)



Said Jabbour, Souhila Kaci, Lakhdar Saïs, Yakoub Salhi. Itemset Mining with Penalties. ICTAI: International Conference on Tools with Artificial Intelligence, Nov 2016, San Jose, CA, United States. ⟨10.1109/ICTAI.2016.0148⟩. ⟨lirmm-01799451⟩
78 View
0 Download



Gmail Mastodon Facebook X LinkedIn More