The STUDIA UNIVERSITATIS BABEŞ-BOLYAI issue article summary

The summary of the selected article appears at the bottom of the page. In order to get back to the contents of the issue this article belongs to you have to access the link from the title. In order to see all the articles of the archive which have as author/co-author one of the authors mentioned below, you have to access the link from the author's name.

 
       
         
    STUDIA INFORMATICA - Issue no. 1 / 2018  
         
  Article:   AN ADAPTIVE GRADUAL RELATIONAL ASSOCIATION RULES MINING APPROACH.

Authors:  DIANA-LUCIA MIHOLCA.
 
       
         
  Abstract:  
DOI: 10.24193/subbi.2018.1.07

Published Online: 2017-06-19
Published Print: 2017-06-25
pp. 94-110
VIEW PDF: An Adaptive Gradual Relational Association Rules Mining Approach

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.
2010 Mathematics Subject Classification. 68P15, 68T05, 62B86.
1998 CR Categories and Descriptors. H.2.8 [Database management]: Database Applications - Data Mining; I.2.6 [Computing Methodologies]: Artificial Intelligence - Learning.
Key words and phrases. data mining, Gradual Relational Association Rules, adaptive algorithm.
 
         
     
         
         
      Back to previous page