An improved algorithm for partial clustering

摘要

Expert and intelligent systems use a variety of machine learning techniques to obtain and understand the information inherent in the data. Clustering is one of these techniques, which has become important and popular since it allows classifying an unlabeled dataset into clusters of similar objects. There are many clustering algorithms that have been proposed in the literature. From these algorithms, the Cross-Clustering algorithm is one of the most recent clustering algorithms for partial clustering (clustering where not necessarily all the objects are grouped into clusters), which has provided good results allowing estimating a suitable set of clusters, as well as eliminating outliers. However, this algorithm tends to eliminate too many objects as outliers, which leads to discard a lot of non-outlier objects. Additionally, the Cross-Clustering algorithms spends a lot of time evaluating several combinations of clusterings, trying to determine a suitable number of clusters. To overcome these problems, in this paper, an improved version of the Cross-Clustering algorithm (ICC) is proposed. ICC changes the clustering algorithm used for detecting outliers, as well as it modifies the way outliers are detected. Moreover, a stop criterion allowing to make a fast decision on the estimation of a suitable number of cluster, is also introduced. The performance of the improved Cross-Clustering algorithm is compared with the original algorithm on artificial and real datasets. Our results show that ICC improves the original algorithm and other state of the art clustering algorithms; in both, runtime and clustering quality. (C) 2018 Elsevier Ltd. All rights reserved.