Towards a unifying probabilistic implicative normalized quality measure for association rules

5Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We define the so-called normalized probabilistic quality measures (PQM) for association rules; that is, PQMs whose values lay between minus one and plus one, and which take into account reference situations such as incompatibility, repulsion, independence, attraction, and logical implication, between the antecedent and the consequent of association rules. Moreover, we characterize the PQMs that can be normalized and propose a way to normalize them. On the other hand, we consider a normalized and implicative PQM called MGK. It appears that MGK is the normalized PQM associated to most of the PQMs proposed in the literature. Furthermore, it satisfies additional properties, including Piatetsky-Shapiro's principles and Freitas's. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Diatta, J., Ralambondrainy, H., & Totohasina, A. (2007). Towards a unifying probabilistic implicative normalized quality measure for association rules. Studies in Computational Intelligence, 43, 237–250. https://doi.org/10.1007/978-3-540-44918-8_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free