5. Research Intention Towards Incremental Clustering

Incremental clustering is nothing but a process of grouping new incoming or incremental data into classes or clusters. It mainly clusters the randomly new data into a similar group of clusters. The existing K-means and DBSCAN clustering algorithms are inefficient to handle the large dynamic databases because, for every change in the incremental database, they simply run their algorithms repeatedly, taking lots of time to properly cluster those new ones coming data. It takes too much time and has also been realized that applying the existing algorithm frequently for updated databases may be too costly. So, the existing K-means clustering algorithm is not suitable for a dynamic environment. That’s why incremental versions of K-means and DBSCAN have been introduced in our work to overcome these challenges. To address the aforementioned issue, incremental clustering algorithms were developed to measure new cluster centers by simply computing the distance of new data from the means of current clusters rather than rerunning the entire clustering procedure. Both the K-means and the DBSCANDBSCAN algorithms use a similar approach. As a result, it specifies the delta change in the original database at which incremental K-means or DBSCANDBSCAN clustering outperforms prior techniques.