A probabilistic condensed representation of data for stream mining

Michael Geilke, Andreas Karwath, Stefan Kramer

Research output: Contribution to conference (unpublished)Paperpeer-review

4 Citations (Scopus)


Data mining and machine learning algorithms usually operate directly on the data. However, if the data is not available at once or consists of billions of instances, these algorithms easily become infeasible with respect to memory and run-time concerns. As a solution to this problem, we propose a framework, called MiDEO (Mining Density Estimates inferred Online), in which algorithms are designed to operate on a condensed representation of the data. In particular, we propose to use density estimates, which are able to represent billions of instances in a compact form and can be updated when new instances arrive. As an example for an algorithm that operates on density estimates, we consider the task of mining association rules, which we consider as a form of simple statements about the data. The algorithm, called POEt (Pattern mining on Online density esTimates), is evaluated on synthetic and real-world data and is compared to state-of-the-art algorithms.
Original languageEnglish
Publication statusPublished - 2014


  • density estimation, machine learning, stream mining


Dive into the research topics of 'A probabilistic condensed representation of data for stream mining'. Together they form a unique fingerprint.

Cite this