Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Formal and computational properties of the confidence boost of association rules

Autor
Balcazar, J. L.
Tipus d'activitat
Article en revista
Revista
ACM transactions on knowledge discovery from data
Data de publicació
2013-11
Volum
7
Número
4
Pàgina inicial
19-1
Pàgina final
19-41
DOI
https://doi.org/10.1145/2541268.2541272 Obrir en finestra nova
Resum
Some existing notions of redundancy among association rules allow for a logical-style characterization and lead to irredundant bases of absolutely minimum size. We push the intuition of redundancy further to find an intuitive notion of novelty of an association rule, with respect to other rules. Namely, an irredundant rule is so because its confidence is higher than what the rest of the rules would suggest; then, one can ask: how much higher? We propose to measure such a sort of novelty throug...
Paraules clau
Algorithms, Theory, Human Factors, Association Rule Mining, Association Rule Quality, Confidence
Grup de recerca
LARCA - Laboratori d'Algorísmia Relacional, Complexitat i Aprenentatge

Participants