Data clustering is a method of putting same data object into group. A clustering rule does partitions of a data set into many groups supported the principle of maximizing the intra-class similarity and minimizing the inter-class similarity. Finding clusters in object, particularly high dimensional object, is difficult when the clusters are different shapes, sizes, and densities, and when data contains noise and outliers. This paper provides a new clustering algorithm for normalized data set and proven that our new planned clustering approach work efficiently when dataset are normalized.
Nidhi, & Patel, K. A. (2016). An Efficient and Scalable Density-based Clustering Algorithm for Normalize Data. In Procedia Computer Science (Vol. 92, pp. 136–141). Elsevier B.V. https://doi.org/10.1016/j.procs.2016.07.336