Quantitative evaluation of internal clustering validation indices using binary datasets
preprint
OA: closed
CC-BY-NC-4.0
AI-generated summary
This paper evaluated 27 geometric and non-geometric internal clustering validation indices on simulated binary datasets with varying noise levels and three clustering algorithms to guide index selection.
One-sentence paraphrase of the abstract; not a substitute for reading it. No clinical advice. How this works
Abstract
Different clustering methods often classify the same dataset differently. Selecting the ‘best’ clustering solution out of a multitude of alternatives is possible with cluster validation indices. The behavior of validity indices changes with the structure of the sample and the properties of the clustering algorithm. Unique properties of each index cause increasing or decreasing performance in some conditions. Due to the large variety of cluster validation indices, choosing the most suitable index concerning the dataset and clustering algorithms is challenging. We aim to assess different internal clustering validation indices. In the present paper, the validity indices consist of geometric and non-geometric methods. For this purpose, we applied simulated datasets with different noise levels. Each dataset was repeated 20 times. Three clustering algorithms with Jaccard dissimilarity are used, and 27 clustering validation indices are evaluated. The results provide a reliability guideline for the selection cluster validity indices.
My notes (saved in your browser only)
Citation neighborhood (no data yet)
We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.
Source provenance
- europepmc
- last seen: 2026-05-19T01:45:01.086888+00:00
- unpaywall
- last seen: 2026-05-27T02:00:06.600101+00:00
License: CC-BY-NC-4.0