Abstract
Data mining is the discovery of previously unknown or hidden and potentially useful knowledge in databases. In this paper, we present an algorithm, called BRRA, that mines relationships in a database in order to derive compact rules set. This algorithm is based on a mathematical concept called relevant rectangles representing full association between a set of i arguments and a set of j images in a binary relation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
R. Agrawal, T. Imielinski and A. Swami. Mining Association Rules between sets of items in large Databases. ACM SIGMOD Records, pages 207–216, 1993.
N. Belkhiter, C. Bourhfir and A. Jaoua. Décomposition rectangulaire optimale d’une relation binaire: Application aux bases de données documentaires. INFOR, 32(1):33–54, 1994.
J. R. Quinlan. Induction of decision trees. Machine learning, (1):81–106, 1986.
Y. cai, N. cercone and J. Han. Attribute-oriented Induction in relational databases. In Knowledge Discovery in Databases. Menlo Park, CA: AAAI/MIT, pages 213–228, 1991.
S.J. Yen and Arbee L.P. Chen. The analysis of relationships in databases for rule derivation. In Journal of Intelligent Information Systems, 7(3):235–260, 1996.
W. Ziarko. The discovery, Analysis, and representation of data dependencies. In Knowledge Discovery in Databases. Menlo Park, CA: AAAI/MIT, pages 195–209, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yahia, S.B., Jaoua, A. (1999). BRRA: A Based Relevant Rectangles Algorithm for Mining Relationships in Databases. In: Zhong, N., Zhou, L. (eds) Methodologies for Knowledge Discovery and Data Mining. PAKDD 1999. Lecture Notes in Computer Science(), vol 1574. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48912-6_70
Download citation
DOI: https://doi.org/10.1007/3-540-48912-6_70
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65866-5
Online ISBN: 978-3-540-48912-2
eBook Packages: Springer Book Archive