Contextual association rules represent co-occurrences between contexts and properties of data, where the context is a set of environmental or user personal features employed to customize an application. Due to their particular structure, these rules can be very tricky to mine, and if the process is not carried out with care, an unmanageable set of not significant rules may be extracted. In this paper we survey two existing algorithms for relational databases and present a novel algorithm that merges the two proposals overcoming their limitations.
Discovering Contextual Association Rules in Relational Databases
E. Quintarelli;
2013-01-01
Abstract
Contextual association rules represent co-occurrences between contexts and properties of data, where the context is a set of environmental or user personal features employed to customize an application. Due to their particular structure, these rules can be very tricky to mine, and if the process is not carried out with care, an unmanageable set of not significant rules may be extracted. In this paper we survey two existing algorithms for relational databases and present a novel algorithm that merges the two proposals overcoming their limitations.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
QuintarelliR13.pdf
non disponibili
Dimensione
229.45 kB
Formato
Adobe PDF
|
229.45 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
