Pith. sign in

REVIEW

Enabling clustering algorithms to detect clusters of varying densities through scale-invariant data preprocessing

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2401.11402 v1 pith:2QPMH6U4 submitted 2024-01-21 cs.LG

classification cs.LG
keywords clusteringdataalgorithmsaresclustersdensitydetectpreprocessing
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Pith tools