How the Outliers Influence the Quality of Clustering?
Open Access
Abstract
In this article, we evaluate the efficiency and performance of two clustering algorithms: (Agglomerative Hierarchical Clustering) and . We are aware that there are various linkage options and distance measures that influence the clustering results. We assess the quality of clustering using the Davies–Bouldin and Dunn cluster validity indexes. The main contribution of this research is to verify whether the quality of clusters without outliers is higher than those with outliers in the data. To do this, we compare and analyze outlier detection algorithms depending on the applied clustering algorithm. In our research, we use and compare the (Local Outlier Factor) and (Connectivity-based Outlier Factor) algorithms for detecting outliers before and after removing , , and of outliers. Next, we analyze how the quality of clustering has improved. In the experiments, three real data sets were used with a different number of instances.
Keywords
This publication has 7 references indexed in Scilit:
- Local and Global Outlier Detection Algorithms in Unsupervised Approach: A ReviewIraqi Journal for Electrical and Electronic Engineering, 2021
- Outliers in rules - the comparision of LOF, COF and KMEANS algorithmsProcedia Computer Science, 2020
- A Comparative Study on K-Means Clustering and Agglomerative Hierarchical ClusteringInternational Journal of Emerging Trends in Engineering Research, 2020
- Outlier Detection: Techniques and Applications2019
- LOF2000
- Well-Separated Clusters and Optimal Fuzzy PartitionsJournal of Cybernetics, 1974
- A general theory of classificatory sorting strategies: II. Clustering systemsThe Computer Journal, 1967