Abstract Clustering is a fundamental tool for analyzing large data sets. A rich body of work has been devoted to designing data-stream algorithms the relevant optimization problems such as k -center, -median, and -means. Such need be both time space efficient. In this paper, we address problem correlation clustering in dynamic stream model. The consists updates edge weights graph on n nodes goa...