Speed up Gradual Rule Mining from Stream Data: A B-Tree and OWA-based Approach - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles Journal of Intelligent Information Systems Year : 2010

Speed up Gradual Rule Mining from Stream Data: A B-Tree and OWA-based Approach

Abstract

Gradual rules allow users to be provided with rules describing the ordering correlations among attributes. Such a rule is for instance given by the higher the salary and the lower the number of cars, the higher the number of tourist travels. Previously intensively used in fuzzy command systems, these rules were manually provided to the system. More recently, they have received attention from the data mining community and methods have been defined to automatically extract and maintain gradual rules from numerical databases. However, no method has been shown to be able to handle data streams, as no method is scalable enough to manage the high rate which stream data arrive at. In this paper, we thus propose an original approach to mine data streams for gradual rules. Our method is based on B-Trees and OWA (Ordered Weighted Aggregation) operator in order to speed up the process. B-Trees are used to store already-known gradual rules in order to maintain the knowledge over time, while OWA operators provide a fast way to discard non relevant data.
Fichier principal
Vignette du fichier
gradualJIIS.pdf (621 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-00798704 , version 1 (25-03-2019)

Identifiers

Cite

Jordi Nin, Anne Laurent, Pascal Poncelet. Speed up Gradual Rule Mining from Stream Data: A B-Tree and OWA-based Approach. Journal of Intelligent Information Systems, 2010, 35 (3), pp.447-463. ⟨10.1007/s10844-009-0112-9⟩. ⟨lirmm-00798704⟩
86 View
78 Download

Altmetric

Share

Gmail Facebook X LinkedIn More