Show simple item record

dc.contributor.authorLuhr, Sebastian
dc.contributor.authorLazarescu, Mihai
dc.date.accessioned2017-01-30T14:05:17Z
dc.date.available2017-01-30T14:05:17Z
dc.date.created2015-03-03T20:17:39Z
dc.date.issued2009
dc.identifier.citationLuhr, S. and Lazarescu, M. 2009. Incremental clustering of dynamic data streams using connectivity based representative points. Data & Knowledge Engineering. 68 (1): pp. 1-27.
dc.identifier.urihttp://hdl.handle.net/20.500.11937/37647
dc.identifier.doi10.1016/j.datak.2008.08.006
dc.description.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.

dc.publisherElsevier Science Publishers B. V. Amsterdam
dc.relation.urihttp://portal.acm.org/citation.cfm?id=1464905
dc.titleIncremental clustering of dynamic data streams using connectivity based representative points
dc.typeJournal Article
dcterms.source.volume68
dcterms.source.number1
dcterms.source.startPage1
dcterms.source.endPage27
dcterms.source.issn0169023X
dcterms.source.titleData & Knowledge Engineering
curtin.departmentDepartment of Computing
curtin.accessStatusFulltext not available


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record