Graph-based clustering with DRepStream

Abstract

© 2017 ACM. Finding and setting input parameters for clustering algorithms is a challenging thing due to the unsupervised nature of clustering. The accuracy of clustering algorithms can be affected greatly by setting parameters appropriately for the dataset, however without ground truth labels and external validation it can be impossible to know when the parameters are set well. In this paper we propose the DRepStream algorithm, which extends the RepStream algorithm. DRepStream uses a graph-based approach, and unlike its predecessor does not require the primary K parameter used in K-nearest neighbour graphs. Our algorithm automatically computes the number of outgoing edges for each vertex in the graph using a computed metric known as the anomalous edge score. We evaluate the performance of our algorithm on other previous stream clustering algorithms on real world benchmark datasets.