Title: Random neighbourhood dynamic clustering

Authors: Nilesh Patel; Gaurav Tyagi; Pawel Marcinek

Addresses: School of Engineering and Computer Science, Oakland University, Rochester, MI, USA ' School of Engineering and Computer Science, Oakland University, Rochester, MI, USA ' Department of Mathematics and Statistics, Oakland University, Rochester, MI, USA

Abstract: Recognition of arbitrary shaped clusters is a highly active research topic in data mining and cluster analysis. In this paper, we consider the problem of data clustering of arbitrary shaped clusters as a random evolutionary process. We propose a new algorithm RNDC which uses the random process for cluster analysis. RNDC assumes that an object contains information only about the characteristic values of its local neighbourhood. It explores the local cluster structures to determine the global partitions of dataset. It is of significance that RNDC evolve randomly among the objects of dataset, while other well-known partitioning clustering algorithms used the techniques of sequential propagation through the nearest connected/reachable objects. Our method is, in principle, applicable for any arbitrary shaped clusters. Since randomness is an essential part of RNDC, it makes this algorithm suitable for multiprocessing parallel computation.

Keywords: dynamic clustering; random propagation; neighbourhood-based method.

DOI: 10.1504/IJCVR.2018.095001

International Journal of Computational Vision and Robotics, 2018 Vol.8 No.5, pp.476 - 491

Available online: 24 Sep 2018 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article