Fast and Exact Mining of Probabilistic Data Streams - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Fast and Exact Mining of Probabilistic Data Streams

(1) , (1)
1
Reza Akbarinia
Florent Masseglia

Abstract

Discovering Probabilistic Frequent Itemsets (PFI) is very challenging since algorithms designed for deterministic data are not applicable in probabilistic data. The problem is even more difficult for probabilistic data streams where massive frequent updates need to be taken into account while respecting data stream constraints. In this paper, we propose FEMP (Fast and Exact Mining of Probabilistic data streams), the first solution for exact PFI mining in data streams with sliding windows. FEMP 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 FEMP and conducted an extensive experimental evaluation over synthetic and real-world data sets; the results illustrate its very good performance.

Dates and versions

lirmm-00838618 , version 1 (26-06-2013)

Identifiers

Cite

Reza Akbarinia, Florent Masseglia. Fast and Exact Mining of Probabilistic Data Streams. ECML PKDD 2013 - Joint European Conference on Machine Learning and Knowledge Discovery in Databases, Sep 2013, Prague, Czech Republic. pp.493-508, ⟨10.1007/978-3-642-40988-2_32⟩. ⟨lirmm-00838618⟩
398 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More