Mining exceptions in databases

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

Abstract

This paper addresses the problem of mining exceptions from multidimensional databases. The goal of our proposed model is to find association rules that become weaker in some specific subsets of the database. The candidates for exceptions are generated combining previously discovered multidimensional association rules with a set of significant attributes specified by the user. The exceptions are mined only if the candidates do not achieve an expected support. We describe a method to estimate these expectations and propose an algorithm that finds exceptions. Experimental results are also presented. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Gonçalves, E. C., Mendes, I. M. B., & Plastino, A. (2004). Mining exceptions in databases. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3339, pp. 1076–1081). Springer Verlag. https://doi.org/10.1007/978-3-540-30549-1_104

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