Affiliations: [a] LSSD Laboratory, Department of Computer Science, University of science and Technology, Oran, Algeria, Algeria | [b] Hubert Curien Laboratory, UMR CNRS 5516, Jean Monnet University, France | [c] Receptors, Regulation and Tumor Cells Laboratory, Poitiers University, France | [d] ENSA-Tangier, Abdelmalek Essaadi University, Tangier, Morocco | [e] Systems and Data Engineering Team, ENSA-Tangier, Abdelmalek Essaadi University, Tangier, Morocco
Correspondence:
[*]
Corresponding author: Ahmed Moussa, Systems and Data Engineering Team, ENSA-Tangier, Tangier, Morocco. Tel.: +212 673 54 7317; Fax: +212 539 39 3743; E-mail: amoussa@uae.ac.ma.
Abstract: Conventional clustering algorithms optimize a single criterion, which may not conform to diverse needs of multidimensional data science. This paper proposes a new clustering algorithm that solves multiple clustering issues, called clustering by Marked Point Process (ClusterMPP). It is a new, efficient, scalable and unsupervised density-based clustering algorithm. ClusterMPP simulates a proposed Marked Point Process (MPP) to find clusters of complex shapes present in the raw data space. The outputs of this new algorithm, in the first step, are the observations belonging to each cluster mode called “prototypes”. The classification process is achieved, in the second step, using an improved KNN algorithm. We conduct intensive experiments to compare ClusterMPP with the most well-known algorithms. The results of ClusterMPP proved its efficiency on high complex and scalable datasets.
