Time Complexity improvement of the First Processing stage of the Intelligent Clustering

Abstract

A new approach for data clustering is presented. IC clustering [1] initial processing stage is changed, so that the interval between the smallest and the largest radius-vector is divided into k equal sub-intervals. Each sub-interval is associated to a cluster. Depending on which sub-interval a radius-vector belongs, it is initially distributed within a cluster, associated with that sub-interval.