Abstract

Efficient density estimation over an open-ended stream of high-dimensional data is of primary importance to machine learning. In general, parametric methods for density estimation are not suitable for high dimensions, and the widely used non-parametric methods like kernel density estimation (KDE) method fail for high-dimensional datasets. In this paper we present a framework for density estimation over stationary and non-stationary high-dimensional data streams. It is based on a blockized implementation of the Bayesian sequential partitioning (BSP) algorithm. The proposed framework satisfies the general design criteria for systems with the mission of online machine learning and data mining over data streams.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call