DynGRAR: A dynamic approach to mining gradual relational association rules

Citations of this article
Mendeley users who have this article in their library.


Relational Association Rules (RARs) capture generic relations between attributes values in possibly large data sets. Due to their ability to uncover underlying semantically relevant patterns, they are of particular interest in data mining research and applicable in both unsupervised and supervised learning scenarios. With the aim of increasing the stability and expressiveness of the classical, non-gradual RARs, Gradual Relational Association Rules (GRARs) have been introduced. By generalizing the boolean relations to gradual relations, GRARs also capture the degrees to which generic relations are satisfied. In the current paper we introduce a new approach called DynGRAR (Dynamic Gradual Relational Association Rules Miner) for uncovering interesting GRARs in dynamic data sets which are incrementally extended with both new data instances and new data attributes. DynGRAR dynamically adjusts the set of all interesting GRARs. Through multiple experiments performed on publicly available software defect prediction data sets, we have evaluated DynGRAR versus applying the standard GRARs mining algorithm from scratch on the extended data. The results obtained emphasize the superior performance of the dynamic approach we propose.




Miholca, D. L., & Czibula, G. (2019). DynGRAR: A dynamic approach to mining gradual relational association rules. In Procedia Computer Science (Vol. 159, pp. 10–19). Elsevier B.V. https://doi.org/10.1016/j.procs.2019.09.155

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