Skip to Main Content
ASME Press Select Proceedings

International Conference on Information Technology and Computer Science, 3rd (ITCS 2011)

Editor
V. E. Muhin
V. E. Muhin
National Technical University of Ukraine
Search for other works by this author on:
W. B. Hu
W. B. Hu
Wuhan University
Search for other works by this author on:
ISBN:
9780791859742
No. of Pages:
656
Publisher:
ASME Press
Publication date:
2011

The clustering algorithm and its analysis are very important methods in data mining. Under the sliding window model of the data stream, this paper presents a new density-based clustering algorithm DSJstream, introduced the concept of density, so it can find any shape, any number of clusters, it can analyze and compare the history of the evolution of data stream. At the same time, by the fading strategy and the granularity adjustment strategy, it is to clear up the forgetting problem of historical data stream. It is very good to deal with noise, save memory effectively and prevent memory overflow. Through experimental analysis proved that the algorithm has good scalability, effectiveness. It is suit for the clustering and analysis under the fast flow rate, large amount of data environment.

This content is only available via PDF.
Close Modal
This Feature Is Available To Subscribers Only

Sign In or Create an Account

Close Modal
Close Modal