Skip to Main content Skip to Navigation
Conference papers

FMU: Fast Mining of Probabilistic Frequent Itemsets in Uncertain Data Streams

Reza Akbarinia 1 Florent Masseglia 1
1 ZENITH - Scientific Data Management
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier, CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : Discovering Probabilistic Frequent Itemsets (PFI) in uncertain data is very challenging since algorithms designed for deterministic data are not applicable in this context. The problem is even more difficult for uncertain data streams where massive frequent updates need be taken into account while respecting data stream constraints. In this paper, we propose FMU (Fast Mining of Uncertain data streams), the rst solution for exact PFI mining in data streams with sliding windows. FMU allows updating the frequentness probability of an itemset whenever a transaction is added or removed from the observation window. Using these update operations, we are able to extract PFI in sliding windows with very low response times. Furthermore, our method is exact, meaning that we are able to discover the exact probabilistic frequentness distribution function for any monitored itemset, at any time. We implemented FMU and conducted an extensive experimental evaluation over synthetic and real-world data sets; the results illustrate its efficiency.
Document type :
Conference papers
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download
Contributor : Reza Akbarinia <>
Submitted on : Monday, November 5, 2012 - 3:55:36 PM
Last modification on : Tuesday, April 16, 2019 - 6:26:02 PM
Long-term archiving on: : Saturday, December 17, 2016 - 7:41:30 AM


Files produced by the author(s)


  • HAL Id : lirmm-00748605, version 1



Reza Akbarinia, Florent Masseglia. FMU: Fast Mining of Probabilistic Frequent Itemsets in Uncertain Data Streams. BDA: Bases de Données Avancées, 2012, Clermont-Ferrand, France. ⟨lirmm-00748605⟩



Record views


Files downloads