Clustering Distributed Sensor Data Streams
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
In this work we study the problem of continuously maintain a cluster structure over the data points generated by a sensor network. We propose DGClust, a new distributed algorithm which reduces both the dimensionality and the communication burdens, by allowing each local sensor to keep an online discretization of its data stream. Each new data point triggers a cell in this univariate grid, reflecting the current state of the data stream at the local site. Whenever a local site changes its state, it notifies the central server about the new state it is in. The central site keeps a small list of counters of the most frequent global states. A simple adaptive partitional clustering algorithm is applied to the frequent states central points, providing an anytime definition of the clusters centers. The approach is evaluated in the context of distributed sensor networks, presenting empirical and theoretical evidence of its advantages.
Download slides: ecmlpkdd08_rodrigues_cdsd_01.pdf (1.3 MB)
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !