Incremental clustering of dynamic data streams using connectivity based representative points. Lühr, S. & Lazarescu, M. Data Knowl. Eng., 68:1–27, January, 2009.
doi  abstract   bibtex   
We present an incremental graph-based clustering algorithm whose design was motivated by a need to extract and retain meaningful information from data streams produced by applications such as large scale surveillance, network packet inspection and financial transaction monitoring. To this end, the method we propose utilises representative points to both incrementally cluster new data and to selectively retain important cluster information within a knowledge repository. The repository can then be subsequently used to assist in the processing of new data, the archival of critical features for off-line analysis, and in the identification of recurrent patterns.
@article{luhr_incremental_2009,
	title = {Incremental clustering of dynamic data streams using connectivity based representative points},
	volume = {68},
	doi = {10.1016/j.datak.2008.08.006},
	abstract = {We present an incremental graph-based clustering algorithm whose design was motivated by a need to extract and retain meaningful information from data streams produced by applications such as large scale surveillance, network packet inspection and financial transaction monitoring. To this end, the method we propose utilises representative points to both incrementally cluster new data and to selectively retain important cluster information within a knowledge repository. The repository can then be subsequently used to assist in the processing of new data, the archival of critical features for off-line analysis, and in the identification of recurrent patterns.},
	journal = {Data Knowl. Eng.},
	author = {Lühr, Sebastian and Lazarescu, Mihai},
	month = jan,
	year = {2009},
	pages = {1--27},
}

Downloads: 0