An Adaptive Gradual Relational Association Rules Mining Approach

  • D.L. Miholca Department of Computer Science, Faculty of Mathematics and Computer Science, Babeș-Bolyai University, Cluj-Napoca, Romania

Abstract

This paper focuses on adaptive Gradual Relational Association Rules mining. Gradual Relational Association Rules capture gradual generic relations among data features. We propose AGRARM, an algorithm for mining the interesting Gradual Relational Association Rules characterizing a data set that has been extended with a number of new attributes, through adapting the set of interesting rules mined before extension, so as to preserve the completeness. We aim, through AGRARM, to make the mining process more efficient than resuming the mining algorithm on the enlarged data. We have experimentally evaluated AGRARM versus mining from scratch on three publicly available data sets. The obtained reduction in mining time highlights AGRARM’s efficiency, thus confirming the potential of our proposal.

Published
2018-06-19
How to Cite
MIHOLCA, D.L.. An Adaptive Gradual Relational Association Rules Mining Approach. Studia Universitatis Babeș-Bolyai Informatica, [S.l.], v. 63, n. 1, p. 94-110, june 2018. ISSN 2065-9601. Available at: <http://www.cs.ubbcluj.ro/~studia-i/journal/journal/article/view/24>. Date accessed: 29 nov. 2020. doi: https://doi.org/10.24193/subbi.2018.1.07.
Section
Articles