Enabling clustering algorithms to detect clusters of varying densities through scale-invariant data preprocessing
In this paper, we show that preprocessing data using a variant of rank transformation called 'Average Rank over an Ensemble of Sub-samples (ARES)' makes clustering algorithms robust to data representation and enable them to detect varying density clusters. Our empirical results, obtained using three most widely used clustering algorithms-namely KMeans, DBSCAN, and DP (Density Peak)-across a wide range of real-world datasets, show that clustering after ARES transformation produces better and more consistent results.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringSimilar Papers 제목 키워드 기반
DenMune: Density peak based clustering using mutual nearest neighbors
Many clustering algorithms fail when clusters are of arbitrary shapes, of varying densities, or the data classes are unbalanced and close to each other, even in two dimensions. A novel clustering algorithm, DenMune is pr…
ClusteringCRAD: Clustering with Robust Autocuts and Depth
We develop a new density-based clustering algorithm named CRAD which is based on a new neighbor searching function with a robust data depth as the dissimilarity measure. Our experiments prove that the new CRAD is highly …
ClusteringTime SeriesTime Series AnalysisTime Series ClusteringDetecting outliers by clustering algorithms
Clustering and outlier detection are two important tasks in data mining. Outliers frequently interfere with clustering algorithms to determine the similarity between objects, resulting in unreliable clustering results. C…
ClusteringOutlier DetectionA Domain Adaptive Density Clustering Algorithm for Data with Varying Density Distribution
As one type of efficient unsupervised learning methods, clustering algorithms have been widely used in data mining and knowledge discovery with noticeable advantages. However, clustering algorithms based on density peak …
ClusteringRecovering Unbalanced Communities in the Stochastic Block Model With Application to Clustering with a Faulty Oracle
The stochastic block model (SBM) is a fundamental model for studying graph clustering or community detection in networks. It has received great attention in the last decade and the balanced case, i.e., assuming all clust…
ClusteringCommunity DetectionGraph ClusteringStochastic Block Model