Maximally Informative k-Itemset Mining from Massively Distributed Data Streams

Mehdi Zitouni (1, 2) , Reza Akbarinia (2) , Sadok Ben Yahia (1) , Florent Masseglia (2)

1 FST - Faculté des Sciences Mathématiques, Physiques et Naturelles de Tunis
2 ZENITH - Scientific Data Management

We address the problem of mining maximally informative k-itemsets (miki) in data streams based on joint entropy. We propose PentroS, a highly scalable parallel miki mining algorithm. PentroS renders the mining process of large volumes of incoming data very efficient. It is designed to take into account the continuous aspect of data streams, particularly by reducing the computations of need for updating the miki results after arrival/departure of transactions to/from the sliding window. PentroS has been extensively evaluated using massive real-world data streams. Our experimental results confirm the effectiveness of our proposal which allows excellent throughput with high itemset length.

Domaines: Informatique [cs]; Base de données [cs.DB]; Calcul parallèle, distribué et partagé [cs.DC]; Théorie de l'information [cs.IT]

Mehdi Zitouni, Reza Akbarinia, Sadok Ben Yahia, Florent Masseglia. Maximally Informative k-Itemset Mining from Massively Distributed Data Streams. SAC: Symposium on Applied Computing, Apr 2018, Pau, France. pp.502-509, ⟨10.1145/3167132.3167187⟩. ⟨hal-01711990⟩